Network design approaches and tradeoffs in QoS route selection with diverse objectives and constraints

Future force networks such as FCS and WIN-T are anticipated to support a wide spectrum of applications with stringent and diverse quality of service (QoS) constraints. While many QoS control mechanisms are being designed, judicious multi-metric QoS route selection mechanisms are often put forth as a key means to help provide QoS assurances. QoS routing based on multiple metrics can potentially provide paths that simultaneously trade off multiple, diverse and conflicting performance requirements. This paper describes the incorporation of flexible and scalable QoS path selection heuristics into a network engineering design analytic toolset (NEDAT). NEDAT is equipped with performance metrics for evaluating the tradeoffs and effectiveness of QoS routing subject to the characteristics of network environments of interest. Using NEDAT we show networks: (a) where QoS routing is very beneficial and (b) where benefits are so small that it in not worth the added computational and bandwidth costs.

[1]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[2]  Klara Nahrstedt,et al.  On finding multi-constrained paths , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[3]  L. Kant,et al.  NEDAT - A Network Engineering Design Analytic Toolset to Design and Analyze Large Scale MANETs , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[4]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[5]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[6]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

[7]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[8]  Arunabha Sen,et al.  Finding a Path Subject to Many Additive QoS Constraints , 2007, IEEE/ACM Transactions on Networking.

[9]  Ke Xu,et al.  Multi-constrained routing based on simulated annealing , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[11]  Arunabha Sen,et al.  Finding a Path Subject to Many Additive QoS Constraints , 2007, IEEE/ACM Transactions on Networking.

[12]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[13]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[14]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Kyriakos Manousakis,et al.  Flexible QoS Route Selection with Diverse Objectives and Constraints , 2008, 2008 16th Interntional Workshop on Quality of Service.

[16]  Guoliang Xue,et al.  Minimum-cost QoS multicast and unicast routing in communication networks , 2003, IEEE Trans. Commun..

[17]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[18]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[19]  John S. Baras,et al.  IMPROVING THE SPEED OF DYNAMIC CLUSTER FORMATION IN MANET VIA SIMULATED ANNEALING , 2006 .

[20]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[21]  Vinay Kolar,et al.  A multi-commodity flow approach for globally aware routing in multi-hop wireless networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications (PERCOM'06).

[22]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[23]  Anirudha Sahoo.  An OSPF based load sensitive QoS routing algorithm using alternate paths , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[24]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[25]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[26]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.