Journal of Network and Systems Management

, Volume 16, Issue 2, pp 201–221 | Cite as

A Network Architecture with High Availability for Real-time Premium Traffic over the Internet

  • Mitsuo Hayasaka
  • Tetsuya Miki


Real-time traffic will be a predominant traffic type in the next generation networks, and networks with 100% reliability and availability will be required by real-time premium traffic. It is believed that QoS guarantees could be better provided by connection oriented networks such as Multi Protocol Label Switching (MPLS). These connection oriented networks are more vulnerable to network failure. Conventional path protection methods perform re-routing to cope with this. However, re-routing always causes packet losses and results in service outage. These losses are bursty in nature and highly degrade the QoS of the real-time premium traffic. Thus, 100% availability cannot be achieved by conventional methods. The novel path protection proposed in this paper recovers the bursty packet losses due to re-routing by using forward error correction (FEC) path. Therefore, it can provide network architecture with no service outage for such traffic. The numerical results show that the proposed method can achieve a very high availability for real-time premium traffic in future IP/MPLS networks.


Path protection Forward error correction Packet loss ratio 


  1. 1.
    Rosen, E., Viswanathanet, A., Callon, R.: Multi Protocol Label Switching Architecture, IETF RFC 3031 (2001)Google Scholar
  2. 2.
    Autenrieth, A., Kristadter, A.: Fault-tolerance and Resilience Issues in IP-based Networks. 2nd International Workshop on the Design of Reliable Communication Networks (DRCN2000), Germany (2000)Google Scholar
  3. 3.
    Xiong, Y., Mason, L.G.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Trans Netw 1, 98–110 (1999)Google Scholar
  4. 4.
    Li, L., Buddhikot, M.M., Chekuri, C., Guo, K.: Routing bandwidth guaranteed paths with local restoration in label switched networks, Proceedings of the 10th IEEE International Conference on Network Protocols (2002)Google Scholar
  5. 5.
    Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: extensions to RSVP for LSP tunnels, IETF RFC 3209, (2001)Google Scholar
  6. 6.
    Aboul-Magd, O.: The Documentation of IANA assignments for constraint-based LSP setup using LDP (CR-LDP) extensions for automatic switched optical network (ASON), IETF RFC 3475 (2003)Google Scholar
  7. 7.
    Andersson, L., Swallow, G.: The multi protocol label switching (MPLS) working group decision on MPLS signaling protocols, IETF RFC 3468 (2003)Google Scholar
  8. 8.
    Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource reservation protocol (RSVP), IETF RFC 2205, Sept. (1997)Google Scholar
  9. 9.
    Iannaccone, G., Chuah, C., Mortier, R., Bhattacharyya, S., Diot, C.: Analysis of link failures in a IP backbone, Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement (2002)Google Scholar
  10. 10.
    Sharma, V., Hellstrand, F.: Framework for multi-protocol label switching (MPLS)-based recovery, IETF RFC 3469 (2003)Google Scholar
  11. 11.
    Huang, C., Sharma, V., Owens, K., Makam, S.: Building reliable MPLS networks using a path protection mechanism, IEEE Commun Mag 40, 156–162 (2002)Google Scholar
  12. 12.
    Gamage, M., Hayasaka, M., Sugawara, S., Terada, M., Miki, T.: Virtual path hopping to overcome network failures due to control plane failures in connection oriented networks, Proceedings of Joint Conference of the 10th APCC and the 5th MDMC, pp. 118–122 (2004)Google Scholar
  13. 13.
    Rosenberg, J., Schulzrinne, H.: An RTP payload format for generic forward error correction, IETF RFC 2733 (1999)Google Scholar
  14. 14.
    Perkins, C.: RTP: Audio and video for the Internet, Addison-Wesley (2003)Google Scholar
  15. 15.
    Bush, S.F., Imer, O.: Enhancing reliable multicast transport to mitigate the impact of blockage, 11th International Workshop on Computer-Aided, Modeling, Analysis and Design of Communication Links and Networks (2006)Google Scholar
  16. 16.
    Hayasaka, M., Thavisak, T., Miki, T.: The concept of referential loss recovery for real-time applications and its improvements of QoS provision, Proceedings of Asia-Pacific Conference on Communications (APCC) (2006)Google Scholar
  17. 17.
    Nikolopoulos, S.D., Pitsillides, A., Tipper, D.: Addressing network survivability issues by finding the K best paths through a Trellis graph, Proceedings of IEEE INFOCOM (1997)Google Scholar
  18. 18.
    Szviatovszki, B., Szentesi, A., Juttner, A.: On the effectiveness of restoration path computation methods, Proceedings of International Conference on Communications (2002)Google Scholar
  19. 19.
    Guo, Y., Kuipers, F., Mieghem, P.V.: Link-disjoint paths for reliable QoS routing. Int J Commun Syst 16, 779–798 (2003)Google Scholar
  20. 20.
    Bejerano, Y., Breitbart, Y., Orda, A., Rastogi, R., Sprintson, A.: Algorithms for computing QoS paths with restoration. IEEE/ACM Trans Netw 13(3), 648–661 (2005)Google Scholar
  21. 21.
    Katz, D., Kompella, K., Yeung, D.: Traffic engineering (TE) extensions to OSPF version 2, IETF RFC 3630 (2003)Google Scholar
  22. 22.
    Jerram, N., Farrel, A.: MPLS in optical networks, White Paper of Data Connection Ltd, Accessed on 30 December 2007
  23. 23.
    Mannie, E.: Generalized multi-protocol label switching (GMPLS) architecture, IETF RFC 3945 Oct. (2004)Google Scholar
  24. 24.
    Gamage, M., Hayasaka, M., Miki, T.: Implementation of virtual path hopping (VPH) as a solution for control plane failures in connection oriented networks and an analysis of traffic distribution of VPH, Proceedings of 3rd International Workshop on QoS in Multi-service IP Networks (QoS-IP 2005), pp.124–135, 2005Google Scholar
  25. 25.
    Karol, M.J., Hluchyj, M.G., Morgan, S.P.: Input versus output queueing on a space-division packet switch. IEEE Trans. Commun. COM-35(12), 1347–1356 (1987)CrossRefGoogle Scholar
  26. 26.
    Network Simulator—ns-2, Accessed on 30 December 2007
  27. 27.
    Bollobas, B.: Random Graphs, 2nd edn. Cambridge University Press (2001)Google Scholar
  28. 28.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. Section 24.3: Dijkstra’s algorithm. MIT Press, McGraw-Hill, pp. 595–601 (2001)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Electronic EngineeringThe University of Electro-CommunicationsChofu-shiJapan

Personalised recommendations