By Topic

INFOCOM 2008. The 27th Conference on Computer Communications. IEEE

Date 13-18 April 2008

Filter Results

Displaying Results 1 - 25 of 319
  • [Copyright notice]

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Dedication to Jennifer Hou

    Publication Year: 2008, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (176 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • Message from the Technical Chair

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (197 KB)
    Freely Available from IEEE
  • MESSAGE FROM MINI PROGRAM CHAIR

    Publication Year: 2008, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • CONFERENCE ORGANIZING COMMITTEE

    Publication Year: 2008, Page(s):vii - xv
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • Sponsors

    Publication Year: 2008
    Request permission for commercial reuse | PDF file iconPDF (194 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):xvii - li
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • Theoretical Results on Base Station Movement Problem for Sensor Network

    Publication Year: 2008
    Cited by:  Papers (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (229 KB) | HTML iconHTML

    The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network topology and traffic routing), theoretical performance limit and provably optimal algorithms remain difficult to develop. This paper fills this important gap by contributing theoretical results regarding the optimal movement o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic

    Publication Year: 2008
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    We consider the delay properties of one-hop networks with general interference constraints and multiple traffic streams with time-correlated arrivals. We first treat the case when arrivals are modulated by independent finite state Markov chains. We show that the well known maximal scheduling algorithm achieves average delay that grows at most logarithmically in the largest number of interferers at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links

    Publication Year: 2008
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB) | HTML iconHTML

    We study connectivity and transmission latency in wireless networks with unreliable links from a percolation-based perspective. We first examine static models, where each link of the network is functional (active) with some probability, independently of all other links, where the probability may depend on the distance between the two nodes. We obtain analytical upper and lower bounds on the critic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Speed of Information Propagation in Large Wireless Networks

    Publication Year: 2008
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    This paper investigates the speed limit of information propagation in large wireless networks, which provides fundamental understanding of the fastest information transportation and delivery that a wireless network is able to accommodate. We show that there is a unified speed upper bound for broadcast and unicast communications in large wireless networks. When network connectivity and successful p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Quasi-Likelihood Approach for Accurate Traffic Matrix Estimation in a High Speed Network

    Publication Year: 2008
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB) | HTML iconHTML

    Knowing the traffic matrix, i.e., packet/byte counts between pairs of nodes in a network, is important for network management. The main challenges for accurate traffic matrix estimation in a high speed network are the computation and memory limitations. In this paper, we propose a novel algorithm for traffic matrix estimation that can yield accurate estimates whereas uses small memory and per pack... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accurate and Efficient Traffic Monitoring Using Adaptive Non-Linear Sampling Method

    Publication Year: 2008
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    Sampling technology has been widely deployed in measurement systems to control memory consumption and processing overhead. However, most of the existing sampling methods suffer from large estimation errors in analyzing small-size flows. To address the problem, we propose a novel adaptive non-linear sampling (ANLS) method for passive measurement. Instead of statically configuring the sampling rate,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo King: Framework for Large-Scale Internet Delay Measurements

    Publication Year: 2008
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Distance estimation and topological proximity in the Internet have recently emerged as important problems for many distributed applications [1], [10], [11], [19], [29], [31], [40], [41], [44]. Besides deploying tracers and using virtual coordinates, distance is often estimated using end-to-end methods such as King [13] that rely on the existing DNS infrastructure. However, the question of accuracy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Routing Topology Inference from End-to-End Measurements

    Publication Year: 2008
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In this paper we propose a general framework for designing topology inference algorithms based on additive metrics. Our framework allows the integration of both end-to-end packet probing measurements and traceroute type measurements. Bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attack-Tolerant Time-Synchronization in Wireless Sensor Networks

    Publication Year: 2008
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Achieving secure time-synchronization in wireless sensor networks (WSNs) is a challenging, but very important problem that has not yet been addressed effectively. This paper proposes an attack-tolerant time-synchronization protocol (ATSP) in which sensor nodes cooperate to safeguard the time- synchronization service against malicious attacks. ATSP exploits the high temporal correlation existing am... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verifiable Privacy-Preserving Range Query in Two-Tiered Sensor Networks

    Publication Year: 2008
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    We consider a sensor network that is not fully trusted and ask the question how we preserve privacy for the collected data and how we verify the data reply from the network. We explore the problem in the context of a network augmented with storage nodes and target at range query. We use bucketing scheme to mix the data for a range, use message encryption for data integrity, and employ encoding num... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Statistically Strong Source Anonymity for Sensor Networks

    Publication Year: 2008
    Cited by:  Papers (80)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    For sensor networks deployed to monitor and report real events, event source anonymity is an attractive and critical security property, which unfortunately is also very difficult and expensive to achieve. This is not only because adversaries may attack against sensor source privacy through traffic analysis, but also because sensor networks are very limited in resources. As such, a practical tradeo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Confidentiality Protection for Distributed Sensor Data Aggregation

    Publication Year: 2008
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    Efficiency and security are two basic requirements for sensor network design. However, these requirements could be sharply contrary to each other in some scenarios. For example, in- network data aggregation can significantly reduce communication overhead and thus has been adopted widely as a means to improve network efficiency; however, the adoption of in-network data aggregation may prevent data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Feasibility of the Link Abstraction in (Rural) Mesh Networks

    Publication Year: 2008
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB) | HTML iconHTML

    Outdoor community mesh networks based on 802.11 have seen tremendous growth in the recent past. The current understanding is that wireless link performance in these settings in inherently unpredictable, due to multipath delay spread. Consequently, researchers have focused on developing intelligent routing techniques to achieve the best possible performance. In this paper, we are specifically inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iPack: in-Network Packet Mixing for High Throughput Wireless Mesh Networks

    Publication Year: 2008
    Cited by:  Papers (14)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (326 KB) | HTML iconHTML

    A major barrier for the adoption of wireless mesh networks is severe limits on throughput. Many in-network packet mixing techniques at the network layer [1], [2], [3] as well as the physical layer [4], [5], [6] have been shown to substantially improve throughput. However, the optimal mixing algorithm that maximizes throughput is still unknown. In this paper, we propose iPack, an algorithm for in-n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating Traffic Estimation and Routing Optimization for Multi-Radio Multi-Channel Wireless Mesh Networks

    Publication Year: 2008
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Measurement Study of Multiplicative Overhead Effects in Wireless Networks

    Publication Year: 2008
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (935 KB) | HTML iconHTML

    In this paper, we perform an extensive measurement study on a multi-tier mesh network serving 4,000 users. Such dense mesh deployments have high levels of interaction across heterogeneous wireless links. We find that this heterogeneous backhaul consisting of data-carrying (forwarding) links and non- data-carrying (non-forwarding) links creates two key effects on performance. First, we show ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding

    Publication Year: 2008
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization of network coding, we formulate the problem as a convex optimization problem. The formulation exploits pairwise coding possibilities between any pair of sessions, where the objective function is the sum of the utilities based... View full abstract»

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