By Topic

Network Protocols, 2005. ICNP 2005. 13th IEEE International Conference on

Date 6-9 Nov. 2005

Filter Results

Displaying Results 1 - 25 of 45
  • 13th IEEE International Conference on Network Protocols

    Publication Year: 2005 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (99 KB)  
    Freely Available from IEEE
  • 13TH IEEE International Conference on Network Protocols - Title Page

    Publication Year: 2005 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (385 KB)  
    Freely Available from IEEE
  • 13TH IEEE International Conference on Network Protocols - Copyright

    Publication Year: 2005 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (85 KB)  
    Freely Available from IEEE
  • 13TH IEEE International Conference on Network Protocols - Table of contents

    Publication Year: 2005 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (115 KB)  
    Freely Available from IEEE
  • Message from the General Co-Chairs

    Publication Year: 2005 , Page(s): ix - x
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Technical Committee Co-chairs

    Publication Year: 2005 , Page(s): xi - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (75 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Committees

    Publication Year: 2005 , Page(s): xiii - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2005 , Page(s): xv
    Save to Project icon | Request Permissions | PDF file iconPDF (19 KB)  
    Freely Available from IEEE
  • Expected convergence properties of BGP

    Publication Year: 2005 , Page(s): 13 pp. - 15
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (386 KB) |  | HTML iconHTML  

    Border gateway protocol (BGP) is the de facto standard used for interdomain routing. Since packet forwarding may not be possible until stable routes are learned, it is not only critical for BGP to converge but it is important that the convergence be rapid. The distributed and asynchronous nature of BGP in conjunction with local policies makes it difficult to analyze with respect to convergence beh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stable egress route selection for interdomain traffic engineering: model and analysis

    Publication Year: 2005 , Page(s): 14 pp. - 29
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (419 KB) |  | HTML iconHTML  

    We present a general model of interdomain route selection to study interdomain traffic engineering. In this model, the routing of multiple destinations can be coordinated. Thus the model can capture general traffic engineering behaviors such as load balancing and link capacity constraints. We first identify potential routing instability and inefficiency of interdomain traffic engineering. We then ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On understanding of transient interdomain routing failures

    Publication Year: 2005
    Cited by:  Papers (5)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes. Yet, routing behavior during BGP route convergence is poorly understood. BGP can experience transient loss of reachability during route convergence. We refer to this transient loss of reachability during route convergence as transient routing failure. Transient routing failures can lead to end-to-end for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the stability of rational, heterogeneous interdomain route selection

    Publication Year: 2005
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (344 KB) |  | HTML iconHTML  

    The recent discovery of instability caused by the interaction of local routing policies of multiple ASes has led to extensive research on the subject. However, previous studies analyze stability under a specific route selection algorithm. In this paper, instead of studying a specific route selection algorithm, we study a general class of route selection algorithms which we call rational route sele... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the yield of ExScal, a large-scale wireless sensor network experiment

    Publication Year: 2005
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (408 KB) |  | HTML iconHTML  

    Recent experiments have taken steps towards realizing the vision of extremely large wireless sensor networks, the largest of these being ExScal, in which we deployed about 1200 nodes over a 1.3 km by 300 m open area. Such experiments remain especially challenging because of: (a) prior observations of failure of sensor network protocols to scale, due to network faults and their spatial and temporal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking targets with quality in wireless sensor networks

    Publication Year: 2005 , Page(s): 12 pp. - 74
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (963 KB) |  | HTML iconHTML  

    Tracking of moving targets has attracted more and more attention due to its importance in utilizing sensor networks for surveillance. In this paper, we consider the issue of how to track mobile targets with certain level of quality of monitoring (QoM), while conserving power. We address the target tracking problem by taking into account of both the coverage and the QoM. In particular, QoM ensures ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fundamental role of hop distance in IEEE 802.11 multi-hop ad hoc networks

    Publication Year: 2005
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (360 KB) |  | HTML iconHTML  

    In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell). The effects of nodes beyond the sensing range (known as hidden nodes) on a sender are complicated and difficult to analyze. Consequently, how to analytically model multi-hop ad-hoc networks, specially networks based on the popular IEEE 802.11 standards rem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing in ad-hoc networks with MIMO links

    Publication Year: 2005
    Cited by:  Papers (26)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (392 KB) |  | HTML iconHTML  

    Smart antennas include a broad variety of antenna technologies ranging from the simple switched beams to the sophisticated digital adaptive arrays. While beam-forming antennas are good candidates for use in strong line of sight (LOS) environments, it is the multiple input multiple output (MIMO) technology that is best suited for multipath environments. In fact, the MIMO links exploit the multipath... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MuON: epidemic based mutual anonymity

    Publication Year: 2005 , Page(s): 11 pp. - 109
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (440 KB) |  | HTML iconHTML  

    A mutually anonymous service hides the identity of a client from the service provider and vice-versa. Providing mutual anonymity usually requires a large number of participants. While peer-to-peer (P2P) networks are capable of recruiting a large number of participants, reliable anonymous communication in these architectures, with low bandwidth usage, still needs further investigation. This paper p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incentives to promote availability in peer-to-peer anonymity systems

    Publication Year: 2005
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (344 KB) |  | HTML iconHTML  

    Peer-to-peer (P2P) anonymous communication systems are vulnerable to free-riders, peers that use the system while providing little or no service to others and whose presence limits the strength of anonymity as well as the efficiency of the system. Free-riding can be addressed by building explicit incentive mechanisms into system protocols to promote two distinct aspects of cooperation among peers-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks

    Publication Year: 2005
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (336 KB) |  | HTML iconHTML  

    In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While it is implemented in some peer-to-peer networks, little is known about its undesirable behavior and little is known about its general usefulness in unstructured peer-to-peer networks. This paper describes the first evaluatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Z-ring: fast prefix routing via a low maintenance membership protocol

    Publication Year: 2005
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (608 KB) |  | HTML iconHTML  

    In this paper, we introduce Z-ring, a fast prefix routing protocol for peer-to-peer overlay networks. Z-ring incorporates cost-efficient membership protocol to achieve fast routing with small maintenance cost. Z-ring achieves routing in logGN steps, where N is the network size and G is the size of a group that can be maintained by a membership protocol with low cost. With G=4096, it translates to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path vector face routing: geographic routing with local face information

    Publication Year: 2005
    Cited by:  Papers (44)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB) |  | HTML iconHTML  

    Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a well-defined notion of "faces". In this paper, we demonstrate that we can improve routing performance by storing a small amount of local face information at each node. We present a protocol, path vector exchange (PVEX), that maintains l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple robotic routing in ad hoc networks

    Publication Year: 2005 , Page(s): 10 pp. - 168
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (449 KB) |  | HTML iconHTML  

    Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles that prevent transmission. Then, the recovery algorithm is used to detour the obstacles. To explore the obstacles and find a path around them, the earlier recovery approaches construct a planar graph to avoid routing loops. ... View full abstract»

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

    Publication Year: 2005 , Page(s): 10 pp. - 178
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB) |  | HTML iconHTML  

    In this paper we focus on the problems of maintaining ad hoc network connectivity in the presence of node mobility whilst providing globally efficient and robust routing. The common approach among existing wireless ad hoc routing solutions is to establish a global optimal path between a source and a destination. We argue that establishing a globally optimal path is both unreliable and unsustainabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient hop ID based routing for sparse ad hoc networks

    Publication Year: 2005 , Page(s): 10 pp. - 190
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (342 KB) |  | HTML iconHTML  

    Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users' mobility and potentially large scale. Recently, there has been a thrust of research to address these problems, including on-demand routing, geographical routing, virtual coordinates, etc. In this paper, we focus on geographical routing, which was shown to achieve good scalability without... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing event distribution in publish/subscribe systems in the presence of policy-constraints and composite events

    Publication Year: 2005
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (520 KB) |  | HTML iconHTML  

    In the publish/subscribe paradigm, information is disseminated from publishers to subscribers that are interested in receiving the information. In practice, information dissemination is often restricted by policy constraints due to concerns such as security or confidentiality agreement. Meanwhile, to avoid overwhelming subscribers by the vast amount of primitive information, primitive pieces of in... View full abstract»

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