A cell burst scheduling for ATM networking. II. Implementation

Author

Tang, C. ; Chronopoulos, A.T. ; Yaprak, E.

Author_Institution

Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA

fYear

1998

fDate

30 Jun-2 Jul 1998

Firstpage

462

Lastpage

467

Abstract

For pt.I see ibid. p.445-61. The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair queueing over the non-burst version. Our simulation study is based on backbone and access subnetworks, which are common in the real world

Keywords

asynchronous transfer mode; delays; digital simulation; packet switching; queueing theory; telecommunication computing; telecommunication networks; telecommunication traffic; ATM networking; access subnetworks; backbone subnetworks; burst based weighted fair queueing; cell burst scheduling; computation complexity; nonburst queueing; queuing delay; simulation; traffic characteristics; Asynchronous transfer mode; Bandwidth; Computer science; Delay; Digital communication; Educational institutions; Electrical capacitance tomography; Processor scheduling; Spine; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Conference_Location

Athens

Print_ISBN

0-8186-8538-7

Type

conf

DOI

10.1109/ISCC.1998.702565

Filename

702565