Sciweavers

28 search results - page 1 / 6
» The Throughput of Data Switches with and without Speedup
Sort
View
INFOCOM
2000
IEEE
13 years 9 months ago
The Throughput of Data Switches with and without Speedup
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
J. G. Dai, Balaji Prabhakar
CCR
2006
122views more  CCR 2006»
13 years 4 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
INFOCOM
2007
IEEE
13 years 11 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
HOTI
2005
IEEE
13 years 10 months ago
Long Round-Trip Time Support with Shared-Memory Crosspoint Buffered Packet Switch
— The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N2 ), where N is the number of port...
Ziqian Dong, Roberto Rojas-Cessa
INFOCOM
2003
IEEE
13 years 10 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid