1,979 research outputs found

    Overlay networks for smart grids

    Get PDF

    Content Distribution by Multiple Multicast Trees and Intersession Cooperation: Optimal Algorithms and Approximations

    Full text link
    In traditional massive content distribution with multiple sessions, the sessions form separate overlay networks and operate independently, where some sessions may suffer from insufficient resources even though other sessions have excessive resources. To cope with this problem, we consider the universal swarming approach, which allows multiple sessions to cooperate with each other. We formulate the problem of finding the optimal resource allocation to maximize the sum of the session utilities and present a subgradient algorithm which converges to the optimal solution in the time-average sense. The solution involves an NP-hard subproblem of finding a minimum-cost Steiner tree. We cope with this difficulty by using a column generation method, which reduces the number of Steiner-tree computations. Furthermore, we allow the use of approximate solutions to the Steiner-tree subproblem. We show that the approximation ratio to the overall problem turns out to be no less than the reciprocal of the approximation ratio to the Steiner-tree subproblem. Simulation results demonstrate that universal swarming improves the performance of resource-poor sessions with negligible impact to resource-rich sessions. The proposed approach and algorithm are expected to be useful for infrastructure-based content distribution networks with long-lasting sessions and relatively stable network environment

    A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

    Full text link
    This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

    An XCAST Multicast Implementation for the OverSim Simulator

    Get PDF
    The development of hybrid multicast simulation models is required for analyzing proposed hybrid multicast architectures such as those from the IRTF Scalable Adaptive Multicastw Research Group. However most network layer simulators don't scale to the number of nodes needed for analyzing large overlays, and most overlay simulators don't have multicast routing models needed for analyzing hybrid approaches. In this work we have extended the OverSim simulator and INET framework which run on OMNET++ to include a multi-destination multicast routing protocol (XCAST). This paper describes our implementation experience

    Hybrid Multicasting Using Automatic Multicast Tunnels (AMT)

    Get PDF
    Native Multicast plays an important role in distributing and managing delivery of some of the most popular Internet applications, such as IPTV and media delivery. However, due to patchy support and the existence of multiple approaches for Native Multicast, the support for Native Multicast is fragmented into isolated areas termed Multicast Islands. This renders Native Multicast unfit to be used as an Internet wide application. Instead, Application Layer Multicast, which does not have such network requirements but is more expensive in terms of bandwidth and overhead, can be used to connect the native multicast islands. This thesis proposes Opportunistic Native Multicast (ONM) which employs Application LayerMulticast (ALM), on top of a DHT-based P2P overlay network, and AutomaticMulticast Tunnelling (AMT) to connect these islands. ALM will be used for discovery and initiating the AMT tunnels. The tunnels will encapsulate the traffic going between islands' Primary Nodes (PNs). AMT was used for its added benefits such as security and being better at traffic shaping and Quality Of Service (QoS). While different approaches for connecting multicast islands exists, the system proposed in the thesis was designed with the following characteristics in mind: scalability, availability, interoperability, self-adaptation and efficiency. Importantly, by utilising AMT tunnels, this approach has unique properties that improve network security and management

    An Evaluation of Opportunistic Native Multicast

    Get PDF
    Hybrid multicast opportunistically combines Application Layer Multicast and native multicast protocols. This paper presents an evaluation of Opportunistic Native Multicast which uses the AMT multicast tunnelling protocol. We describe our opportunistic multicasting approach that tries to solve the islands phenomenon by building unicast tunnels to connect these islands while attempting to utilise the native multicast capability of the islands. It is expected that this hybrid approach will improve both efficiency and availability of multicast. We compare our approach to the ALM protocol SCRIBE. The comparison here was done using five metrics: Stress, Stretch, intra-island traffic, interisland traffic and Delivery rate. In all of them, our proposed model has shown improved results over ALM. Moreover, we investigated what effect the number of islands that the receivers are distributed into, has on performance

    Broadcasting in Prefix Space: P2P Data Dissemination with Predictable Performance

    Full text link
    A broadcast mode may augment peer-to-peer overlay networks with an efficient, scalable data replication function, but may also give rise to a virtual link layer in VPN-type solutions. We introduce a simple broadcasting mechanism that operates in the prefix space of distributed hash tables without signaling. This paper concentrates on the performance analysis of the prefix flooding scheme. Starting from simple models of recursive kk-ary trees, we analytically derive distributions of hop counts and the replication load. Extensive simulation results are presented further on, based on an implementation within the OverSim framework. Comparisons are drawn to Scribe, taken as a general reference model for group communication according to the shared, rendezvous-point-centered distribution paradigm. The prefix flooding scheme thereby confirmed its widely predictable performance and consistently outperformed Scribe in all metrics. Reverse path selection in overlays is identified as a major cause of performance degradation.Comment: final version for ICIW'0
    • …
    corecore