Sharma and Pinnu proposed an implementation of bypass queue by many FIFOs; unfortunately, the detailed procedure paid little attention to maintaining cell sequence, which is an important feature in ATM network. In this paper, we propose an improved architecture which guarantees cell sequence integri
โฆ LIBER โฆ
An efficient implementation of bypass queue under bursty traffic
โ Scribed by Neeraj K. Sharma; Madhusudhana R. Pinnu
- Book ID
- 104304536
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 287 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we present a new bypass queue scheme for an input buffered nonblocking packet switch operating under bursty traffic. The proposed scheme uses first-in-jht-out (FIFO) queues and is thus more efficient for implementation as compared to other schemes which use $rst-inrandom-out (FIRO) queues. Maximum throughput comparison of the proposed scheme with the conventional scheme shows significant improvement.
๐ SIMILAR VOLUMES
An efficient and orderly implementation
โ
Joe Shang-Chieh Wu; Ying-Dar Lin
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 195 KB
An efficient implementation of priority
โ
Jyh-Jong Tsay
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 551 KB