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

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.▸Keyword : 전용연결(dedi cated connection), 대역폭 스케줄링(bandwi dth scheduling), 연결 지향 네트워크(connecti onoriented network)

A Linear Time Algorithm for Constructing a Sharable-Bandwidth Tree in Public-shared Network

“…SVC 기술은 여러 네트워크 플랫폼 에서 비디오 스트림을 전송하는데 응용되고 있는데 WiMAX 네트워크 [8], 애드혹 네트워크 [9], 모바일 TV [10], 위성 방 송 [11], P2P [12] 등이 있다. P2P 스트리밍 시스템 구조가 [13]에서 연구되었고, 연결 지향 네트워크에서 대량의 스트 림을 전송하는 방안이 [14]에서 연구되었다.…”