Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2003.10C.7.923

Bottleneck link bandwidth Measurement Algorithm for improving end-to-end transit delay in Grid network  

Choi, Won-Seok (성균관대학교 대학원 정보통신공학부)
Ahn, Seong-Jin (성균관대학교 컴퓨터교육과)
Chung, Jin-Wook (성균관대학교 전지전자 및 컴퓨터공학과)
Publication Information
The KIPS Transactions:PartC / v.10C, no.7, 2003 , pp. 923-928 More about this Journal
Abstract
This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.
Keywords
NMWG; Grid Network; Transit Delay; Timestamp;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 http://www-didc.lbl.gov/NMWG/
2 신상철, 안성진, 정진욱, 'SNMP를 이용한 인터넷 분석 파라미터 추출 시스템의 설계 및 구현,' 정보처리학회지, 제6권 제3호, pp. 710-721, 1999   과학기술학회마을
3 Jean-Chrysostome Bolot. 'End-to-end packet delay and loss behavior in the internet,' In Proceeding of the 1996 USENIX Technical Conference, January, 1996
4 Khaled Harfoush and Azer Bestavros and John Byers, 'Measuring Bottleneck Bandwidth of Targeted Path Segments,' TECHNICAL REPORT BUCS-2001-016, Boston University, July, 2001
5 http://www.gridforum.org/
6 A. Barbir et al. Known CDN Request-Routing Mechanisms. http://www.globecom.net/ietf/draft/draft-cain-cdnp-known-request-routing-01.html, February, 2001
7 Robert L. Carter and Mark E., 'Crovella. Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks,' Technical Reprot BU-CS-960007, Boston University, 1996
8 D. Andersen, H. Balakrishnan, M. F. Kaashoek and R. Morris, 'Resilient Overlay Networks,' In Proceddings of SOSP 2001(to appear), October, 2001   DOI
9 Mark R. Stemin, 'An Network Measurement Architecture for Adaptive Applications,' PhD thesis, University of California, Berkeley, 1999
10 M. Mathis and J. Mahdavi, 'Diagnosing Internet Congestion with a Transprot Layer Performance Tool,' In Proceedings of INET, 1996
11 Srinivasan Keshav, 'A Control-Theoretic Approach to Flow Control,' In Proceedings of ACM SIGCOMM, 1991   DOI
12 Vern Paxson, 'Measurements and Analysis of End-to-End Internet Dynamics,' PhD thesis, University of California, Berkeley, April, 1997
13 Kevin Lai and Mary Baker, 'Measuring Bandwidth,' In Proceedings of IEEE INFOCOM, March, 1999
14 Kevin Lai and Mary Baker, 'Measuring Link Bandwidths Using a Deterministic Model of Packet Delay,' In Proceedings of ACM SIGCOMM, August, 2000   DOI
15 ns : Network Simulator, http://www-mash.cs.berkeley.edu/ns/ns.html
16 안성진, 정진욱, 'SNMP MIB-II를 이용한 인터네트 분석 파라미터 계산 알고리즘에 관한 연구,' 정보처리학회지, 제5권 제8호, pp. 2102-2116, 1998
17 D. Sanghi, A. K. Agrawala, B. Jain, 'Experimental assessment of end-to-end behavior on Internet' Proc. IEEE Infocom '93, San Fransisco, CA, pp. 867-874, March, 1993   DOI
18 D. sanghi, O. Gudmundsson, A. K. Agrawala, 'Study of network dynamics Proc,' 4th Joint European Net-working Conference, Trondheim, Norway, pp. 241-249, May, 1993