Algebraic Requirements of Metrics for Multipath Routing
Abstract
Sea Power 21 is the Navy~s strategic vision that is enabled by the FORCEnet architectural framework that integrates warriors, sensor""s, networks, command and control, platforms, and weapons into a fully netted combat force. The FORCEnet vision is of a network envir""onment supporting multimodal communication including video, audio, telemetry, and data. FORCEnet requires robust, reliable communica""tion to all nodes in the sense that the network will function in a variety of environments, and that communication continues consist""ently under degraded operating conditions.Unfortunately, Internet technology is currently not a good match to the requirements of t""his vision. Specifically, the Internet is based on a destination-based routing model where each router computes the single best path"" to each destination in a network. The single-path nature of the Internet has limited ability to provide robust, reliable communicat""ion for a diverse set of communication applications across multiple security domains, as required in FORCEnet. In previous work we d""eveloped the Dominant Set Multipath Routing (DSMR) architecture for providing robust, reliable communication based on the use of the" best set of paths to destinations that provide the full range of performance and satisfy the full range of policies available from" the network.The metrics used in the Internet have traditionally been delay or cost related, and have used well-behaved algebras co""mposed of integer addition and comparison relations. As described above, as the Internet has evolved to serve as the consolidated co""mmunications infrastructure for the 21st century, the need to support new metrics and algebras has been introduced by new, time-sens""itive applications involving the transmission of audio, video and telemetry data. As shown in previous work, complex metrics must be" used with careful attention to their algebraic properties. Thesenew algebras are not as well-behaved as traditional Internet routi"ng algebras and, as has been documentedelsewhere, break the assumptions (implicitly) made by the Internet routing architecture. In" our previous work weidentified the necessary and sufficient properties required of these metrics to ensure traffic is forwarded ov"er loop-free and best (LFB) forwarding paths (we use the term best to generalize the concept of shortest used for traditional, dista""nce-based metrics) in a single-path routing environment. However, to our knowledge, nobody has attempted to address this problem for"" multipath routing; for this project we propose to do this. Specifically, for this project we will endeavor to identify the algebrai"c properties required of path algebras to ensure LFB forwarding paths in multipathrouting environments
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Jan 23, 2018
- Source ID
- N000141812095
Entities
People
- Bradley Smith
Organizations
- Office of Naval Research
- United States Navy
- University of California, Santa Cruz