The recent burst growth of the Internet use overloads networking systems and degrades the quality of communications, e.g., bandwidth loss, packet drops, delay of responses, etc. To overcome such degradation of the communication quality, the notion of Quality of Service (QoS) has received attention in practice. In general, QoS switches have several queues and each queue has several slots to store arriving packets. Since network traffic changes frequently, QoS switches need to control arriving packets to maximize the total priorities of transmitted packets, where the priorities are given by nonnegative values and correspond to the quality of service required for each packet. In this paper, we derive lower bounds for the competitive ratio of deterministic multi-queue nonpreemptive QoS problem of priorities 1 and α
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
Toshiya ITOH, Takanobu NAGUMO, "Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 5, pp. 1155-1165, May 2005, doi: 10.1093/ietfec/e88-a.5.1155.
Abstract: The recent burst growth of the Internet use overloads networking systems and degrades the quality of communications, e.g., bandwidth loss, packet drops, delay of responses, etc. To overcome such degradation of the communication quality, the notion of Quality of Service (QoS) has received attention in practice. In general, QoS switches have several queues and each queue has several slots to store arriving packets. Since network traffic changes frequently, QoS switches need to control arriving packets to maximize the total priorities of transmitted packets, where the priorities are given by nonnegative values and correspond to the quality of service required for each packet. In this paper, we derive lower bounds for the competitive ratio of deterministic multi-queue nonpreemptive QoS problem of priorities 1 and α
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1155/_p
Copy
@ARTICLE{e88-a_5_1155,
author={Toshiya ITOH, Takanobu NAGUMO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks},
year={2005},
volume={E88-A},
number={5},
pages={1155-1165},
abstract={The recent burst growth of the Internet use overloads networking systems and degrades the quality of communications, e.g., bandwidth loss, packet drops, delay of responses, etc. To overcome such degradation of the communication quality, the notion of Quality of Service (QoS) has received attention in practice. In general, QoS switches have several queues and each queue has several slots to store arriving packets. Since network traffic changes frequently, QoS switches need to control arriving packets to maximize the total priorities of transmitted packets, where the priorities are given by nonnegative values and correspond to the quality of service required for each packet. In this paper, we derive lower bounds for the competitive ratio of deterministic multi-queue nonpreemptive QoS problem of priorities 1 and α
keywords={},
doi={10.1093/ietfec/e88-a.5.1155},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1155
EP - 1165
AU - Toshiya ITOH
AU - Takanobu NAGUMO
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1155
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - The recent burst growth of the Internet use overloads networking systems and degrades the quality of communications, e.g., bandwidth loss, packet drops, delay of responses, etc. To overcome such degradation of the communication quality, the notion of Quality of Service (QoS) has received attention in practice. In general, QoS switches have several queues and each queue has several slots to store arriving packets. Since network traffic changes frequently, QoS switches need to control arriving packets to maximize the total priorities of transmitted packets, where the priorities are given by nonnegative values and correspond to the quality of service required for each packet. In this paper, we derive lower bounds for the competitive ratio of deterministic multi-queue nonpreemptive QoS problem of priorities 1 and α
ER -