The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Rangkaian ATM adalah berorientasikan sambungan. Membuat panggilan memerlukan menghantar mesej terlebih dahulu untuk melakukan kawalan kemasukan untuk menjamin QoS (kualiti perkhidmatan) sambungan dalam rangkaian. Dalam makalah ini, kami memberi tumpuan kepada masalah menterjemah keperluan QoS global kepada satu set keperluan QoS tempatan dalam rangkaian ATM. Biasanya, pengguna akhir hanya mementingkan keperluan QoS pada asas hujung ke hujung dan tidak mengambil berat tentang QoS nod pensuisan tempatan. Kebanyakan usaha penyelidikan baru-baru ini hanya menumpukan pada kelewatan hujung ke hujung kes terburuk tetapi tidak memberi perhatian kepada masalah mengagihkan kelewatan hujung ke hujung yang terikat kepada nod pensuisan tempatan. Selepas kawalan kemasukan, apabila sambungan baharu diterima masuk ke rangkaian, mereka sama-sama memperuntukkan kelewatan yang berlebihan dan menempah lebar jalur yang sama pada setiap suis di sepanjang laluan. Tetapi, ini tidak dapat meningkatkan penggunaan rangkaian dengan cekap. Ia mendorong kami untuk mereka bentuk skim peruntukan keperluan QoS tempatan yang baru untuk mendapatkan prestasi yang lebih baik. Menggunakan bilangan sambungan maksimum yang boleh disokong sebagai indeks prestasi, kami memperoleh dasar peruntukan kelewatan (OPT) optimum. Di samping itu, kami juga mencadangkan model analisis untuk menilai skim peruntukan yang dicadangkan dan skim peruntukan sama (EQ) dalam satu siri nod pensuisan dengan seni bina penjadualan terkawal Kadar, termasuk pembentuk trafik dan tarikh akhir terawal-dahulu bukan preemptif. penjadual. Daripada keputusan berangka, kami telah menunjukkan kepentingan dasar peruntukan dan meneroka faktor yang mempengaruhi indeks prestasi.
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.
Salinan
Yen-Ping CHU, Chin-Hsing CHEN, Kuan-Cheng LIN, "Call Admission and Efficient Allocation for Delay Guarantees" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 8, pp. 1039-1047, August 2001, doi: .
Abstract: ATM networks are connection-oriented. Making a call requires first sending a message to do an admission control to guarantee the connections' QoS (quality of service) in the network. In this paper, we focus on the problem of translating a global QoS requirement into a set of local QoS requirements in ATM networks. Usually, an end-user is only concerned with the QoS requirements on end-to-end basis and does not care about the local switching node QoS. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switching node. After admission control, when the new connection is admitted to enter the network, they equally allocate the excess delay and reserve the same bandwidth at each switch along the path. But, this can not improve network utilization efficiently. It motivates us to design a novel local QoS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation (OPT) policy. In addition, we also proposed an analysis model to evaluate the proposed allocation scheme and equal allocation (EQ) scheme in a series of switching nodes with the Rate-controlled scheduling architecture, including a traffic shaper and a non-preemptive earliest-deadline-first scheduler. From the numerical results, we have shown the importance of allocation policy and explored the factors that affect the performance index.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_8_1039/_p
Salinan
@ARTICLE{e84-d_8_1039,
author={Yen-Ping CHU, Chin-Hsing CHEN, Kuan-Cheng LIN, },
journal={IEICE TRANSACTIONS on Information},
title={Call Admission and Efficient Allocation for Delay Guarantees},
year={2001},
volume={E84-D},
number={8},
pages={1039-1047},
abstract={ATM networks are connection-oriented. Making a call requires first sending a message to do an admission control to guarantee the connections' QoS (quality of service) in the network. In this paper, we focus on the problem of translating a global QoS requirement into a set of local QoS requirements in ATM networks. Usually, an end-user is only concerned with the QoS requirements on end-to-end basis and does not care about the local switching node QoS. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switching node. After admission control, when the new connection is admitted to enter the network, they equally allocate the excess delay and reserve the same bandwidth at each switch along the path. But, this can not improve network utilization efficiently. It motivates us to design a novel local QoS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation (OPT) policy. In addition, we also proposed an analysis model to evaluate the proposed allocation scheme and equal allocation (EQ) scheme in a series of switching nodes with the Rate-controlled scheduling architecture, including a traffic shaper and a non-preemptive earliest-deadline-first scheduler. From the numerical results, we have shown the importance of allocation policy and explored the factors that affect the performance index.},
keywords={},
doi={},
ISSN={},
month={August},}
Salinan
TY - JOUR
TI - Call Admission and Efficient Allocation for Delay Guarantees
T2 - IEICE TRANSACTIONS on Information
SP - 1039
EP - 1047
AU - Yen-Ping CHU
AU - Chin-Hsing CHEN
AU - Kuan-Cheng LIN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2001
AB - ATM networks are connection-oriented. Making a call requires first sending a message to do an admission control to guarantee the connections' QoS (quality of service) in the network. In this paper, we focus on the problem of translating a global QoS requirement into a set of local QoS requirements in ATM networks. Usually, an end-user is only concerned with the QoS requirements on end-to-end basis and does not care about the local switching node QoS. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switching node. After admission control, when the new connection is admitted to enter the network, they equally allocate the excess delay and reserve the same bandwidth at each switch along the path. But, this can not improve network utilization efficiently. It motivates us to design a novel local QoS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation (OPT) policy. In addition, we also proposed an analysis model to evaluate the proposed allocation scheme and equal allocation (EQ) scheme in a series of switching nodes with the Rate-controlled scheduling architecture, including a traffic shaper and a non-preemptive earliest-deadline-first scheduler. From the numerical results, we have shown the importance of allocation policy and explored the factors that affect the performance index.
ER -