Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

IPL
2002

favoriteEmaildiscussreport

88views more IPL 2002»

A note on practical construction of maximum bandwidth paths

13 years 4 months ago

A note on practical construction of maximum bandwidth paths

Download faculty.cs.tamu.edu

Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it has been proposed that a maximum bandwidth path be constructed by a modified Dijkstra's algorithm or by a modified Bellman

Navneet Malpani, Jianer Chen

Real-time Traffic

Algorithms | IPL 2002 | Maximum Bandwidth | Maximum Bandwidth Paths |

claim paper

Related Content

» Polynomial Time Approximations for MultiPath Routing with Bandwidth and Delay Constraints

» Routing in multihop wireless mesh networks with bandwidth guarantees

» An auction mechanism for allocating the bandwidth of networks to their users

» InterferenceAware Multicasting in Wireless Mesh Networks

» Scheduling Bulk File Transfers with Start and End Times

» A QoSaware routing mechanism for multichannel multiinterface adhoc networks

» Routing and Admission Control in General Topology Networks with Poisson Arrivals

» Mobile IPv6 Extensions to support Nested Mobile Networks

» Reordering buffers for general metric spaces

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	IPL
Authors	Navneet Malpani, Jianer Chen

Comments (0)