The Experts below are selected from a list of 23478 Experts worldwide ranked by ideXlab platform

Bharat Bhargava - One of the best experts on this subject based on the ideXlab platform.

  • A tree-based forward digest protocol to verify data integrity in distributed Media Streaming
    IEEE Transactions on Knowledge and Data Engineering, 2005
    Co-Authors: A. Habib, Bharat Bhargava, D. Xu, M. Atallah, J. Chuang
    Abstract:

    We design a tree-based forward digest protocol (TFDP) to verify data integrity in distributed Media Streaming for content distribution. Several challenges arise, including the timing constraint of Streaming sessions, the involvement of multiple senders, and the untrustworthiness of these senders. A comprehensive comparison is presented on the performance of existing protocols and TFDP, with respect to communication and computation overhead. Both simulation and Internet-based experimental results are presented to demonstrate the effectiveness of TFDP.

  • a hybrid architecture for cost effective on demand Media Streaming
    Computer Networks, 2004
    Co-Authors: Mohamed Hefeeda, Bharat Bhargava, David K Y Yau
    Abstract:

    We propose a new architecture for on-demand Media Streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new Media files, (ii) reduction of the load on the underlying network, and (iii) better Streaming service.We demonstrate the potential of the proposed architecture for a large-scale on-demand Media Streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited Streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.

  • promise peer to peer Media Streaming using collectcast
    ACM Multimedia, 2003
    Co-Authors: Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Bharat Bhargava
    Abstract:

    We present the design, implementation, and evaluation of PROMISE, a novel peer-to-peer Media Streaming system encompassing the key functions of peer lookup, peer-based aggregated Streaming, and dynamic adaptations to network and peer conditions. Particularly, PROMISE is based on a new application level P2P service called CollectCast. CollectCast performs three main functions: (1) inferring and leveraging the underlying network topology and performance information for the selection of senders; (2) monitoring the status of peers and connections and reacting to peer/connection failure or degradation with low overhead; (3) dynamically switching active senders and standby senders, so that the collective network performance out of the active senders remains satisfactory. Based on both real-world measurement and simulation, we evaluate the performance of PROMISE, and discuss lessons learned from our experience with respect to the practicality and further optimization of PROMISE.

  • on peer to peer Media Streaming
    International Conference on Distributed Computing Systems, 2002
    Co-Authors: Mohamed Hefeeda, Susanne E Hambrusch, Bharat Bhargava
    Abstract:

    In this paper, we study a peer-to-peer Media Streaming system with the following characteristics: (1) its Streaming capacity grows dynamically; (2) peers do not exhibit server-like behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each Streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign Media data to multiple supplying peers in one Streaming session and (2) how to quickly amplify the system's total Streaming capacity. Our solution to the first problem is an optimal Media data assignment algorithm OTS/sub p2p/, which results in minimum buffering delay in the consequent Streaming session. Our solution to the second problem is a distributed differentiated admission control protocol DAC/sub p2p/. By differentiating between requesting peers with different outbound bandwidth, DAC/sub p2p/ achieves fast system capacity amplification; benefits all requesting peers in admission rate, waiting time, and buffering delay; and creates an incentive for peers to offer their truly available out-bound bandwidth.

Pascal Frossard - One of the best experts on this subject based on the ideXlab platform.

  • Media Streaming with network diversity research indicates opportunities for improving Media quality in networks like the internet with multiple paths but also poses new coding scheduling routing and path computation problems
    Proceedings of the IEEE, 2008
    Co-Authors: Pascal Frossard, Juan Carlos De Martin, Reha M Civanlar
    Abstract:

    Today's packet networks including the Internet offer an intrinsic diversity for Media distribution in terms of available network paths and servers or information sources. Novel communication infrastructures such as ad hoc or wireless mesh networks use network diversity to extend their reach at low cost. Diversity can bring interesting benefits in supporting resource greedy applications such as Media Streaming services, by aggregation of bandwidth and comput- ing resources. Typically, overlay network architectures com- pensate for lack of quality-of-service guarantees in the network by introducing redundancy in the Media delivery system through network diversity. They can support efficient multi- Media services when routing, coding, and scheduling algo- rithms are able to adapt to both the Media information and the dynamic network status. This paper presents an overview of the distributed Streaming solutions that profit from network diversity in order to improve the quality of multiMedia applications. We discuss the coding techniques used for adaptive and flexible Media Streaming with network diversity. We describe the problem of Media Streaming with path diversity and focus on routing, path computation, and packet scheduling problems in multipath networks. Then, the advan- tages of server or source peer diversity in collaborative Streaming solutions are discussed. Lastly, we present an overview of wireless mesh networks and focus on the typical constraints imposed by these novel communication models on Media Streaming with network diversity.

  • enabling adaptive video Streaming in p2p systems peer to peer multiMedia Streaming
    IEEE Communications Magazine, 2007
    Co-Authors: Dan Jurca, Jacob Chakareski, Jeanpaul Wagner, Pascal Frossard
    Abstract:

    Peer-to-peer (P2P) systems are becoming increasingly popular due to their ability to deliver large amounts of data at a reduced deployment cost. In addition to fostering the development of novel Media applications, P2P systems also represent an interesting alternative paradigm for Media Streaming applications that can benefit from the inherent self organization and resource scalability available in such environments. This article presents an overview of application and network layer mechanisms that enable successful Streaming frameworks in peer-to-peer systems. We describe Media delivery architectures that can be deployed over P2P networks to address the specific requirements of Streaming applications. In particular, we show how video-Streaming applications can benefit from the diversity offered by P2P systems and implement distributed-Streaming and scheduling solutions with multi-path packet transmission.

  • Media Streaming with conservative delay on variable rate channels
    International Conference on Multimedia and Expo, 2006
    Co-Authors: Dan Jurca, Pascal Frossard
    Abstract:

    We address the problem of delay-constrained Streaming of multiMedia packets over dynamic bandwidth channels. Efficient Streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the Media packets to be transmitted, according with their sending time. However, the Streaming server usually cannot have a perfect knowledge of the channel bandwidth, and important packets may be lost because of over-estimation. We address the rate prediction mismatch by Media scheduling with a conservative delay, which provides a safety margin for the packet delivery, even in the presence of unpredicted bandwidth variations. We formulate an optimization problem whose goal is to find the optimal conservative delay to be used in the scheduling process, given the network model and the playback delay imposed by the client. We then propose a simple solution to the scheduling delay estimation, effective in real-time Streaming scenarios. Our Streaming method proves robust against channel prediction errors, and performs better than other mechanisms based on frame reordering strategies.

Mohamed Hefeeda - One of the best experts on this subject based on the ideXlab platform.

  • a hybrid architecture for cost effective on demand Media Streaming
    Computer Networks, 2004
    Co-Authors: Mohamed Hefeeda, Bharat Bhargava, David K Y Yau
    Abstract:

    We propose a new architecture for on-demand Media Streaming centered around the peer-to-peer (P2P) paradigm. The key idea of the architecture is that peers share some of their resources with the system. As peers contribute resources to the system, the overall system capacity increases and more clients can be served. The proposed architecture employs several novel techniques to: (1) use the often-underutilized peers' resources, which makes the proposed architecture both deployable and cost-effective, (2) aggregate contributions from multiple peers to serve a requesting peer so that supplying peers are not overloaded, (3) make a good use of peer heterogeneity by assigning relatively more work to the powerful peers, and (4) organize peers in a network-aware fashion, such that nearby peers are grouped into a logical entity called a cluster. The network-aware peer organization is validated by statistics collected and analyzed from real Internet data. The main benefit of the network-aware peer organization is that it allows to develop efficient searching (to locate nearby suppliers) and dispersion (to disseminate new files into the system) algorithms. We present network-aware searching and dispersion algorithms that result in: (i) fast dissemination of new Media files, (ii) reduction of the load on the underlying network, and (iii) better Streaming service.We demonstrate the potential of the proposed architecture for a large-scale on-demand Media Streaming service through an extensive simulation study on large, Internet-like, topologies. Starting with a limited Streaming capacity (hence, low cost), the simulation shows that the capacity rapidly increases and many clients can be served. This occurs for all studied arrival patterns, including constant rate arrivals, flash crowd arrivals, and Poisson arrivals. Furthermore, the simulation shows that a reasonable client-side initial buffering of 10-20 s is sufficient to ensure full quality playback even in the presence of peer failures.

  • promise peer to peer Media Streaming using collectcast
    ACM Multimedia, 2003
    Co-Authors: Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Bharat Bhargava
    Abstract:

    We present the design, implementation, and evaluation of PROMISE, a novel peer-to-peer Media Streaming system encompassing the key functions of peer lookup, peer-based aggregated Streaming, and dynamic adaptations to network and peer conditions. Particularly, PROMISE is based on a new application level P2P service called CollectCast. CollectCast performs three main functions: (1) inferring and leveraging the underlying network topology and performance information for the selection of senders; (2) monitoring the status of peers and connections and reacting to peer/connection failure or degradation with low overhead; (3) dynamically switching active senders and standby senders, so that the collective network performance out of the active senders remains satisfactory. Based on both real-world measurement and simulation, we evaluate the performance of PROMISE, and discuss lessons learned from our experience with respect to the practicality and further optimization of PROMISE.

  • on peer to peer Media Streaming
    International Conference on Distributed Computing Systems, 2002
    Co-Authors: Mohamed Hefeeda, Susanne E Hambrusch, Bharat Bhargava
    Abstract:

    In this paper, we study a peer-to-peer Media Streaming system with the following characteristics: (1) its Streaming capacity grows dynamically; (2) peers do not exhibit server-like behavior; (3) peers are heterogeneous in their bandwidth contribution; and (4) each Streaming session may involve multiple supplying peers. Based on these characteristics, we investigate two problems: (1) how to assign Media data to multiple supplying peers in one Streaming session and (2) how to quickly amplify the system's total Streaming capacity. Our solution to the first problem is an optimal Media data assignment algorithm OTS/sub p2p/, which results in minimum buffering delay in the consequent Streaming session. Our solution to the second problem is a distributed differentiated admission control protocol DAC/sub p2p/. By differentiating between requesting peers with different outbound bandwidth, DAC/sub p2p/ achieves fast system capacity amplification; benefits all requesting peers in admission rate, waiting time, and buffering delay; and creates an incentive for peers to offer their truly available out-bound bandwidth.

Anirban Mahanti - One of the best experts on this subject based on the ideXlab platform.

  • quality of service in heterogeneous networks 6th international icst conference on heterogeneous networking for quality reliability security and robustness and telecommunications engineering
    Quality of Service in Heterogeneous Networks: 6th International ICST Conference on Heterogeneous Networking for Quality Reliability Security and Robus, 2009
    Co-Authors: Novella Bartolini, Sotiris Nikoletseas, Prasun Sinha, Valeria Cardellini, Anirban Mahanti
    Abstract:

    This book constitutes the proceedings of two conferences: The 6th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2009) and the 3rd International ICST Workshop on Advanced Architectures and Algorithms for Internet DElivery and Applications (AAA-IDWEA 2009). QShine is a very successfull series of conferences providing an international forum for the discussion and sharing of new research ideas on the design and implementation of Quality of Service (QoS) in heterogeneous wireless and wireline networks. The 19 papers presented at the conference were selected from 40 paper submissions. In addition to this 25 papers from leading researchers working in related fields are presented. The conference is organized in 11 technical sessions covering IP telephony and multiMedia, mesh networks, mobility and heterogeneous wireless networks. AAA-IDEA comprises 7 papers that cover a variety of topics such as architectures and algorithms for content and service delivery, energy-aware networks, QoE in Media Streaming as well as support for mobile and wireless systems.

  • analysis of bittorrent like protocols for on demand stored Media Streaming
    Measurement and Modeling of Computer Systems, 2008
    Co-Authors: Nadim Parvez, Anirban Mahanti, Carey Williamson, Niklas Carlsson
    Abstract:

    This paper develops analytic models that characterize the behavior of on-demand stored Media content delivery using BitTorrent-like protocols. The models capture the effects of different piece selection policies, including Rarest-First and two variants of In-Order. Our models provide insight into transient and steady-state system behavior, and help explain the sluggishness of the system with strict In-Order Streaming. We use the models to compare different retrieval policies across a wide range of system parameters, including peer arrival rate, upload/download bandwidth, and seed residence time. We also provide quantitative results on the startup delays and retrieval times for Streaming Media delivery. Our results provide insights into the optimal design of peer-to-peer networks for on-demand Media Streaming.

  • youtube traffic characterization a view from the edge
    Internet Measurement Conference, 2007
    Co-Authors: Phillipa Gill, Martin Arlitt, Anirban Mahanti
    Abstract:

    This paper presents a traffic characterization study of the popular video sharing service, YouTube. Over a three month period we observed almost 25 million transactions between users on an edge network and YouTube, including more than 600,000 video downloads. We also monitored the globally popular videos over this period of time. In the paper we examine usage patterns, file properties, popularity and referencing characteristics, and transfer behaviors of YouTube, and compare them to traditional Web and Media Streaming workload characteristics. We conclude the paper with a discussion of the implications of the observed characteristics. For example, we find that as with the traditional Web, caching could improve the end user experience, reduce network bandwidth consumption, and reduce the load on YouTube's core server infrastructure. Unlike traditional Web caching, Web 2.0 provides additional meta-data that should be exploited to improve the effectiveness of strategies like caching.

  • scalable on demand Media Streaming with packet loss recovery
    IEEE ACM Transactions on Networking, 2003
    Co-Authors: Anirban Mahanti, Derek L Eager, Mary K Vernon, David Sundaramstukel
    Abstract:

    Previous scalable on-demand Streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: 1) have a tunably short latency for the client to begin playing the Media; 2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and 3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the Media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible Media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the Media play rate have similar performance to previous protocols that require clients to receive at many times the play rate.

  • scalable on demand Media Streaming with packet loss recovery
    ACM Special Interest Group on Data Communication, 2001
    Co-Authors: Anirban Mahanti, Derek L Eager, Mary K Vernon, David Sundaramstukel
    Abstract:

    Inspired by recent techniques for reliable bulk data distribution, this paper develops scalable protocols for reliable on-demand delivery of Streaming Media. Models are developed that quantify the best possible scalability for given client characteristics. The results of the models are used to guide the design and assess the performance of the proposed Streaming techniques. The new protocols, RPB and RBS, are relatively simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible Media quality.

Stephen A Jarvis - One of the best experts on this subject based on the ideXlab platform.

  • a payment based incentive and service differentiation scheme for peer to peer Streaming broadcast
    IEEE Transactions on Parallel and Distributed Systems, 2008
    Co-Authors: Guang Tan, Stephen A Jarvis
    Abstract:

    We propose a novel payment-based incentive scheme for peer-to-peer (P2P) live Media Streaming. Using this approach, peers earn points by forwarding data to others. The data Streaming is divided into fixed-length periods; during each of these periods, peers compete with each other for good parents (data suppliers) for the next period in a first-price-auction-like procedure using their points. We design a distributed algorithm to regulate peer competitions and consider various individual strategies for parent selection from a game-theoretic perspective. We then discuss possible strategies that can be used to maximize a peer's expected Media quality by planning different bids for its substreams. Finally, in order to encourage off-session users to remain online and continue contributing to the network, we develop an optimal data forwarding strategy that allows peers to accumulate points that can be used in future services. Simulation results show that the proposed methods effectively differentiate the Media qualities received by peers making different contributions (which originate from, for example, different forwarding bandwidths or servicing times) and at the same time maintain high overall system performance.

  • a payment based incentive and service differentiation mechanism for peer to peer Streaming broadcast
    International Workshop on Quality of Service, 2006
    Co-Authors: Stephen A Jarvis
    Abstract:

    We proposes a novel payment-based incentive mechanism for peer-to-peer (P2P) live Media Streaming. Using this approach, peers earn points by forwarding data to others; the data Streaming is divided into fixed length periods, during each of which peers compete with each other for good parents (data suppliers) for the next period in a first-price auction like procedure using their points. We design a distributed algorithm to regulate peer competitions, and consider various individual strategies for parent selection from a game theoretic perspective. We then discuss possible strategies that can be used to maximize a peer's expected Media quality by planning different bids for its substreams. Finally, in order to encourage off-session users to keep staying online and continue contributing to the network, we develop an optimal data forwarding strategy that allows peers to accumulate points that can be used in future services. Simulations results show that proposed methods effectively differentiate the Media qualities received by peers making different contributions (which originate from, for example, different forwarding band-widths or servicing times), and at the same time maintaining a high system-wide performance