@article{ART001433864},
author={Kyun Rak Chong},
title={An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2010},
volume={15},
number={3},
pages={73-80}
TY - JOUR
AU - Kyun Rak Chong
TI - An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks
JO - Journal of The Korea Society of Computer and Information
PY - 2010
VL - 15
IS - 3
PB - The Korean Society Of Computer And Information
SP - 73
EP - 80
SN - 1598-849X
AB - The advancement of communication and networking technologies has enabled e-science and commercial application that often require the transport of large volume of data over wide-area network. Schedulable high-bandwidth low-latency connectivity is required to transport the large volume of data. But the public Internet does not provide predictable service performance. Especially, if data providers and users are far away, dedicated bandwidth channels are needed to support remote process efficiently. Currently several network research projects are in progress to develop dedicated connectionsy sA bandwidth scheduler computes an user requested path based on network topology information and link bandwidth allocationsy In this paper, we have proposed an efficient algorithm for finding the earliest time interval when minimum bandwidth and duration are giveny Our algorithm is experimentally compared with the known algorithm.
KW - dedicated connection;bandwidth scheduling;connection- oriented network
DO -
UR -
ER -
Kyun Rak Chong. (2010). An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks. Journal of The Korea Society of Computer and Information, 15(3), 73-80.
Kyun Rak Chong. 2010, "An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks", Journal of The Korea Society of Computer and Information, vol.15, no.3 pp.73-80.
Kyun Rak Chong "An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks" Journal of The Korea Society of Computer and Information 15.3 pp.73-80 (2010) : 73.
Kyun Rak Chong. An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks. 2010; 15(3), 73-80.
Kyun Rak Chong. "An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks" Journal of The Korea Society of Computer and Information 15, no.3 (2010) : 73-80.
Kyun Rak Chong. An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks. Journal of The Korea Society of Computer and Information, 15(3), 73-80.
Kyun Rak Chong. An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks. Journal of The Korea Society of Computer and Information. 2010; 15(3) 73-80.
Kyun Rak Chong. An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks. 2010; 15(3), 73-80.
Kyun Rak Chong. "An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks" Journal of The Korea Society of Computer and Information 15, no.3 (2010) : 73-80.
