TY - GEN
T1 - Design, implementation, and evaluation of highly available distributed call processing systems
AU - Murakami, Kazutaka
AU - Buskens, Richard W.
AU - Ramjee, Ramachandran
AU - Lin, Yow Jian
AU - LaPorta, Thomas F.
N1 - Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - This paper presents the design of a highly available distributed call processing system and its implementation on a local area network of commercial, off-the-shelf workstations. A major challenge of using off-the-shelf components is meeting the strict performance and availability requirements in place for existing public telecommunications systems in a cost-effective manner. Traditional checkpointing and message logging schemes for general distributed applications are not directly applicable since call processing applications built using these schemes suffer from high failure-free overhead and long recovery delays. We propose an application-level fault-tolerance scheme that takes advantage of general properties of distributed call processing systems to avoid message logging and to limit checkpointing overhead. The proposed scheme, applied to a call processing system for wireless networks, shows average call setup latencies of 180ms, failover times of less than three seconds, and recovery times of less than seventeen seconds. System availability is estimated to be 0.99995. The results indicate that using our proposed scheme meets the above challenge.
AB - This paper presents the design of a highly available distributed call processing system and its implementation on a local area network of commercial, off-the-shelf workstations. A major challenge of using off-the-shelf components is meeting the strict performance and availability requirements in place for existing public telecommunications systems in a cost-effective manner. Traditional checkpointing and message logging schemes for general distributed applications are not directly applicable since call processing applications built using these schemes suffer from high failure-free overhead and long recovery delays. We propose an application-level fault-tolerance scheme that takes advantage of general properties of distributed call processing systems to avoid message logging and to limit checkpointing overhead. The proposed scheme, applied to a call processing system for wireless networks, shows average call setup latencies of 180ms, failover times of less than three seconds, and recovery times of less than seventeen seconds. System availability is estimated to be 0.99995. The results indicate that using our proposed scheme meets the above challenge.
UR - http://www.scopus.com/inward/record.url?scp=0347520385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0347520385&partnerID=8YFLogxK
U2 - 10.1109/FTCS.1998.689461
DO - 10.1109/FTCS.1998.689461
M3 - Conference contribution
AN - SCOPUS:0347520385
T3 - Digest of Papers - 28th Annual International Symposium on Fault-Tolerant Computing, FTCS 1998
SP - 118
EP - 127
BT - Digest of Papers - 28th Annual International Symposium on Fault-Tolerant Computing, FTCS 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 28th Annual International Symposium on Fault-Tolerant Computing, FTCS 1998
Y2 - 23 June 1998 through 25 June 1998
ER -