Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Pre-Computation Based Selective Probing (PCSP) Scheme for Distributed Quality of Service (QoS) Routing with Imprecise State Information

  • Lee Won-Ick (School of Electrical Engineering, Seoul National University) ;
  • Lee Byeong-Gi (School of Electrical Engineering, Seoul National University)
  • Published : 2006.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

Keywords

References

  1. S. Chen and K. Nahrstedt, 'An overview of quality of service routing for the next generation high-speed networks: Problems and solutions,' IEEE Network Mag., vol. 12, no. 6, Nov./Dec. 1998
  2. G. Apostolopoulos, R. Guerin, S. Kamat, A. Orda, and S. K. Tripathi, 'Intra-domain QoS routing in IP networks: A feasibility and cost/benefit analysis,' IEEE Network Mag., vol. 13, no. 5, Sept./Oct. 1999
  3. B. Wang and J. C. Hou, 'Multicast routing and its QoS extension: Problems, algorithms, and protocols,' IEEE Commun. Mag., Jan. 2000
  4. D. H. Lorenz and A. Orda, 'QoS routing in networks with uncertain parameter,' IEEE/ACM Trans. Networking, vol. 6, no. 6, Dec. 1998
  5. R. Guerin and A. Orda. 'QoS-based routing in networks with inaccurate information: Theory and algorithms,' IEEE/ACM Trans. Networking, vol. 7, no. 3, June 1999
  6. Z. Wang and J. Crowcroft, 'Quality of service routing for supporting multimedia applications,' IEEE J. Select. Areas Commun., Sept. 1996
  7. Q. Ma and P. Steenkiste, 'Quality of service routing with performance guarantees,' in Proc. Int. IFIP Workshop QoS, May 1997
  8. Q. Ma and P. Steenkiste, 'A multi-class QoS routing algorithm,' in Proc. IEEE INFOCOM'99, Mar. 1999
  9. G. Apostolopoulos, R. Guerin, and S. Karnat, 'Implementation and performance measurements of QoS routing extensions to OSPF,' in Proc. IEEE INFOCOM'99, Mar. 1999
  10. A. Orda and A. Sprintson, 'QoS routing: The precomputation perspective,' IEEE/ACM Trans. Networking, vol. 11, no. 4, Aug. 2003
  11. F. Ergun, R. Sinha, and L. Zhang, 'QoS routing with performance-dependent costs,' in Proc. IEEE INFOCOM 2000, Mar. 2000
  12. A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logithetis, 'Efficient computation of delay-sensitive routes from one source to all destinations,' Proc. IEEE INFOCOM 2001, Apr. 2001
  13. A. Juttner, B. Szviatovszki, and Z. Rajko, 'Lagrange relaxation based method for the QoS routing problem,' in Proc. IEEE INFOCOM 2001, Apr. 2001
  14. T. Korkmaz and M. Krunz, 'Multi-constrained optimal path selection,' in Proc. IEEE INFOCOM 2001, Apr. 2001
  15. G. Liu and K. G. Ramakrishnan, '$A^*Prune$: An algorithm for finding K shortest paths subject to multiple constraints,' in Proc. IEEE INFOCOM 2001, Mar. 2001
  16. R. Guerin and A. Orda, 'Computing shortest paths for any number of hops,' IEEE/ACM Trans. Networking, vol. 10, no. 1, 2002
  17. D. S. Reeves and H. F. Salama, 'A distributed algorithm for delay-constrained unicast routing,' IEEE/ACM Trans. Networking, vol. 8, no. 2, 2000
  18. S. Chen and K. Nahrstedt, 'Distributed quality of service routing in high-speed networks based on selective probing,' Tech. rep., Univ. IL at Urnana-Champaign, Dept. Comp. Sci., 1998
  19. S. Chen and K. Nahrstedt, 'Distributed quality of service routing in ad-hoc networks,' IEEE J. Select. Areas Commun., vol. 17, no. 8, 1999
  20. L. Xiao, J. Wang, and K. Nahrstedt, 'The enhanced ticket-based routing algorithm,' in Proc. IEEE ICC 2002, Apr. 2002
  21. J. L. Sobrinho, 'Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet,' IEEE/ACM Trans. Networking, vol. 10, no. 4, 2002
  22. D. Raz and Y. Shavitt. 'Optimal partition of QoS requirements with discrete cost functions,' in Proc. IEEE INFOCOM 2000, Mar. 2000
  23. D. H. Lorenz and A. Orda, 'Optimal partition of QoS requirements on unicast paths and multicast trees,' IEEE/ACM Trans. Networking, vol. 10, no. 1, 2002
  24. A. Orda and A. Sprintson, 'A scalable approach to the partition of QoS requirements in unicat and multicast,' in Proc. IEEE INFOCOM 2002, June 2002
  25. I. Cidon, R. Rom, and Y. Shavitt, 'Multi-path routing combined with resource reservation,' in Proc. IEEE INFOCOM'97, Apr. 1997
  26. I. Matta and L. Guo, 'QDMR: An efficiennt QoS dependent multicast routing algorithm,' J. Commun. Networks, vol. 2, no. 2, 2000
  27. S. Chen, K. Nahrstedy, and Y. Shabitt, 'A QoS-aware multicast routing protocol,' IEEE J. Select. Areas Commun. vol. 18, no. 12, 2000
  28. J. Winick, C. Jin, Q. Chen, and S. Jamin, 'Inet: Internet topology generator,' available at http://www.topology.eecs.umich.edu/inet