Sciweavers

SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 6 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
QOFIS
2004
Springer
13 years 10 months ago
Survivable Online Routing for MPLS Traffic Engineering
Traffic engineering capabilities defined in MPLS enables QoS online routing of LSPs. In this paper we address issues of network survivability in online routing. We define a new lin...
Krzysztof Walkowiak
BROADNETS
2007
IEEE
13 years 11 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta