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
University of Malaya
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.
|Keywords:||QoS Routing, Prediction Intervals, Distribution-Free|
Repository Staff Only: item control page