Fault-tolerant overlay protocol network

被引:1
|
作者
Shelly, Nicholas J. [1 ]
Jensen, Nathan A. [1 ]
Baird, Leemon C. [1 ]
Moore, Jason A. [1 ]
机构
[1] USAF Acad, Colorado Springs, CO 80840 USA
关键词
availability; overlay; tunnel; voice over Internet protocol; virtual private networking;
D O I
10.1109/IAW.2006.1652118
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Voice over Internet Protocol (VoIP) and other time critical communications require a level of availability much higher than the typical transport network supporting traditional data communications. These critical command and control channels must continue to operate and remain available in the presence of an attack or other network disruption. Even disruptions of short duration can severely damage, degrade, or drop a VoIP connection. Routing protocols in use today can dynamically adjust for a changing network topology. However, they generally cannot converge quickly enough to continue an existing voice connection. As packet switching technologies continue. to erode traditional circuit switching applications, some methodology or protocol must be developed that can support, these traditional requirements over a packet-based infrastructure. We propose the use of a modified overlay tunneling network and associated routing protocols called the Fault Tolerant Overlay Protocol (FTOP) network. This network is entirely logical; the supporting routing protocol may be greatly simplified due to the overlays's ability to appear fully connected. Therefore, ensuring confidentiality and availability are much simpler using traditional cryptographic isolation and VPN technologies. Empirical results show for substrate networks, convergence time may be as high as six to ten minutes. However, the FTOP overlay network has been shown to converge in a fraction of a second, yielding an observed two order of magnitude convergence time improvement. This unique ability enhances availability of critical network services allowing operation in the face of substrate network disruption caused by malicious attack or other failure.
引用
收藏
页码:369 / +
页数:2
相关论文
共 50 条
  • [31] The Palindrome network for fault-tolerant interconnection
    Liao, YY
    Lu, M
    Tzeng, NF
    EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 556 - 561
  • [32] Fault-tolerant routing through the 'Umbrella' protocol
    Sotiriou, Athanasios-Dimitrios
    Kalliaras, Panagiotis
    Mitrou, Nikolas
    INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY, 2007, 2 (3-4) : 252 - 263
  • [33] Analytically modeling a fault-tolerant messaging protocol
    Grossman, JP
    IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (07) : 870 - 878
  • [34] A metaobject protocol for fault-tolerant CORBA applications
    Killijian, MO
    Fabre, JC
    Ruiz-Garcia, JC
    Chiba, S
    SEVENTEENTH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 1998, : 127 - 134
  • [35] AN EFFICIENT FAULT-TOLERANT DECENTRALIZED COMMIT PROTOCOL
    YUAN, SM
    PARALLEL COMPUTING, 1994, 20 (01) : 101 - 114
  • [36] Fault-tolerant Quantum Private Comparison Protocol
    Xiao, Min
    Ma, ChunAn
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2022, 61 (02)
  • [37] Design of a fast, low-level fault-tolerant protocol for Network on Chips
    Ali, Muhammad
    Adnan, Awais
    Welzl, Michael
    INNOVATIONS AND ADVANCED TECHNIQUES IN COMPUTER AND INFORMATION SCIENCES AND ENGINEERING, 2007, : 345 - +
  • [38] THE RELAXED-RING: A FAULT-TOLERANT TOPOLOGY FOR STRUCTURED OVERLAY NETWORKS
    Mejias, Boris
    Van Roy, Peter
    PARALLEL PROCESSING LETTERS, 2008, 18 (03) : 411 - 432
  • [39] Dynamic routing protocol performance in a fault-tolerant Ethernet-based IP network
    Baranski, J
    Crocker, M
    Lazarou, G
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VIII, PROCEEDINGS: CONTROL, COMMUNICATION AND NETWORK SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2004, : 1 - 5
  • [40] A synthesis method for fault-tolerant multicast routing protocol
    Ishida, K
    Amano, K
    PARALLEL AND DISTRIBUTED PROCESSING, 1998, 1388 : 1121 - 1130