An efficient cell placement strategy for shared multibuffer ATM switches
- Authors
- Lee, P.-G.; Kang, W.-C.; Choi, Y.-H.
- Issue Date
- 1999
- Publisher
- Institute of Electronics, Information and Communication, Engineers, IEICE
- Keywords
- Cell placement; Shared multibuffer ATM switches; Threshold
- Citation
- IEICE Transactions on Communications, v.E82-B, no.9, pp.1424 - 1430
- Journal Title
- IEICE Transactions on Communications
- Volume
- E82-B
- Number
- 9
- Start Page
- 1424
- End Page
- 1430
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27744
- ISSN
- 0916-8516
- Abstract
- Shared multibuffer ATM switches are attractive since they can extend memory bandwidth by the use of multiple independent buffer memories. Although the parallel accessibility allows a considerable improvement in memory bandwidth, a proper assignment of memory addresses to cells is necessary to better utilize the potential bandwidth. In this paper, we present an efficient cell placement strategy for shared multibuffer ATM switches. It is based on a combination of two key concepts, uniform distribution for writes and reference locality for reads. The former is to reduce cell loss ratio due to overflow and write-access conflicts. The latter is to have cells destined for the same output port read from the same buffer memory to minimize read-access conflicts. A single threshold is employed to assign memory locations adaptively depending on the cell distribution among the shared buffer memories. The proposed strategy is shown to out-perform the existing ones, in terms of cell loss ratio, cell delay, and throughput. Moreover, the performance gains have been made with a simple control circuit.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Department of General Studies > Department of General Studies > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27744)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.