4,556 research outputs found

    Reflections on security options for the real-time transport protocol framework

    Get PDF
    The Real-time Transport Protocol (RTP) supports a range of video conferencing, telephony, and streaming video ap- plications, but offers few native security features. We discuss the problem of securing RTP, considering the range of applications. We outline why this makes RTP a difficult protocol to secure, and describe the approach we have recently proposed in the IETF to provide security for RTP applications. This approach treats RTP as a framework with a set of extensible security building blocks, and prescribes mandatory-to-implement security at the level of different application classes, rather than at the level of the media transport protocol

    deployable) reduction of multicast state with in-packet Bloom filters

    Get PDF
    Abstract-Recent developments in networking technology have enabled massive media distribution in the Internet. However, bandwidth is still a limited resource and unicast-based media distribution from a single source to multiple receivers is inefficient. Multicasting provides traffic replication closer to the receivers allowing more efficient data distribution. IP multicast can be used for distributing data streams in IP networks, but the bandwidth saving comes at the cost of increased state in the network routers. The amount of state is directly dependent on the number of multicast groups in use. In this paper, we show how in-packet Bloom filter (iBF) multicast can be used to reduce multicast state in the network. The deployment can be done gradually: during the migration phase, a single AS can replace IP multicast with proposed iBF-based solution without affecting the rest of the network, and take advantage of the reduced state in its core routers. I. INTRODUCTION The network usage has changed since the dawn of the Internet as substantial advances in networking technology have enabled new and more diverse applications. Today's Internet performance allows transmitting high-quality audio and video streams over the net. In a typical live media transmission case, a stream is delivered to multiple receivers simultaneously. This dissemination mostly happens via massive fan-outs of unicast connections because network layer multicasting is not widely deployed or enabled -beyond possibly intra-provider IPTV streaming or overlay P2P networks [?]. This makes the media delivery inefficient from the network point of view since the data has to be sent repeatedly over the same links. The need for an efficient multicast solution is obvious. In the current Internet, multicast can be implemented either at the IP layer with IP multicast [1], or with different kinds of application layer solutions Application layer multicast protocols [2] use unicast connections to deliver traffic across routers supporting application layer multicast. At each such multicast router, data packets are replicated at the application layer if necessary, and sent to the next hop router(s) over separate unicast connections, in essence forming an overlay somewhat similar to the early Multicast backbone (Mbone). IP multicast LIPSI

    Multiple-Tree Push-based Overlay Streaming

    Full text link
    Multiple-Tree Overlay Streaming has attracted a great amount of attention from researchers in the past years. Multiple-tree streaming is a promising alternative to single-tree streaming in terms of node dynamics and load balancing, among others, which in turn addresses the perceived video quality by the streaming user on node dynamics or when heterogeneous nodes join the network. This article presents a comprehensive survey of the different aproaches and techniques used in this research area. In this paper we identify node-disjointness as the property most approaches aim to achieve. We also present an alternative technique which does not try to achieve this but does local optimizations aiming global optimizations. Thus, we identify this property as not being absolute necessary for creating robust and heterogeneous multi-tree overlays. We identify two main design goals: robustness and support for heterogeneity, and classify existing approaches into these categories as their main focus

    A component-based middleware framework for configurable and reconfigurable Grid computing

    Get PDF
    Significant progress has been made in the design and development of Grid middleware which, in its present form, is founded on Web services technologies. However, we argue that present-day Grid middleware is severely limited in supporting projected next-generation applications which will involve pervasive and heterogeneous networked infrastructures, and advanced services such as collaborative distributed visualization. In this paper we discuss a new Grid middleware framework that features (i) support for advanced network services based on the novel concept of pluggable overlay networks, (ii) an architectural framework for constructing bespoke Grid middleware platforms in terms of 'middleware domains' such as extensible interaction types and resource discovery. We believe that such features will become increasingly essential with the emergence of next-generation e-Science applications. Copyright (c) 2005 John Wiley & Sons, Ltd

    Multi-layer virtual transport network management

    Full text link
    Nowadays there is an increasing need for a general paradigm which can simplify network management and further enable network innovations. Software Defined Networking (SDN) is an efficient way to make the network programmable and reduce management complexity, however it is plagued with limitations inherited from the legacy Internet (TCP/IP) architecture. In this paper, in response to limitations of current Software Defined Networking (SDN) management solutions, we propose a recursive approach to enterprise network management, where network management is done through managing various Virtual Transport Networks (VTNs) over different scopes (i.e., regions of operation). Different from the traditional virtual network model which mainly focuses on routing/tunneling, our VTN provides communication service with explicit Quality-of-Service (QoS) support for applications via transport flows, and it involves all mechanisms (e.g., addressing, routing, error and flow control, resource allocation) needed to support such transport flows. Based on this approach, we design and implement a management architecture, which recurses the same VTN-based management mechanism for enterprise network management. Our experimental results show that our management architecture achieves better performance.National Science Foundation awards: CNS-0963974 and CNS-1346688

    CliqueStream: an efficient and fault-resilient live streaming network on a clustered peer-to-peer overlay

    Full text link
    Several overlay-based live multimedia streaming platforms have been proposed in the recent peer-to-peer streaming literature. In most of the cases, the overlay neighbors are chosen randomly for robustness of the overlay. However, this causes nodes that are distant in terms of proximity in the underlying physical network to become neighbors, and thus data travels unnecessary distances before reaching the destination. For efficiency of bulk data transmission like multimedia streaming, the overlay neighborhood should resemble the proximity in the underlying network. In this paper, we exploit the proximity and redundancy properties of a recently proposed clique-based clustered overlay network, named eQuus, to build efficient as well as robust overlays for multimedia stream dissemination. To combine the efficiency of content pushing over tree structured overlays and the robustness of data-driven mesh overlays, higher capacity stable nodes are organized in tree structure to carry the long haul traffic and less stable nodes with intermittent presence are organized in localized meshes. The overlay construction and fault-recovery procedures are explained in details. Simulation study demonstrates the good locality properties of the platform. The outage time and control overhead induced by the failure recovery mechanism are minimal as demonstrated by the analysis.Comment: 10 page
    • …
    corecore