Sciweavers

37 search results - page 5 / 8
» Packet Scheduling with Buffer Management for Fair Bandwidth ...
Sort
View
ICCCN
2008
IEEE
14 years 6 days ago
Work-Conserving Fair-Aggregation with Rate-Independent Delay
—Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary a...
Jorge Arturo Cobb
CN
2004
110views more  CN 2004»
13 years 5 months ago
TCP and UDP performance for Internet over optical packet-switched networks
A strong candidate for the future Internet core is optical packet-switched (OPS) network. In this paper, we study the impact of mechanisms as employed in OPS networks on the perfo...
Jingyi He, S.-H. Gary Chan
ATMN
1996
13 years 7 months ago
Dynamic time sharing: a new approach for congestion management
A new approach for bandwidth allocation and congestion control is reported in this paper, which is of the Rate Controlled admission with Priority Scheduling service type. It is ca...
Adrian Popescu, Parag Pruthi
ISCC
2007
IEEE
127views Communications» more  ISCC 2007»
14 years 1 days ago
Head-to-Tail: Managing Network Load through Random Delay Increase
Window-based congestion control is typically based on exhausting bandwidth capacity, which occasionally leads to transient congestion. Moreover, flow synchronization may deteriora...
Stylianos Dimitriou, Vassilis Tsaoussidis
INFOCOM
2006
IEEE
13 years 11 months ago
Scheduling in Non-Blocking Buffered Three-Stage Switching Fabrics
— Three-stage non-blocking switching fabrics are the next step in scaling current crossbar switches to many hundreds or few thousands of ports. Congestion (output contention) man...
Nikolaos Chrysos, Manolis Katevenis