Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Masayoshi NABESHIMA, "Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 958-961, June 1999, doi: .
Abstract: Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_958/_p
Copy
@ARTICLE{e82-b_6_958,
author={Masayoshi NABESHIMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue},
year={1999},
volume={E82-B},
number={6},
pages={958-961},
abstract={Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Packet-Based Scheduling for ATM Networks Based on Comparing a Packet-Based Queue and a Virtual Queue
T2 - IEICE TRANSACTIONS on Communications
SP - 958
EP - 961
AU - Masayoshi NABESHIMA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - Even though information in ATM networks is handled as fixed-sized packets (cells), packet-based scheduling is still needed in ATM networks. This letter proposes a packet-based scheduling mechanism that is based on comparison between a packet-based queue and a virtual queue that represents the queue length provided by a cell-based scheduling mechanism. Simulation results showed that this proposed scheduling allocates the bandwidth fairly to each connection.
ER -