By Topic

19-25 April 2009

Filter Results

Displaying Results 1 - 25 of 389
  • [Title page]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • General Chairs message

    Publication Year: 2009, Page(s):iii - v
    Request permission for commercial reuse | PDF file iconPDF (1960 KB)
    Freely Available from IEEE
  • Message from Technical Co-Chairs

    Publication Year: 2009, Page(s):vi - viii
    Request permission for commercial reuse | PDF file iconPDF (613 KB)
    Freely Available from IEEE
  • Message from the Miniconference Chairs

    Publication Year: 2009, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (1093 KB)
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2009, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (122 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2009, Page(s):xii - xx
    Request permission for commercial reuse | PDF file iconPDF (126 KB)
    Freely Available from IEEE
  • TPC Committee

    Publication Year: 2009, Page(s): xxi
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2009, Page(s):xxii - xxix
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2009, Page(s):xxx - xxxiv
    Request permission for commercial reuse | PDF file iconPDF (1113 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):xxxv - lii
    Request permission for commercial reuse | PDF file iconPDF (198 KB)
    Freely Available from IEEE
  • RAPID: Shrinking the Congestion-Control Timescale

    Publication Year: 2009, Page(s):1 - 9
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (577 KB) | HTML iconHTML

    TCP congestion-control is fairly inefficient in achieving high throughput in high-speed and dynamic-bandwidth environments. The main culprit is the slow bandwidth-search process used by TCP, which may take up to several thousands of round-trip times (RTTs) in searching for and acquiring the end-to-end spare bandwidth. Even the recently-proposed "highspeed" transport protocols may take hundreds of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congestion Control using Efficient Explicit Feedback

    Publication Year: 2009, Page(s):10 - 18
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    This paper proposes a framework for congestion control, called binary marking congestion control (BMCC) for high bandwidth-delay product networks. The basic components of BMCC are i) a packet marking scheme for obtaining high resolution congestion estimates using the existing bits available in the IP header for explicit congestion notification (ECN) and ii) a set of load-dependent control laws tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Analysis of Scalable TCP

    Publication Year: 2009, Page(s):19 - 27
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    The unsatisfactory performance of TCP in high speed wide area networks has led to several versions of TCP- like H-TCP, Fast TCP, Scalable TCP, Compound or CUBIC, all aimed at speeding up the window update algorithm. In this paper we focus on Scalable TCP (STCP), a TCP version which belongs to the class of Multiplicative Increase Multiplicative Decrease (MIMD) congestion protocols. We present a new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is the ''Law of the Jungle'' Sustainable for the Internet?

    Publication Year: 2009, Page(s):28 - 36
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    In this paper we seek to characterize the behavior of the Internet in the absence of congestion control. More specifically, we assume all sources transmit at their maximum rate and recover from packet loss by the use of some ideal erasure coding scheme. We estimate the efficiency of resource utilization in terms of the maximum load the network can sustain, accounting for the random nature of traff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multirate Anypath Routing in Wireless Mesh Networks

    Publication Year: 2009, Page(s):37 - 45
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks

    Publication Year: 2009, Page(s):46 - 54
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (394 KB) | HTML iconHTML

    This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous efforts, the new EED metric takes the queuing delay into account, since the end-to-end delay consists of not only the transmission delay over the wireless links but also the queuing delay in the buffer. In addition to minimizi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Leveraging Partial Paths in Partially-Connected Networks

    Publication Year: 2009, Page(s):55 - 63
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad hoc networks), or it is close to zero, assuming no multi-hop paths exist at all (delay-tolerant networks). In this paper, we argue that a sizable fraction of net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing

    Publication Year: 2009, Page(s):64 - 72
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a geographic routing protocol may produce unexpected results, such as geographic routing loops and unreachable nodes. In this paper, we propose a novel routing algebra system to investigate the compatibilities between routing metrics... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queuing Network Models for Multi-Channel P2P Live Streaming Systems

    Publication Year: 2009, Page(s):73 - 81
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (206 KB) | HTML iconHTML

    In recent years there have been several large-scale deployments of P2P live video systems. Existing and future P2P live video systems will offer a large number of channels, with users switching frequently among the channels. In this paper, we develop infinite-server queueing network models to analytically study the performance of multi-channel P2P streaming systems. Our models capture essential as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distilling Superior Peers in Large-Scale P2P Streaming Systems

    Publication Year: 2009, Page(s):82 - 90
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB) | HTML iconHTML

    In large-scale peer-to-peer (P2P) live streaming systems with a limited supply of server bandwidth, increasing the amount of upload bandwidth supplied by peers becomes critically important to the "well being" of streaming sessions in live channels. Intuitively, two types of peers are preferred to be kept up in a live session: peers that contribute a higher percentage of their upload capacities, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CPM: Adaptive Video-on-Demand with Cooperative Peer Assists and Multicast

    Publication Year: 2009, Page(s):91 - 99
    Cited by:  Papers (29)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (187 KB) | HTML iconHTML

    We present CPM, a unified approach that exploits server multicast, assisted by peer downloads, to provide efficient video-on-demand (VoD) in a service provider environment. We describe our architecture and show how CPM is designed to dynamically adapt to a wide range of situations including highly different peer-upload bandwidths, content popularity, user request arrival patterns, video library si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P2P-TV Systems under Adverse Network Conditions: A Measurement Study

    Publication Year: 2009, Page(s):100 - 108
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (662 KB) | HTML iconHTML

    In this paper we define a simple experimental setup to analyze the behavior of commercial P2P-TV applications under adverse network conditions. Our goal is to reveal the ability of different P2P-TV applications to adapt to dynamically changing conditions, such as delay, loss and available capacity, e.g., checking whether such systems implement some form of congestion control. We apply our methodol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surface Coverage in Wireless Sensor Networks

    Publication Year: 2009, Page(s):109 - 117
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. The 3D surface of a targeted Field of Interest is complex in many real world applications; and yet, existing studies on coverage do not produce practical results. In this paper, we propose a new coverage model called surface coverage. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks

    Publication Year: 2009, Page(s):118 - 126
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (754 KB) | HTML iconHTML

    We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may gradually lose their positions; leaving the points of interest uncovered. Manual readjustment is costly and cannot be performed in time. We argue that a network of mobile sensor nodes which can perform self-adjustment is the best cand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.