Sciweavers

8 search results - page 1 / 2
» Reduced state fair queuing for edge and core routers
Sort
View
NOSSDAV
2004
Springer
13 years 10 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
INFOCOM
2000
IEEE
13 years 9 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
INFOCOM
2002
IEEE
13 years 9 months ago
Self-Verifying CSFQ
— Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that ha...
Ion Stoica, Hui Zhang, Scott Shenker
ICCCN
2007
IEEE
13 years 11 months ago
Work-Conserving Fair-Aggregation Across Multiple Core Networks
—In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, Flow Aggregation outperforms Dynamic Packet State...
Jorge Arturo Cobb, Zhe Xu
INFOCOM
2000
IEEE
13 years 9 months ago
Adaptive Proportional Routing: A Localized QoS Routing Approach
Abstract—Most of the QoS routing schemes proposed so far require periodic exchange of QoS state information among routers, imposing both communication overhead on the network and...
Srihari Nelakuditi, Zhi-Li Zhang, Rose P. Tsang