The throughput of data switches with and without speedup

Dai, J. G.; Prabhakar, Balaji

doi:10.1109/infcom.2000.832229

Cited by 375 publications

(416 citation statements)

References 18 publications

Supporting

Mentioning

410

Contrasting

Unclassified

Order By: Relevance

“…The 100% Ideal Throughput For best-effort service, the most important quality is the throughput. So in order to evaluate the performance of a bandwidth regulator, we first define the concept of 100% ideal throughput, based on the definition of rate stable [5].We say the input traffic satisfies the strong law of large numbers (SLLN) if for any (i,j) the following holds with probability 1:…”

Section: An 100% Ideal Throughput Allocationmentioning

confidence: 99%

“…And if Σ i λ i, j < 1 for all j and Σ j λ i, j < 1 for all i, we say the traffic is admissible [5]. The allocation rate R i,j is the service rate for f i,j in the corresponding period.…”

Section: An 100% Ideal Throughput Allocationmentioning

confidence: 99%

“…In current switch design, the combined input and crosspoint queueing (CICQ) switch with small buffer embedded on each crosspoint [9][15] [16] is considered more scalable than the crossbar switch [5][11] [12]. However, the predominant creditbased flow control [10] used in CICQ may suffer from the effect of large fabric-internal latency [1][13] [14].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Practical Algorithms of Bandwidth Regulation for Rate-Based Switching

Wang¹,

He²,

Zhao³

et al. 2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

Abstract-A rate-based switch fabric called smoothed buffer crossbar has been proposed in our recent work. It can provide 100% rate-guaranteed service with only a two-cell buffer at each crosspoint, and can also support best-effort service with an additional bandwidth regulator. However, the widely used maxflow model for bandwidth regulation is neither scalable nor of 100% throughput. In order to evaluate the performance of bandwidth regulator, we first introduce the 100% ideal throughput measurement in this paper. Then we prove that the total arrival average (TAA) algorithm has got this property, which does not happen in the max-flow allocation. Then an O(N) algorithm called proportion scaling allocation (PSA) is presented. Simulations reveal that PSA can deliver nearly 100% throughput even in a frequently changing traffic pattern. As a comparison, both theoretical and experimental evidences are given to show the inefficiency of the max-flow model. Index Terms-switch fabric, rate-based switching, bandwidth regulation, scheduling.

show abstract

Section: An 100% Ideal Throughput Allocationmentioning

confidence: 99%

Section: An 100% Ideal Throughput Allocationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Practical Algorithms of Bandwidth Regulation for Rate-Based Switching

Wang¹,

He²,

Zhao³

et al. 2007

IEEE GLOBECOM 2007-2007 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

show abstract

“…This scheduling algorithm should be simple, because it is implemented in hardware at very high speed. A class of maximum weight matching (MWM) algorithms for IQ switches are known which provide 100% throughput for any admissible traffic [1,2,6]. In [7,8] bounds on the average delay are obtained for MWM algorithm under admissible Bernoulli i.i.d.…”

Section: Introductionmentioning

confidence: 99%

“…In [2,11] it is shown that at speedup 2, simple maximal matching kind of algorithms are stable (provide 100% throughput) under admissible arrival traffic. But again, there are no strict delay guarantees provided.…”

Section: Introductionmentioning

confidence: 99%

Delay bounds for combined input–output switches with low speedup

Giaccone

Leonardi

Prabhakar

et al. 2004

Performance Evaluation

View full text Add to dashboard Cite

Design and performance of randomized schedules for time-domain wavelength interleaved networks

Saniee¹,

Widjaja²

2009

Bell Labs Tech. J.

View full text Add to dashboard Cite

Time-domain wavelength interleaved networking (TWIN) is an optical mesh network architecture in which each edge node has one (or more) tunable lasers to transmit fixed-length bursts to various destinations and one (or more) burst-mode receivers capable of decoding each burst intended to it. In this architecture, the interior nodes route each burst independently and passively based on the wavelength of the burst. Network scheduling is thus a critical component that arbitrates burst transmissions from sources to destinations so that conflicts are either avoided or minimized, and wavelength division multiplexing (WDM) transport capacity is efficiently utilized. However, in access or metro networks, which lend themselves naturally to the TWIN mesh architecture, centralized network scheduling would be cumbersome. We consider a distributed mechanism that performs scheduling of bursts to further simplify TWIN mesh architectures. In one realization, each source randomly assigns non-overlapping time slots within a frame for its transmissions. In another realization, each destination grants random but non-overlapping time slots to sources for transmissions. In neither scheme is there any coordination across sources and destinations. We present an analytical formulation of these schemes and investigate their performance under two broad types of traffic: dynamic traffic and semidynamic traffic. For dynamic traffic, the analytical results show that for offered load close to 100 percent of capacity, there is 63 percent efficiency for the destination-based mechanism and 37 percent efficiency for the source-based mechanism. When end-to-end demands are semi dynamic, we show through simulations that the destination-based random schedules can achieve over 90 percent efficiency even for offered loads close to 100 percent. These results indicate that the proposed distributed schemes, though exceedingly simple, provide acceptable efficiency comparable to that realized by computation-intensive centralized schedulers irrespective of propagation delays and applicable to any kind of network traffic.

show abstract

The throughput of data switches with and without speedup

Cited by 375 publications

References 18 publications

Practical Algorithms of Bandwidth Regulation for Rate-Based Switching

Practical Algorithms of Bandwidth Regulation for Rate-Based Switching

Delay bounds for combined input–output switches with low speedup

Design and performance of randomized schedules for time-domain wavelength interleaved networks

Contact Info

Product

Resources

About