Multi-Contrained Multi-Path Routing Algorithms
Abstract
In this high-tech and network-centric era, many of our military actions require the transmission of high quality video in real time in a computer or communications networks. The objective of this project is to design effective algorithms for routing in computer networks subject to multiple constraints. Given a source node s and a destination node t, it is of great importance to compute an st path or a set of st paths such that the aggregated bandwidth of the set of paths is greater than or equal to a specified bandwidth requirement and at the same time, the longest delay of the paths is no more than a specified delay requirement.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 03, 2019
- Accession Number
- AD1078601
Entities
People
- Guoliang Xue
Organizations
- Arizona State University