Upper bound of network capacity and a static optimal packet routing strategy

DOI10.1016/J.PHYSA.2014.01.045zbMATH Open1395.90041OpenAlexW2052074900MaRDI QIDQ1782676FDOQ1782676

Authors: Caihong Kai, Jiancheng Long, Xiang Ling, Mao-Bin Hu 

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2014.01.045

Recommendations

• Network routing capacity
• On the capacity assignment problem in packet-switching computer networks
• scientific article; zbMATH DE number 4149863
• Optimal dynamic routing in communication networks with continuous traffic
• Upper Bounds to Transport Capacity of Wireless Networks

zbMATH Keywords

network capacityscale-free networkstraffic efficiencyMAX-flow-MIN-cost problempacket routing strategy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Collective dynamics of `small-world' networks
• The maximum concurrent flow problem
• Efficient routing on scale-free networks based on local information
• Title not available (Why is that?)

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
• Title not available (Why is that?)
• 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

Uses Software

• GAMS

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)