Upper bound of network capacity and a static optimal packet routing strategy
From MaRDI portal
Publication:1782676
Recommendations
Cites work
- scientific article; zbMATH DE number 5454665 (Why is no real title available?)
- Collective dynamics of `small-world' networks
- Complex networks: structure and dynamics
- Efficient routing on scale-free networks based on local information
- Emergence of Scaling in Random Networks
- The maximum concurrent flow problem
Cited in
(8)- A piecewise linear upper bound on the network recourse function
- Path capacity dimensioning in a multiprotocol label switched network: Analysis of optimal and suboptimal solutions
- A heuristic approach for capacity expansion of packet networks
- Bounding the maximum size of a packet radio network
- Network optimization for unified packet and circuit switched networks
- scientific article; zbMATH DE number 4145830 (Why is no real title available?)
- Improve traffic efficiency with advanced travel time feedback in urban networks
- A csomagtovábbítás skálázhatósága: korlátok és optimumok
This page was built for publication: Upper bound of network capacity and a static optimal packet routing strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782676)