661 search results - page 1 / 133 » Bandwidth Sharing: Objectives and Algorithms |
INFOCOM
1999
IEEE
13 years 8 months ago
1999
IEEE
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the so-called max
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
IPL
2006
13 years 4 months ago
2006
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...