We investigate a heuristic application-level (overlay) multicast approach, which we call Topology Aware Grouping (TAG). TAG exploits underlying network topology data to construct multicast overlay networks. TAG uses information about overlap in routes to the sender among group members to set up the overlay network in a distributed low-overhead manner. The constructed tree has low relative delay penalty, and introduces a limited number of identical copies of a packet on the same link" assuming underlying routes are of good quality. We study the properties of TAG, and quantify its economies of scale factor, compared to unicast and IP multicast. We also compare TAG with End System Multicast (ESM) in a variety of simulation configurations, including both real Internet topologies and generated topologies. Our results indicate the effectiveness of our heuristic in reducing delays and duplicate packets, with reasonable time and space complexities. TAG can be combined with delay and bandwidth bounds to construct overlays that satisfy application requirements.
Date of creation, presentation, or exhibit
Department, Program, or Center
Computer Science (GCCIS)
"Topology-Aware Overlay Networks for Group Communication," Proceedings of ACM NOSSDAV. May 2002. pps. 127-136
RIT – Main Campus