Browse > Article
http://dx.doi.org/10.9708/jksci.2010.15.3.073

An Efficient Algorithm for Finding the Earliest Available Interval on Connection-Oriented Networks  

Chong, Kyun-Rak (홍익대학교 컴퓨터공학과)
Publication Information
Journal of the Korea Society of Computer and Information / v.15, no.3, 2010 , pp. 73-80 More about this Journal
Abstract
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.
Keywords
dedicated connection; bandwidth scheduling; connection-oriented network;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 E. Jung, Y. Li, S. Ranka, and S. Sahni, "An evaluation of in-advance bandwidth scheduling algorithms for connection-oriented networks," connrnational Symp. on Parallne Archinnctures, Algorithms, and Networks (ISPAN), pp. 133-138, 2008
2 Dynamic resource allocation via GMPLS optical networks. http://dragon.maxgigapop.net.
3 On-demand secure circuits and advance reservation system. http://www.es.net/oscars.
4 N. S. V. Rao and W. R. Wing and S. M. Carter and Q. Wu, "Ultrascience net : Network testbed for large-scale science applications," IEEE Communications Magazine, 2005, expanded version available atwww.csm.ornl.go/ultranet.
5 Enlightened Computing, http://www.enlightenedcomputing.org
6 Geant2, http://www.geant2.net.
7 JGN II : Advanced Network Testbed for Research and Development, http://www.jgn.nict.go.jp.
8 LHCNet : Transatlantic Networking for the LHC and the U.S. HEP Community, http://Ihcnet.caltech.edu/.
9 Hybrid Optical and Packet Infrastructure, http://networks.internet2.eud/hopi.
10 Internet2. http://www.internet2.edu.
11 X. Zheng and M. Veeraraghavan and N. S. V. Rao and Q. Wu and M. Zhu, " CHEETAH : Circuit-switched high-speed end-to-end transport architecture testbed," IEEE Communications Magazine, 2005.
12 User Controlled LightPath Provisioning, http://phi.badlab.crc.ca/uclp.
13 Kannan Rajah, Sanjay Ranka, Ye Xia, "Advance Reservation and Scheduling for Bulk Transfers in Research Networks," IEEE Transactions on Parallel and Distributed Systems, Vol. 20, No. 11, pp.1682-1697, November 2009.   DOI   ScienceOn
14 S. W. Lee and H. S. Song, "Characteristic of active optical ring network and performance evaluation in bandwidth on demand," Korea Society of Computer Information, Vol. 10, No. 6, December 2005   과학기술학회마을
15 E. Horowitz, S. Sahni, and D. Metha, "Fundamentals of Data Structures in C++," Compute Science Press, 1995
16 D. Ghosal and B. Mukherjee N. S. V. Rao and Q. Wu and S. M. Carter and W.R. Wing and A. Banerjee, "Control plane for advance bandwidth Scheduling in ultra high-speed networks," In INFOCOM 2006 Workshop on Terabits Networks, 2006.
17 Kannan Rajah, Sanjay Ranka and Ye Xia, "Scheduling Bulk File Transfer with Start and End Times," Computer Networks, Vol. 52(5), pp. 1105-1122, April 2008   DOI   ScienceOn
18 J. Bunn and H. Newmann, "Data-Intensive Grids for High-Energy Physics," Grid Computing, John Wiley & Sons, 2003
19 S. Sahni, N. Rao, S. Ranka, Y. Li, E. Jung, and N. Kamath., "Bandwidth Scheduling and Path Computation Algorithms for Connection Oriented Networks," International Conference on Networking, 2007
20 Y. Li, S. Ranka, and S. Sahni, "In-advance path reservation for file transfers in e-science applications," IEEE Symposium on Computers and Communications, pp. 176-181, 2009