Advertisement

An Efficient Resource Sharing Scheme for Dependable Real-Time Communication in Multihop Networks

  • Ranjith G 
  • C. Siva Ram Murthy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2552)

Abstract

Many real-time applications require communication services with guaranteed timeliness and fault-tolerance capabilities. Hence, we have the concept of a dependable connection (D-connection), which is a fault-tolerant real-time connection. A popular method used for a D-connection establishment is the primary-backup channel approach, wherein a D-connection is setup by the establishment of a primary and a backup path. But, we note that such a 100% dependable network is very inefficient. We introduce an efficient scheme called primary-backup multiplexing where D-connections may share their backup paths with other connections. We also describe a method where a D-connection can be given an intermediate fault-tolerance level between 0% dependability (no backup channel) and 100% dependability (dedicated backup). We present an efficient, connection-oriented and fault-tolerant D-connection establishment and resource-sharing scheme for real-time communications. We have noted in the simulation studies, that at light load, our scheme can effect a considerable improvement in the network resource utilization, with a relatively low drop in its fault-tolerance capabilities.

Keywords

Dependable connection primary channel backup channel primary-backup multiplexing RSVP 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Ferrari and D. C. Verma, “A Scheme for Real-Time Channel Establishment in Wide-Area Networks”, IEEE Journal on Selected Areas in Communications, vol. 8, no. 3, pp. 368–379, April 1990. 233CrossRefGoogle Scholar
  2. [2]
    S. Han and K. G. Shin, “Efficient Spare-Resource Allocation for Fast Restoration of Real-Time Channels from Network Component Failures”, in Proc. of IEEE RTSS’97, pp. 99–108, 1997. 233Google Scholar
  3. [3]
    S. Han and K. G. Shin, “A Primary-Backup ChannelAppro ach to Dependable Real-Time Communication in Multi-Hop Networks”, IEEE Trans. on Computers, vol. 47, no. 1, pp. 46–61, January 1998. 233CrossRefMathSciNetGoogle Scholar
  4. [4]
    G. P. Krishna, M. J. Pradeep, and C. Siva Ram Murthy, “A Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks”, in Proc. of IEEE WPDRTS 2000, pp. 678–684, May 2000. 233Google Scholar
  5. [5]
    G. P. Krishna, M. J. Pradeep, and C. Siva Ram Murthy, “An Efficient Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks”, to appear in IEEE/ACM Trans. on Networking. 234Google Scholar
  6. [6]
    G. Ranjith, G. P. Krishna, and C. Siva Ram Murthy, “A Distributed Primary-Segmented Backup Scheme for Dependable Real-Time Communication in Multihop Networks”, in Proc. of IEEE FTPDS 2002, Florida, USA, April 15–19, 2002. 234, 239Google Scholar
  7. [7]
    L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, “RSVP: A New Resource Reservation Protocol”, IEEE Network, vol. 7, pp. 8–18, September 1993. 238Google Scholar
  8. [8]
    UUNET, “UUNET Technologies,” http://www.uunet.com/network/maps, October 2001. 238
  9. [9]
    D. G. Anderson, H. Bala Krishnan, M. F. Kashooek, and R. Morris, “Resilient Overlay Networks,” in Proc. of ACM SOSP, pp. 131–145, October 2001. 238Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ranjith G 
    • 1
  • C. Siva Ram Murthy
    • 2
  1. 1.Veritas Software India LimitedPuneIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of TechnologyMadrasIndia

Personalised recommendations