Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 15 of 15
Full-Text Articles in Physical Sciences and Mathematics
Fundamental Limits On End-To-End Throughput Of Network Coding In Multi-Rate And Multicast Wireless Networks, Luiz Felipe Viera, Mario Gerla, Archan Misra
Fundamental Limits On End-To-End Throughput Of Network Coding In Multi-Rate And Multicast Wireless Networks, Luiz Felipe Viera, Mario Gerla, Archan Misra
Research Collection School Of Computing and Information Systems
This paper investigates the interaction between network coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. Next …
Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac Sreenan, Chun Tung Chou, Archan Misra, Sanjay Jha
Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac Sreenan, Chun Tung Chou, Archan Misra, Sanjay Jha
Research Collection School Of Computing and Information Systems
This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy and low capacity multi-hop wireless paths. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link controlled routing tree algorithm, and the dynamic group management algorithm. These algorithms use different approaches to arrange nodes involved in video multicasting into a clustered and two-tier integrated architecture in which network protocols can …
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 …
Rate-Diversity And Resource-Aware Broadcast And Multicast In Multi-Rate Wireless Mesh Networks, Bao Hua Liu, Chun Tung Chou, Archan Misra, Sanjay Jha
Rate-Diversity And Resource-Aware Broadcast And Multicast In Multi-Rate Wireless Mesh Networks, Bao Hua Liu, Chun Tung Chou, Archan Misra, Sanjay Jha
Research Collection School Of Computing and Information Systems
This paper focuses on the problem of increasing the traffic capacity (volume of admissible traffic) of broadcast and multicast flows in a wireless mesh network (WMN). We study and suggest routing strategies where the process of constructing the forwarding tree considers three distinct features: (a) the ability of individual mesh nodes to perform link-layer broadcasts at multiple rates, (b) the wireless broadcast advantage, whereby a single broadcast transmission covers multiple neighboring receivers and (c) the residual transmission capacity at a WMN node, subject to intereference-based constraints from existing traffic flows in its neighborhood. Our metric of interest is the total …
Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir
Low-Latency Broadcast In Multirate Wireless Mesh Networks, Chun Tung Chou, Archan Misra, Junaid Qadir
Research Collection School Of Computing and Information Systems
In a multirate wireless network, a node can dynamically adjust its link transmission rate by switching between different modulation schemes. In the current IEEE802.11a/b/g standards, this rate adjustment is defined for unicast traffic only. In this paper, we consider a wireless mesh network (WMN), where a node can dynamically adjust its link-layer multicast rates to its neighbors, and address the problem of realizing low-latency network-wide broadcast in such a mesh. We first show that the multirate broadcast problem is significantly different from the single-rate case. We will then present an algorithm for achieving low-latency broadcast in a multirate mesh which …
An Approach To The Optimization Of Convergent Networks On Ip/Mpls With An Optical Gmpls Backbone In Multicast, Yezid Donoso, Carolina Alvarado, Alfredo J. Perez, Ivan Herazo
An Approach To The Optimization Of Convergent Networks On Ip/Mpls With An Optical Gmpls Backbone In Multicast, Yezid Donoso, Carolina Alvarado, Alfredo J. Perez, Ivan Herazo
Computer Science Faculty Publications
This paper shows the solution of a multiobjective scheme for multicast transmissions in MPLS networks with a GMLS optical backbone using evolutive algorithms. It has not been showed models that optimize one or more parameters integrating these two types of networks. Because the proposed scheme is a NP-Hard problem, an algorithm has been developed to solve the problem on polynomial time. The main contributions of this paper are the proposed mathematical model and the algorithm to solve it.
A Secure Multicast Architecture And Protocol For Mospf, Junqi Zhang, Yi Mu, Vijay Varadharajan
A Secure Multicast Architecture And Protocol For Mospf, Junqi Zhang, Yi Mu, Vijay Varadharajan
Faculty of Informatics - Papers (Archive)
Multicast Open Shortest Path First (MOSPF) is an en hancement to unicast routing protocol OSPF. It has been widely used in many multicast applications for years. How ever, its security is still a major concern in some applica tions. Much work has been done on data protection, but only a few works have been done on member access con trol mechanisms. In this paper, we present a new secure multicast architecture and protocol for MOSPF from the perspective of member access control. Our new model in cludes a variant of previous access control mechanism and a novel distributed encryption scheme. …
Multicasting In Multihop Optical Wdm Networks With Limited Wavelength Conversion, Hong Shen, Yi Pan, John Sum, Susumu Horiguchi
Multicasting In Multihop Optical Wdm Networks With Limited Wavelength Conversion, Hong Shen, Yi Pan, John Sum, Susumu Horiguchi
Computer Science Faculty Publications
This paper provides an overview on efficient algorithms for multicasting in optical networks supported by Wavelength Division Multiplexing (WDM) with limited wavelength conversion. We classify the multicast problems according to off-line and on-line in both reliable and unreliable networks. In each problem class, we present efficient algorithms for multicast and multiple multicast and show their performance. We also present efficient schemes for dynamic multicast group membership updating. We conclude the paper by showing possible extension of the presented algorithms for QoS provision.
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.
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
In this paper, we first review the existing IPv4 based multicast protocols and identify their shortcomings. We then proposed a new multicast protocol, called Multicast Internet Protocol (MIP), which is both scalable and flexible. The design principle of MIP is fundamentally different from the existing IPv4 based multicast protocols. The issues related to MIP routing and implementations are also studied in this paper.
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 …