Design and evaluation of routing schemes for dependable real-time connections

Songkuk Kim, Daji Qiao, Sharath Kodase, Kang G. Shin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Dependability-of-Service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings, and command & control applications. The Dependable Real-Time Protocol (DRTP) in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and the reduction of overhead in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for primary and backup channels while satisfying the required Quality-of-Service (QoS). The costs of link-state and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our indepth simulations have shown that the proposed routing schemes are highly effective, providing fault-tolerance of 87% or higher with the network capacity overhead of less than 25%.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Dependable Systems and Networks
EditorsD.C. Young, D.C. Young
Pages285-294
Number of pages10
Publication statusPublished - 2001 Dec 1
EventProceedings of the International Conference on Dependable Systems and Networks - Goteborg, Sweden
Duration: 2001 Jul 12001 Jul 4

Other

OtherProceedings of the International Conference on Dependable Systems and Networks
CountrySweden
CityGoteborg
Period01/7/101/7/4

Fingerprint

Recovery
Fault tolerance
Quality of service
Communication
Costs
Industry

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Kim, S., Qiao, D., Kodase, S., & Shin, K. G. (2001). Design and evaluation of routing schemes for dependable real-time connections. In D. C. Young, & D. C. Young (Eds.), Proceedings of the International Conference on Dependable Systems and Networks (pp. 285-294)
Kim, Songkuk ; Qiao, Daji ; Kodase, Sharath ; Shin, Kang G. / Design and evaluation of routing schemes for dependable real-time connections. Proceedings of the International Conference on Dependable Systems and Networks. editor / D.C. Young ; D.C. Young. 2001. pp. 285-294
@inproceedings{dfb48ad7ad524d63aa10d333fcd37363,
title = "Design and evaluation of routing schemes for dependable real-time connections",
abstract = "Dependability-of-Service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings, and command & control applications. The Dependable Real-Time Protocol (DRTP) in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and the reduction of overhead in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for primary and backup channels while satisfying the required Quality-of-Service (QoS). The costs of link-state and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our indepth simulations have shown that the proposed routing schemes are highly effective, providing fault-tolerance of 87{\%} or higher with the network capacity overhead of less than 25{\%}.",
author = "Songkuk Kim and Daji Qiao and Sharath Kodase and Shin, {Kang G.}",
year = "2001",
month = "12",
day = "1",
language = "English",
isbn = "0769511015",
pages = "285--294",
editor = "D.C. Young and D.C. Young",
booktitle = "Proceedings of the International Conference on Dependable Systems and Networks",

}

Kim, S, Qiao, D, Kodase, S & Shin, KG 2001, Design and evaluation of routing schemes for dependable real-time connections. in DC Young & DC Young (eds), Proceedings of the International Conference on Dependable Systems and Networks. pp. 285-294, Proceedings of the International Conference on Dependable Systems and Networks, Goteborg, Sweden, 01/7/1.

Design and evaluation of routing schemes for dependable real-time connections. / Kim, Songkuk; Qiao, Daji; Kodase, Sharath; Shin, Kang G.

Proceedings of the International Conference on Dependable Systems and Networks. ed. / D.C. Young; D.C. Young. 2001. p. 285-294.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Design and evaluation of routing schemes for dependable real-time connections

AU - Kim, Songkuk

AU - Qiao, Daji

AU - Kodase, Sharath

AU - Shin, Kang G.

PY - 2001/12/1

Y1 - 2001/12/1

N2 - Dependability-of-Service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings, and command & control applications. The Dependable Real-Time Protocol (DRTP) in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and the reduction of overhead in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for primary and backup channels while satisfying the required Quality-of-Service (QoS). The costs of link-state and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our indepth simulations have shown that the proposed routing schemes are highly effective, providing fault-tolerance of 87% or higher with the network capacity overhead of less than 25%.

AB - Dependability-of-Service (DoS) has become an important requirement for real-time applications, such as remote medical services, business-critical network meetings, and command & control applications. The Dependable Real-Time Protocol (DRTP) in which each dependable real-time connection is realized with one primary and one or more backup channels, has been shown to be an effective way of providing DoS. How to route both primary and backup channels for each dependable real-time connection is of vital importance to the success of failure recovery and the reduction of overhead in providing DoS. In this paper, we propose and evaluate three different schemes for routing the primary and backup channels of each dependable real-time connection. Specifically, we present methods based on link-state information and bounded flooding to discover routes for primary and backup channels while satisfying the required Quality-of-Service (QoS). The costs of link-state and flooding algorithms are reduced significantly by using the fact that the probability of success in failure recovery can be estimated with simple link-state information, and by bounding the flooded region within an ellipse with the two communication end-points as loci. Our indepth simulations have shown that the proposed routing schemes are highly effective, providing fault-tolerance of 87% or higher with the network capacity overhead of less than 25%.

UR - http://www.scopus.com/inward/record.url?scp=0035789780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035789780&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0769511015

SP - 285

EP - 294

BT - Proceedings of the International Conference on Dependable Systems and Networks

A2 - Young, D.C.

A2 - Young, D.C.

ER -

Kim S, Qiao D, Kodase S, Shin KG. Design and evaluation of routing schemes for dependable real-time connections. In Young DC, Young DC, editors, Proceedings of the International Conference on Dependable Systems and Networks. 2001. p. 285-294