Distributed adaptive diverse routing for voice-over-IP in service overlay networks

This paper proposes a novel mechanism to discover delay-optimal diverse paths using distributed learning automata for Voice-over-IP (VoIP) routing in service overlay networks. In addition, a novel link failure detection method is proposed for detecting and recovering from link failures to reduce the number of dropped voice sessions. The main contributions of this paper are a decentralized, scalable method for minimizing delay on both a primary and secondary path between all pairs of overlay nodes, while at the same time maintaining the link disjointness between the primary and the secondary optimal paths. Simulations of a 50-node model of AT&T's backbone network show that the proposed method improves the quality of voice calls from unsatisfactory to satisfactory, as measured by the R-factor. With the proposed link failure detection mechanism, the time to recover from a link failure is considerably reduced.

[1]  L. Mason,et al.  An optimal learning algorithm for S-model environments , 1973 .

[2]  L. G. Mason,et al.  Equilibrium flows, routing patterns and algorithms for store- and -forward networks , 1985 .

[3]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[4]  Michael L. Littman,et al.  Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.

[5]  Henning Schulzrinne,et al.  Adaptive playout mechanisms for packetized audio applications in wide-area networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[6]  Ilkka Norros,et al.  On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995, IEEE J. Sel. Areas Commun..

[7]  Dit-Yan Yeung,et al.  Predictive Q-Routing: A Memory-based Reinforcement Learning Approach to Adaptive Traffic Control , 1995, NIPS.

[8]  H. Kushner,et al.  Stochastic Approximation Methods for Systems Over an InfiniteHorizon , 1996 .

[9]  Felisa J. Vázquez-Abad,et al.  Centralized and decentralized asynchronous optimization of stochastic discrete-event systems , 1998 .

[10]  Lorne G. Mason,et al.  Decentralized Adaptive Flow Control of High-Speed Connectionless Data Networks , 1999, Oper. Res..

[11]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[12]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Erol Gelenbe,et al.  Cognitive packet networks: QoS and performance , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[14]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[15]  Randy H. Katz,et al.  Backup path allocation based on a correlated link failure probability model in overlay networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[16]  Leonid Peshkin,et al.  Reinforcement learning for adaptive routing , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[17]  Randy H. Katz,et al.  Dynamics of Simultaneous Overlay Network Routing , 2003 .

[18]  M. Thathachar,et al.  Networks of Learning Automata: Techniques for Online Stochastic Optimization , 2003 .

[19]  Avideh Zakhor,et al.  Path diversity with forward error correction (PDF) system for packet switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[21]  Mitchell D. Trott,et al.  Path diversity for enhanced media streaming , 2004, IEEE Communications Magazine.

[22]  Chunming Qiao,et al.  On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.

[23]  Mikael Johansson,et al.  Traffic matrix estimation on a large IP backbone: a comparison on real data , 2004, IMC '04.

[24]  Donald F. Towsley,et al.  Improving VoIP quality through path switching , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[25]  Rauf Izmailov,et al.  Performance Optimization of VoIP using an Overlay Network , 2005 .

[26]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[27]  B. John Oommen,et al.  Dynamic algorithms for the shortest path routing problem: learning automata-based solutions , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[28]  Philip K. McKinley,et al.  Improving multipath reliability in topology-aware overlay networks , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[29]  Wayne D. Grover,et al.  Next Generation Transport Networks: Data, Management, and Control Planes , 2005 .

[30]  V. Hilt,et al.  An Efficient and Robust Overlay Routing Scheme for VoIP , 2005, 2005 5th International Conference on Information Communications & Signal Processing.

[31]  Carsten Lund,et al.  Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach , 2005, IEEE/ACM Transactions on Networking.

[32]  Peter Kabal,et al.  Optimizing Voice-over-IP Speech Quality Using Path Diversity , 2006, 2006 IEEE Workshop on Multimedia Signal Processing.

[33]  G. Ash.  Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks , 2006 .

[34]  Xiaodong Zhang,et al.  ASAP: an AS-Aware Peer-Relay Protocol for High Quality VoIP , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[35]  Andreas Terzis,et al.  An Overlay Architecture for High-Quality VoIP Streams , 2006, IEEE Transactions on Multimedia.

[36]  Tim Moors,et al.  Scalable Resilient Overlay Networks Using Destination-Guided Detouring , 2007, 2007 IEEE International Conference on Communications.

[37]  Hong Li,et al.  Learning Minimum Delay Paths in Service Overlay Networks , 2008, 2008 Seventh IEEE International Symposium on Network Computing and Applications.

[38]  Hong Li,et al.  Multipath routing with adaptive playback scheduling for Voice over IP in Service Overlay Networks , 2008, 2008 IEEE Sarnoff Symposium.

[39]  Teresa Gomes,et al.  An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs , 2009, Comput. Oper. Res..

[40]  Georgia Sakellari,et al.  The Cognitive Packet Network: A Survey , 2010, Comput. J..

[41]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .