Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

Hop-by-hop QoS Routing using Statistical Distribution-free Approach

Chin, S.Y. and Ling, T.C. and Mashkuri Yaacob, (2005) Hop-by-hop QoS Routing using Statistical Distribution-free Approach. Malaysian Journal of Computer Science, 18 (2). pp. 28-37. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=338

Affiliations

University of Malaya

Abstract

The advent of Quality-of-Service (QoS) routing has brought a wide range of applications to network users. While precise network state information is critical to QoS provision, maintaining such accuracy is almost impossible. Towards this end, we propose a hop-by-hop QoS mechanism to operate in networks with inaccurate information. The proposed mechanism, namely DF-PI, adopts the distribution-free (nonparametric) approach to construct two-sided prediction intervals. The prediction interval helps infer the future available bandwidth, and is used to generate the proposed QoS metric - statistical available bandwidth d. “Widest”-shortest paths are calculated, by which d replaces the instantaneous available bandwidth in the traditional widest-shortest routing algorithm (WSR). Relative to WSR, simulation results show that DF-PI achieves satisfactory performance in terms of packet loss, commit ratio, link utilization and average end-to-end delay, together with less update message overhead.

Item Type:Journal
Keywords:QoS Routing, Prediction Intervals, Distribution-Free
Subjects:Q Science
ID Code:379

G. Apostopoloulos, R. Guerin, S. Kamat, A. Orda & S. K.Tripathi, “Intradomain QoS Routing in IP Networks: A Feasibility and Cost/Benefit Analysis”, IEEE Network, Vol. 13 No. 5, 1991, pp. 42-54.

S. Chen, & K. Nahrstedt, “An Overview of Quality of Service for Next-Generation High-Speed Networks: Problems and Solutions”, IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video, Vol. 12 No. 6, 1998, pp. 64-79.

M. Garey, & D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Co, 1979.

R. Guerin, & A. Orda, “QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms”, in Proceedings IEEE, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, 7-11 April 1997, pp. 75-83.

G. Apostopoloulos, R. Guerin, S. Kamat, & S. Tripathi, “Improving QoS Routing Performance Under Inaccurate Link State Information”, in Proceedings of the 16th International Teletrac Congress (ITC'16), United Kingdom, 7-11 June 1999.

G. Apostolopoulos, S. Kamat, D. Williams, R. Guerin, A. Orda, & T. Przygienda, “QoS Routing Mechanisms and OSPF Extensions”, RFC 2676, 1999.

D. H. Lorenz, & A. Orda, “QoS Routing in Networks with Uncertain Parameters”, IEEE/ACM Trans. on Networking, Vol. 6 No. 6, 1998, pp. 768-778.

D. Ghosh, & R. Acharya, “A Probabilistic scheme for Hierarchical Routing”, in Proceedings of Ninth IEEE International Conference on Networks, IEEE, 10 -12 October 2001, pp. 416-421.

X. Yuan, & G. Yang, “Empirical Probability Based QoS Routing”, in Proceedings of IEEE International Conference on Communications, 11-15 May 2001, pp. 1713-7.

S. Chen, & K. Nahrstedt, Distributed QoS Routing with Imprecise State Information. Technical Report. Department of Computer Science, University of Illinois at Urbana-Champaign, 1998.

J. Wang, W. Wang, J. Chen, & S. Chen, “A Randomized QoS Routing Algorithm on Networks withInaccurate Link-State Information”, in Proceedings of International Conference Communication Technology, 21-25 August 2000, pp. 1617-1622.

K. Kowalik, & M. Collier, “ALCFRA – A Robust Routing Algorithm Which Can Tolerate Imprecise Network State Information”, in Proceedings of 15th ITC Specialist Seminar, Wurzburg, Germany, 22-24 July 2002.

L. Xiao, K. S. Lui, J. Wang, & K. Nahrstedt, “Advertising Interdomain QoS Routing Information”, IEEE Journal on Selected Areas in Communications. Vol. 22 No. 10, 2004, pp. 1949-1964.

G. J. Hahn, & W. Q. Meeker, Statistical Intervals: A Guide for Practitioners. New York: John Wiley & Sons, 1991.

Z. Wang, Emerging Technology: IP Routing Gets Smart, http://www.networkingmagazine.com/shared/article/showArticle.jhtml?articleId=8703239, 2001.

L. Danziger, & S. A Davis, “Tables of Distribution-free Tolerance Limits”, Annals of Mathematical Statistics, Vol. 35 No. 3, 1964, pp. 1361-7.

M. H. Alsuwaiyel, Algorithms: Design Techniques and Analysis. Singapore: World Scientific, 1999.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.