Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Scalable Multicast Routing For Ad Hoc Networks, Manoj Pandey, Daniel Zappala
Scalable Multicast Routing For Ad Hoc Networks, Manoj Pandey, Daniel Zappala
Faculty Publications
Routing in a mobile ad hoc network is challenging because nodes can move at any time, invalidating a previously-discovered route. Multicast routing is even more challenging, because a source needs to maintain a route to potentially many group members simultaneously. Providing scalable solutions to this problem typically requires building a hierarchy or an overlay network to reduce the cost of route discovery and maintenance. In this paper, we show that a much simpler alternative is possible, by using source specific semantics and relying on the unicast routing protocol to find all routes. This separation of concerns enables the multicast routing …
A Secure Group Communication Architecture For Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips, Barry E. Mullins, Richard Raines, Rusty O. Baldwin
A Secure Group Communication Architecture For Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips, Barry E. Mullins, Richard Raines, Rusty O. Baldwin
Faculty Publications
This paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the …
Modeling The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo
Modeling The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo
Faculty Publications
To support IP multicast, domains must assign a unique multicast address to each application from a limited, globally-shared address space. We examine the performance of several classes of address allocation algorithms withln the context of the MASC architecture. This study is the first of its kind to model the generalized multicast address allocation problem and consider non-contiguous allocation algorithms. We find that prefix-based allocation outperforms our non-contiguous algorithm, despite the apparent advantages of non-contiguous allocation. We also verify the benefits of using worst-fit for new allocations.
A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer
A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer
Faculty Publications
The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globally-shared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe several new allocation algorithms that use a hypercube model for address representation.
Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou
Performance Evaluation Of Path Searching Heuristics For Multicast Qos Routing, Daniel Zappala, Dayi Zhou
Faculty Publications
Quality of Service routing for multicast enables a group member to find and install a branch of the multicast tree that can meet its QoS constraints. The most promising protocols in this area use receiver-oriented path searching heuristics to find feasible routes. In this paper, we examine the performance of the path searching heuristics used by these protocols, to determine which techniques are the most effective. We find that several low-overhead path searching heuristics are effective, and that generic path searching can work as well as targeted, QoS-specific searching.
Using Ssm Proxies To Provide Efficient Multiple-Source Multicast Delivery, Daniel Zappala, Aaron Fabbri
Using Ssm Proxies To Provide Efficient Multiple-Source Multicast Delivery, Daniel Zappala, Aaron Fabbri
Faculty Publications
We consider the possibility that single-source multicast (SSM) will become a universal multicast service, enabling large-scale distribution of content from a few well-known sources to a general audience. Operating under this assumption, we explore the problem of building the traditional IP model of any-source multicast on top of SSM. Toward this end, we design an SSM proxy service that allows any sender to efficiently deliver content to a multicast group. We demonstrate the performance improvements this service offers over standard SSM and describe extensions for access control, dynamic proxy discovery, and multicast proxy distribution.
Alternate Path Routing For Multicast, Daniel Zappala
Alternate Path Routing For Multicast, Daniel Zappala
Faculty Publications
Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, aside from some work applying these concepts to unicast flows, alternate path routing has received little attention in the Internet community. We describe and evaluate an architecture for alternate path routing for multicast flows. For path installation, we design a receiver-oriented alternate path protocol and prove that it reconfigures multicast trees without introducing loops. For path computation, we propose a scalable local search heuristic that allows receivers to find alternate paths using only partial network information. We …