- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
A Study on Packet-based Scheduling Algorithms for ATM Cells
-
- SODA Keiichi
- Mitsubishi Electric Corporation, Information Technology R&D Center
-
- YOKOTANI Tetsuya
- Mitsubishi Electric Corporation, Information Technology R&D Center
-
- ICHIHASHI Tatsuki
- Mitsubishi Electric Corporation, Information Technology R&D Center
Bibliographic Information
- Other Title
-
- パケットを基準としたATMセルスケジューリング方式の検討と評価
Search this article
Description
In ATM networks, once a host receives a beginning cell of a packet (BOP), it cannot release a buffer to reassemble the packet from ATM cells until it receives a tail end cell of the packet (EOP). As a maximum packet size becomes larger, an average period between the BOP and the EOP becomes larger. The number of reassembling packets in parallel at the host is also larger. Accordingly many buffers in the host are required. In order to reduce the number of buffers, the paper proposes cell scheduling algorithms in ATM switches. In these algorithms, cells in one packet are transmitted as continuously as possible. Next, the paper evaluates the performance of these algorithms, and it shows the effectiveness of the proposed algorithms.
Journal
-
- IEICE technical report. Information networks
-
IEICE technical report. Information networks 96 (313), 41-46, 1996-10-18
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1573387452166246784
-
- NII Article ID
- 110003195956
-
- NII Book ID
- AN10013072
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles