DOCSLIB.ORG

Scalable Compression and Transmission of Internet Multicast Video

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Scalable Compression and Transmission of Internet Multicast Video Scalable Compression and Transmission of Internet Multicast Video Steven Ray McCanne Report No. UCB/CSD-96-928 December 16, 1996 Computer Science Division (EECS) University of California Berkeley, California 94720 Scalable Compression and Transmission of Internet Multicast Video by Steven Ray McCanne B.S. (University of California, Berkeley) 1990 A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in the GRADUATE DIVISION of the UNIVERSITY of CALIFORNIA at BERKELEY Committee in charge: Professor Martin Vetterli, Chair Professor Domenico Ferrari Professor Jim Pitman 1996 Scalable Compression and Transmission of Internet Multicast Video Copyright 1996 by Steven Ray McCanne 1 Abstract Scalable Compression and Transmission of Internet Multicast Video by Steven Ray McCanne Doctor of Philosophy in Computer Science University of California at Berkeley Professor Martin Vetterli, Chair In just a few years the ªInternet Multicast Backboneº, or MBone, has risen from a small, research curios- ity to a large scale and widely used communications infrastructure. A driving force behind this growth was our development of multipoint audio, video, and shared whiteboard conferencing applications that are now used daily by the large and growing MBone community. Because these real-time media are transmitted at a uniform rate to all the receivers in the network, the source must either run below the bottleneck rate or over- load portions of the multicast distribution tree. In this dissertation, we propose a solution to this problem by moving the burden of rate-adaptation from the source to the receivers with a scheme we call Receiver-driven Layered Multicast, or RLM. In RLM, a source distributes a hierarchical signal by striping the constituent lay- ers across multiple multicast groups. Receivers then adjust their reception rate by simply joining and leaving multicast groups. But RLM solves only half of the problem. To distribute a multi-rate ¯ow to heterogeneous receivers using RLM, the underlying signal must be encoded in a hierarchical or layered format. To this end, we devel- oped and present herein a layered video compression algorithm which, when combined with RLM, provides a comprehensive solution for scalable multicast video transmission in heterogeneous networks. In addition to a layered representation, our coder has low-complexity (admitting an ef®cient software implementation) and high error resilience (admitting robust operation in loosely controlled environments like the Internet). Even with these constraints, our hybrid DCT/wavelet-based coder, which we call ªProgressive Video with Hybrid transformº or PVH, exhibits good compression performance Ð comparable to wavelet zerotree cod- ing (i.e., EZW) at low rates and near the performance of traditional DCT-based schemes at high rates. As well, it outperforms all (publicly available) Internet video codecs while achieving comparable run-time per- formance. Our RLM/PVH framework leverages two design methodologies from two related yet often seg- regated ®elds: joint source/channel coding (JSCC) from traditional communications theory and application level framing (ALF) from computer network design. In accordance with JSCC, we combine the design of the source-coding algorithm (i.e., PVH) with the channel-coding algorithm (i.e., RLM), while in accordance with ALF, we re¯ect application semantics (i.e., PVH) in the design of the network protocol (i.e., RLM). In this thesis, we posit that JSCC and ALF are two manifestations of the same underlying design principle. We explore the ALF/JSCC design space with a discussion of our ªIntra-H.261º video coder, which we developed speci®cally for MBone video transmission, and compare its performance to that of traditional designs based on independent source- and channel-coding. Finally, we bring all of the pieces of our design together into a comprehensive system architec- ture realized in a ¯exible software toolkit that underlies our widely used video application Ð the UCB/LBL 2 video conferencing tool vic. Our system architecture not only integrates RLM and PVH into an autonomous video application but also provides the functionality requisite to a complete multimedia communication sys- tem, including user-interface elements and companion applications like audio and shared whiteboard. In this framework, we craft ªmedia agentsº from a common multimedia toolkit and control and con®gure them over a software interprocess communication bus that we call the Coordination Bus. By composing an arbitrary arrangement of media agents over the Coordination Bus and complementing the arrangement with an ap- propriate user-interface, we can induce an arbitrary multimedia collaboration style. Unlike previous work on layered video compression and transmission, we have implemented RLM, PVH, and our coordination framework in a ªrealº application and are deploying a fully operational system on a very large scale over the MBone. iii To my wife Deana McCanne, who gives me reason, meaning, and wholeness. iv Contents List of Figures viii List of Tables x 1 Introduction 1 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.1 History and Motivation: The MBone : 2 : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 The Problem: Network Heterogeneity : 7 : : : : : : : : : : : : : : : : : : : : 1.3 A Solution: Layered Compression and Transmission : 7 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.3.1 Layered Compression : 8 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.3.2 Layered Transmission : 10 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.4 Contributions : 11 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.5 Dissertation Overview : 13 2 Related Work 14 : : : : : : : : : : : : : : : : : : : : : : : : : 2.1 Packet Video Transmission: An Overview : 14 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.1 Circuit-switched Networks : 15 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.2 Packet-switched Networks : 16 : : : : : : : : : : : : : : : : : : : : : : : 2.1.3 Congestion Control for Packet Video : 17 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.4 Congestion Accommodation : 17 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.5 Integrated Services : 18 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.6 Encompassing Multicast : 19 : : : : : : : : : : : : : : : : : : : : : : 2.1.7 Network-assisted Bandwidth Adaptation : 21 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.8 Receiver-based Schemes : 23 : : : : : : : : : : : : : : : : : : : : : : : : : : 2.1.9 Summary of Packet Video Work : 25 : : : : : : : : : : : : : : : : : : : : : : : : 2.2 Layered Video Compression: An Overview : 25 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.2.1 Layered DCT : 25 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.2.2 Pyramid Coding : 27 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.2.3 Subband Image Coding : 29 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.2.4 Subband Video Coding : 34 : : : : : : : : : : : : : : : : : : : : : : : : : 2.2.5 Summary of Layered Video Work : 35 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3 Internet Video: An Overview : 35 : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.1 Xerox PARC Network Video : 35 : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.2 INRIA Videoconferencing System : 36 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.3 CU-SeeMe : 37 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.4 Streaming Video : 37 v : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.5 Digital Media Toolkits : 37 : : : : : : : : : : : : : : : : : : : : : : : : : 2.3.6 Summary of Internet Video Work : 38 3 The Network Model 39 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.1 The Internet Protocol : 40 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.2 IP Multicast : 40 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.2.1 Group Maintenance : 41 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.2.2 Multicast Scope : 42 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.3 Orthogonality of Routing : 43 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.4 Lightweight Sessions : 44 : : : : : : : : : : : : : : : : : : : : : : : : : 3.4.1 The Real-time Transport Protocol : 45 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.5 Multiple Multicast Groups : 46 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.6 Packet Scheduling : 47 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.6.1 Random Drop : 47 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.6.2 Priority Drop : 47 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.6.3 Random Early Detection : 48 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.6.4 Fairness : 48 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3.7 Summary : 49 4 Joint Design across Network and Application 51 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4.1 The Separation Principle : 52 :
Load more

Recommended publications
  • A Remote Lecturing System Using Multicast Addressing
    MTEACH: A REMOTE LECTURING SYSTEM USING MULTICAST ADDRESSING A Thesis Submitted to the Faculty of Purdue University by Vladimir Kljaji In Partial Fulfillment of the Requirements for the Degree of Master of Science in Electrical Engineering August 1997 - ii - For my family, friends and May. Thank you for your support, help and your love. - iii - ACKNOWLEDGMENTS I would like to express my gratitude to Professor Edward Delp for being my major advisor, for his guidance throughout the course of this work and especially for his time. This work could not have been done without his support. I would also like to thank Pro- fessor Edward Coyle and Professor Michael Zoltowski for their time and for being on my advisory committee. - iv - TABLE OF CONTENTS Page LIST OF TABLES .......................................................................................................viii LIST OF FIGURES........................................................................................................ix LIST OF ABBREVIATIONS.........................................................................................xi ABSTRACT.................................................................................................................xiii 1. INTRODUCTION...................................................................................................1 1.1 Review of Teleconferencing and Remote Lecturing Systems ...............................1 1.2 Motivation ...........................................................................................................2
    [Show full text]
  • SIP Architecture
    383_NTRL_VoIP_08.qxd 7/31/06 4:34 PM Page 345 Chapter 8 SIP Architecture Solutions in this chapter: ■ Understanding SIP ■ SIP Functions and Features ■ SIP Architecture ■ Instant Messaging and SIMPLE Summary Solutions Fast Track Frequently Asked Questions 345 383_NTRL_VoIP_08.qxd 7/31/06 4:34 PM Page 346 346 Chapter 8 • SIP Architecture Introduction As the Internet became more popular in the 1990s, network programs that allowed communication with other Internet users also became more common. Over the years, a need was seen for a standard protocol that could allow participants in a chat, videoconference, interactive gaming, or other media to initiate user sessions with one another. In other words, a standard set of rules and services was needed that defined how computers would connect to one another so that they could share media and communicate.The Session Initiation Protocol (SIP) was developed to set up, maintain, and tear down these sessions between computers. By working in conjunction with a variety of other protocols and special- ized servers, SIP provides a number of important functions that are necessary in allowing communications between participants. SIP provides methods of sharing the location and availability of users and explains the capabilities of the software or device being used. SIP then makes it possible to set up and manage the session between the parties. Without these tasks being performed, communication over a large network like the Internet would be impossible. It would be like a message in a bottle being thrown in the ocean; you would have no way of knowing how to reach someone directly or whether the person even could receive the message.
    [Show full text]
  • Rendezvous Search with Revealed Information: Applications to the Line
    J. Appl. Prob. 44, 1–15 (2007) Printed in England © Applied Probability Trust 2007 RENDEZVOUS SEARCH WITH REVEALED INFORMATION: APPLICATIONS TO THE LINE STEVE ALPERN,∗ London School of Economics Abstract The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’of Q. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezvous times of giving the players some information about past actions and chance moves, enabling each of them to apply Bayesian updates to improve his knowledge of the other’s whereabouts. This technique can be used to give lower bounds on the rendezvous times of the original game (without any revealed information). We consider the case in which they are placed a known distance apart on the line graph Q (known as ‘symmetric rendezvous on the line’). Our approach is to concentrate on a general analysis of the effect of revelations, rather than compute the best bounds possible with our technique. Keywords: Rendezvous; search; common interest game; team theory 2000 Mathematics Subject Classification: Primary 90B40 1. Introduction In this paper we consider how the revelation of information can affect an important unsolved problem in rendezvous theory: the symmetric rendezvous problem on the line or line graph (whose nodes are the integers, Z) posed in [1], dubbed . (In fact, given the recent solution by Weber [14] of the symmetric rendezvous problem on the complete graph K3,is arguably the main unsolved problem.) The problem begins with a chance move α, called the initial configuration.
    [Show full text]
  • Replication Strategies for Streaming Media
    “replication-strategies” — 2007/4/24 — 10:56 — page 1 — #1 Research Report No. 2007:03 Replication Strategies for Streaming Media David Erman Department of Telecommunication Systems, School of Engineering, Blekinge Institute of Technology, S–371 79 Karlskrona, Sweden “replication-strategies” — 2007/4/24 — 10:56 — page 2 — #2 °c 2007 by David Erman. All rights reserved. Blekinge Institute of Technology Research Report No. 2007:03 ISSN 1103-1581 Published 2007. Printed by Kaserntryckeriet AB. Karlskrona 2007, Sweden. This publication was typeset using LATEX. “replication-strategies” — 2007/4/24 — 10:56 — page i — #3 Abstract Large-scale, real-time multimedia distribution over the Internet has been the subject of research for a substantial amount of time. A large number of mechanisms, policies, methods and schemes have been proposed for media coding, scheduling and distribution. Internet Protocol (IP) multicast was expected to be the primary transport mechanism for this, though it was never deployed to the expected extent. Recent developments in overlay networks has reactualized the research on multicast, with the consequence that many of the previous mechanisms and schemes are being re-evaluated. This report provides a brief overview of several important techniques for media broad- casting and stream merging, as well as a discussion of traditional IP multicast and overlay multicast. Additionally, we present a proposal for a new distribution system, based on the broadcast and stream merging algorithms in the BitTorrent distribution and repli- cation system. “replication-strategies” — 2007/4/24 — 10:56 — page ii — #4 ii “replication-strategies” — 2007/4/24 — 10:56 — page iii — #5 CONTENTS Contents 1 Introduction 1 1.1 Motivation .
    [Show full text]
  • The Dos and Don'ts of Videoconferencing in Higher
    The Dos and Don’ts of Videoconferencing in Higher Education HUSAT Research Institute Loughborough University of Technology Lindsey Butters Anne Clarke Tim Hewson Sue Pomfrett Contents Acknowledgements .................................................................................................................1 Introduction .............................................................................................................................3 How to use this report ..............................................................................................................3 Chapter 1 Videoconferencing in Higher Education — How to get it right ...................................5 Structure of this chapter ...............................................................................................5 Part 1 — Subject sections ............................................................................................6 Uses of videoconferencing, videoconferencing systems, the environment, funding, management Part 2 — Where are you now? ......................................................................................17 Guidance to individual users or service providers Chapter 2 Videoconferencing Services — What is Available .....................................................30 Structure of this chapter ...............................................................................................30 Overview of currently available services .......................................................................30 Broadcasting
    [Show full text]
  • Mbone Provides Audio and Video Across the Internet
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Calhoun, Institutional Archive of the Naval Postgraduate School Calhoun: The NPS Institutional Archive Faculty and Researcher Publications Faculty and Researcher Publications 1994-04 MBone Provides Audio and Video Across the Internet Macedonia, Michael R. http://hdl.handle.net/10945/40136 MBone Provides Audio and Video Across the Internet Michael R. Macedonia and Donald P. Brutzman Naval Postgraduate School he joy of science is in the discovery. In March 1993, our group at the Naval Postgraduate School heard that the Jason Project, an underwater explo­ ration and educational program supported by Woods Hole Oceanographic IIInstitution in Massachusetts, was showing live video over the Internet from an under­ water robot in waters off Baja, Mexico. We worked furiously to figure out how to re­ ceive that video signal, laboring diligently to gather the right equipment, contact the appropriate network managers, and obtain hardware permissions from local bu­ reaucrats. After several days of effort, we learned that a satellite antenna uplink ca­ ble on the Jason support ship had become flooded with seawater a few hours before we became operational. Despite this disappointment, we remained enthusiastic because, during our ef­ forts, we discovered how to use the Internet's most unique network, MBone. Short for Multicast Backbone, 1 MBone is a virtual network that has been in existence since early 1992. It was named by Steve Casner1 of the University of Southern California Information Sciences Institute and originated from an effort to multicast audio and video from meetings of the Internet Engineering Task Force.
    [Show full text]
  • Optimal Symmetric Rendezvous Search on Three Locations
    Optimal Symmetric Rendezvous Search on Three Locations Richard Weber Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB2 0WB email: [email protected] www.statslab.cam.ac.uk/~rrw1 In the symmetric rendezvous search game played on n locations two players are initially placed at two distinct locations. The game is played in discrete steps, at each of which each player can either stay where he is or move to a different location. The players share no common labelling of the locations. We wish to find a strategy such that, if both players follow it independently, then the expected number of steps until they are in the same location is minimized. Informal versions of the rendezvous problem have received considerable attention in the popular press. The problem was proposed by Steve Alpern in 1976 and it has proved notoriously difficult to analyse. In this paper we prove a 20 year old conjecture that the following strategy is optimal for the game on three locations: in each block of two steps, stay where you, or search the other two locations in random order, doing these with probabilities 1=3 and 2=3 respectively. This is now the first nontrivial symmetric rendezvous search game to be fully solved. Key words: rendezvous search; search games; semidefinite programming MSC2000 Subject Classification: Primary: 90B40; Secondary: 49N75, 90C22, 91A12, 93A14 OR/MS subject classification: Primary: Games/group decisions, cooperative; Secondary: Analysis of algorithms; Programming, quadratic 1. Symmetric rendezvous search on three locations In the symmetric rendezvous search game played on n locations two players are initially placed at two distinct locations.
    [Show full text]
  • Algorithm Design and Analysis in Wireless Networks Lin Chen
    Algorithm design and analysis in wireless networks Lin Chen To cite this version: Lin Chen. Algorithm design and analysis in wireless networks. Data Structures and Algorithms [cs.DS]. Paris-Sud XI, 2017. tel-01688436 HAL Id: tel-01688436 https://hal.archives-ouvertes.fr/tel-01688436 Submitted on 24 Jan 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Algorithm Design and Analysis in Wireless Networks Habilitation Thesis Lin CHEN Laboratoire de Recherche en Informatique (UMR 8623) Université Paris-Sud Defended on July 11, 2017 Committee M. Tamer BASAR Reviewer M. Pierre FRAIGNIAUD Reviewer M. Bruno GAUJAL Reviewer M. Eitan ALTMAN Examiner M. Joffroy BEAUQUIER Examiner Mme. Johanne COHEN Examiner M. Mérouane DEBBAH Examiner M. Fabio MARTIGNON Examiner Abstract Algorithms are perhaps the most fundamental and fascinating elements in computer science as a whole. Networks and networked systems are no exception. This habilitation thesis summarizes my research during the last eight years on some algorithmic problems of both fundamental and practical importance in modern networks and networked systems, more specifically, wireless net- works. Generically, wireless networks have a number of common features which form a common ground on which algorithms for wireless networks are designed.
    [Show full text]
  • THE THEORY of SEARCH GAMES and RENDEZVOUS INTERNATIONAL SERIES in OPERATIONS RESEARCH & MANAGEMENT SCIENCE Frederick S
    THE THEORY OF SEARCH GAMES AND RENDEZVOUS INTERNATIONAL SERIES IN OPERATIONS RESEARCH & MANAGEMENT SCIENCE Frederick S. Hillier, Series Editor Stanford University Weyant, J./ ENERGY AND ENVIRONMENTAL POLICY MODELING Shanthikumar, J.G. & Sumita, U. / APPLIED PROBABILITY AND STOCHASTIC PROCESSES Liu, B. & Esogbue, A.O. / DECISION CRITERIA AND OPTIMAL INVENTORY PROCESSES Gal, T., Stewart, T.J., Hanne, T. / MULTICRITERIA DECISION MAKING: Advances in MCDM Models, Algorithms, Theory, and Applications Fox, B.L. / STRATEGIES FOR QUASI-MONTE CARLO Hall, R.W. / HANDBOOK OF TRANSPORTATION SCIENCE Grassman, W.K. / COMPUTATIONAL PROBABILITY Pomerol, J-C. & Barba-Romero, S. / MULTICRITERION DECISION IN MANAGEMENT Axsäter, S./ INVENTORY CONTROL Wolkowicz, H., Saigal, R., & Vandenberghe, L. / HANDBOOK OF SEMI-DEFINITE PROGRAMMING: Theory, Algorithms, and Applications Hobbs, B.F. & Meier, P. / ENERGY DECISIONS AND THE ENVIRONMENT: A Guide to the Use of Multicriteria Methods Dar-El, E. / HUMAN LEARNING: From Learning Curves to Learning Organizations Armstrong, J.S. / PRINCIPLES OF FORECASTING: A Handbook for Researchers and Practitioners Balsamo, S., Personé, V., & Onvural, R./ ANALYSIS OF QUEUEING NETWORKS WITH BLOCKING Bouyssou, D. et al. / EVALUATION AND DECISION MODELS: A Critical Perspective Hanne, T. / INTELLIGENT STRATEGIES FOR META MULTIPLE CRITERIA DECISION MAKING Saaty, T. & Vargas, L. / MODELS, METHODS, CONCEPTS and APPLICATIONS OF THE ANALYTIC HIERARCHY PROCESS Chatterjee, K. & Samuelson, W. / GAME THEORY AND BUSINESS APPLICATIONS Hobbs, B. et al. / THE NEXT GENERATION OF ELECTRIC POWER UNIT COMMITMENT MODELS Vanderbei, R.J. / LINEAR PROGRAMMING: Foundations and Extensions, 2nd Ed. Kimms, A. / MATHEMATICAL PROGRAMMING AND FINANCIAL OBJECTIVES FOR SCHEDULING PROJECTS Baptiste, P., Le Pape, C. & Nuijten, W. / CONSTRAINT-BASED SCHEDULING Feinberg, E. & Shwartz, A.
    [Show full text]
  • Download Book
    Lecture Notes in Computer Science 3279 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany Geoffrey M. Voelker Scott Shenker (Eds.) Peer-to-Peer Systems III Third International Workshop, IPTPS 2004 La Jolla, CA, USA, February 26-27, 2004 Revised Selected Papers 13 Volume Editors Geoffrey M. Voelker University of California, San Diego Department of Computer Science and Engineering 9500 Gilman Dr., MC 0114, La Jolla, CA 92093-0114, USA E-mail: [email protected] Scott Shenker University of California, Berkeley Computer Science Division, EECS Department 683 Soda Hall, 1776, Berkeley, CA 94720, USA E-mail: [email protected] Library of Congress Control Number: Applied for CR Subject Classification (1998): C.2.4, C.2, H.3, H.4, D.4, F.2.2, E.1, D.2 ISSN 0302-9743 ISBN 3-540-24252-X Springer Berlin Heidelberg New York This work is subject to copyright.
    [Show full text]
  • Multicast Redux: a First Look at Enterprise Multicast Traffic
    Multicast Redux: A First Look at Enterprise Multicast Traffic Elliott Karpilovsky Lee Breslau Princeton University AT&T Labs – Research [email protected] [email protected] Alexandre Gerber Subhabrata Sen AT&T Labs – Research AT&T Labs – Research [email protected] [email protected] ABSTRACT 1. INTRODUCTION IP multicast, after spending much of the last 20 years as IP multicast [1, 2], which provides an e±cient mechanism the subject of research papers, protocol design e®orts and for the delivery of the same data from a single source to limited experimental usage, is ¯nally seeing signi¯cant de- multiple receivers, was ¯rst proposed more than two decades ployment in production networks. The e±ciency a®orded ago. It was deployed experimentally on the MBone [3] in the by one-to-many network layer distribution is well-suited to early 1990s and was the subject of a signi¯cant amount of re- such emerging applications as IPTV, ¯le distribution, con- search into scalable and robust intra- and inter-domain rout- ferencing, and the dissemination of ¯nancial trading infor- ing protocols [4, 5, 6]. The MBone, an overlay used primarily mation. However, it is important to understand the behavior to support audio and video conferencing between multicast- of these applications in order to see if network protocols are capable networks around the Internet, grew rapidly. How- appropriately supporting them. In this paper we undertake ever, the initial enthusiasm for multicast did not translate a study of enterprise multicast tra±c as observed from the into widespread success. The MBone eventually declined, vantage point of a large VPN service provider.
    [Show full text]
  • Study and Development of Power Control Schemes Within a Cognitive Radio-Based Game Theoretic Framework
    Aalborg Universitet (AAU) Institut for Elektroniske Systemer Study and Development of Power Control Schemes within a Cognitive Radio-based Game Theoretic Framework by Author: V´ıctor Alvarez´ Roig Advisors: Andrea Fabio Cattoni, Gustavo Wagner Oliveira da Costa Aalborg, April 2010 “Before anything else, preparation is the key to success” Alexander Graham Bell (1847-1922) Aalborg Universitet (AAU) Abstract Institut for Elektroniske Systemer Radio Access Technology by Author: V´ıctor Alvarez´ Roig The requirements of the International Telecommunication Union (ITU) for the 4th generation of mobile devices raised up to 100 Mbps for high and 1Gbps for low mobility conditions. Reaching such challenging targets requires the deployment of picocells and femtocells. These techniques permit to achieve large cell capacity but also lead to difficulties in terms of interference. The GRACE algorithm, based on Cognitive Radio and Game Theory, has shown a fair balance between cell capacity and outage as well as short convergence time, low complexity and easy scalability. The aim of this work is to find an efficient power control algorithm that fits GRACE these goals. Therefore, a study of Cognitive Radio, Game Theory and Power Control algorithms is developed and a new power control algorithm is proposed. The simulation results show that the Fractional Power Control can increase notably the outage performance and the energy saving to the mobile devices. Acknowledgements I would like to start thanking the Aalborg University for the opportunity to perform my Master’s Thesis here in Danmark and also to Nokia Siemens Networks for their facilities and economical support. I want to thank my supervisors Andrea and Gustavo for their advice and support during this time.
    [Show full text]