Low-cost Delay-constrained Multicast Routing Heuristics and Their Evaluation
Critical wide-area infrastructures (CWI) need real-time monitoring and control for their reliable operation and for fast identification and resolution of anomalies within these infrastructures. Real-time monitoring and control is made possible by the use of multicast routing for fast, efficient, and reliable dissemination of status information in the CWI.
The fast and efficient dissemination of status information in these infrastructures imposes delay and cost requirements on the multicast routing heuristic. To ensure reliability in the face of network failures, the multicast graphs constructed by the heuristic need to have at least two paths from the source to each destination in the network.
Satisfying the delay requirements of the application ensures that the data delivered to the destination is fresh. Reducing the total cost of the multicast graph helps in lowering resource usage. Additionally, having two node-disjoint paths from the source to each destination makes a multicast graph resilient to node or edge failures and improves its survivability against such failures.
This dissertation presents new heuristics for constructing survivable and non-survivable low-cost delay-constrained multicast graphs and presents more extensive evaluations than have typically been used to demonstrate properties of multicast routing heuristics.
The edge-priority based dynamic weight heuristic (DWH) proposed in this work constructs non-survivable, low-cost, delay-constrained multicast trees. DWH assigns dynamic weights to edges based on ho w close the edge is to violating the delay bound of the application. The elective-edge-costs (edge-costs influenced by edge-weights) are then used as indicators of the relative merit of including the edge in the paths from the source to the destination node.
Dynamic weight disjoint path pairs (DW-DPP) heuristic is the survivable variant of DWH and constructs delay influenced (like in DWH edges are assigned varying weights based on the delay bound requirements) shared disjoint path pairs from the source to each destination node. Edges can be shared by paths to multiple destination nodes thus reducing the total cost of the multicast graph. The evaluations show that DWH and DW-DPP construct multicast graphs with 10-15% lower costs than the node-priority based heuristics that are also explored in this work.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
- The following copyright notice applies to all of the above items that appear in IEEE publications: "Personal use of this material is permitted. However, permission to reprint/publish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE."
- The following copyright notice applies to all of the above items that appear in ACM publications: "© ACM, effective the year of publication shown in the bibliographic information. This file is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in the journal or proceedings indicated in the bibliographic data for each item."
- The following copyright notice applies to all of the above items that appear in IFAC publications: "Document is being reproduced under permission of the Copyright Holder. Use or reproduction of the Document is for informational or personal use only."
