Proceedings Ninth International Conference on Network Protocols. ICNP 2001

11-14 Nov. 2001

Filter Results

Displaying Results 1 - 25 of 39
  • Proceedings Ninth International Conference on Network Protocols. ICNP 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (219 KB)
    Freely Available from IEEE
  • Providing robust and ubiquitous security support for mobile ad-hoc networks

    Publication Year: 2001, Page(s):251 - 260
    Cited by:  Papers (118)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (973 KB) | HTML iconHTML

    Providing security support for mobile ad-hoc networks is challenging for several reasons: (a) wireless networks are susceptible to attacks ranging from passive eavesdropping to active interfering, occasional break-ins by adversaries may be inevitable in a large time window; (b) mobile users demand "anywhere, anytime" services; (c) a scalable solution is needed for a large-scale mobile network. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Panel on peer to peer computing

    Publication Year: 2001, Page(s): 312
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 351
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Responder anonymity and anonymous peer-to-peer file sharing

    Publication Year: 2001, Page(s):272 - 280
    Cited by:  Papers (45)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (906 KB) | HTML iconHTML

    Data transfer over TCP/IP provides no privacy for network users. Previous research in anonymity has focused on the provision of initiator anonymity. We explore methods of adapting existing initiator-anonymous protocols to provide responder anonymity and mutual anonymity. We present anonymous peer-to-peer file sharing (APFS) protocols, which provide mutual anonymity for peer-to-peer file sharing. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internet user access via dial-up networks-traffic characterization and statistics

    Publication Year: 2001, Page(s):314 - 322
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (913 KB) | HTML iconHTML

    Understanding network traffic from operational networks is critical to the design and evaluation of network protocols. We present analysis of a data set comprised of eight months of RADIUS authentication data taken from a large national dial-up Internet Service Provider (ISP). We present basic statistics, including session counts based on time-of-day, session length distribution, session inter-arr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order rate-control based transport protocols

    Publication Year: 2001, Page(s):342 - 350
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1003 KB) | HTML iconHTML

    We propose an efficient flow and error control scheme for high-throughput transport protocols by using a second-order rate control, called the α-control, and a new sliding-window scheme for error control. The α-control minimizes the packet retransmissions by adjusting the rate-gain parameter to the variations in the number and round-trip times (RTTs) of cross-traffic flows that share t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable secure group communication over IP multicast

    Publication Year: 2001, Page(s):261 - 269
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB) | HTML iconHTML

    We introduce and analyze a scalable re-keying scheme for implementing secure group communications over IP multicast. We show that our scheme incurs constant processing, message, and storage overhead for a re-key operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing quality of service guarantees without per-flow state

    Publication Year: 2001, Page(s):211 - 219
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (715 KB) | HTML iconHTML

    Two approaches have been proposed to improve the quality of service provided by the Internet: integrated services and differentiated services. Integrated services requires per-flow state at each router On the other hand, differentiated services does not require per-flow state, but provides a lower level of quality of service. We present a protocol which provides quality of service similar to that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive position estimation in sensor networks

    Publication Year: 2001, Page(s):35 - 41
    Cited by:  Papers (143)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB) | HTML iconHTML

    Recursive hierarchy provides a framework for extending position estimation throughout a sensor network. Given imprecise ranging and inter-node communication, nodes scattered throughout a large volume can estimate their physical locations from a small set of reference nodes using only local information. System coverage increases iteratively, as nodes with newly estimated positions join the referenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP-friendly SIMD congestion control and its convergence behavior

    Publication Year: 2001, Page(s):156 - 164
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB) | HTML iconHTML

    The increased diversity of Internet application requirements has spurred interest in flexible congestion control mechanisms. Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back off when congestion is detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship b... View full abstract»

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

    Publication Year: 2001, Page(s):332 - 341
    Cited by:  Papers (7)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1007 KB) | HTML iconHTML

    We present an improved explicit congestion notification (ECN) mechanism that enables a router to signal congestion to the sender without trusting the receiver or other network devices along the signaling path. Without our mechanism, ECN-based transports can be manipulated to undermine congestion control. Web clients seeking faster downloads, for example, can trivially conceal congestion signals fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using dynamic buffer limiting to protect against belligerent flows in high-speed networks

    Publication Year: 2001, Page(s):230 - 240
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (979 KB) | HTML iconHTML

    Conventional QoS mechanisms have focused primarily on providing better than normal service for some flows over others. With networks moving to much higher speeds and reasonable provisioning, best efforts access to network resources is adequate for common applications except when a belligerent flow attempts to consume an excessive amount of bandwidth. Any mechanism that attempts to contain such a f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental analysis of BGP convergence time

    Publication Year: 2001, Page(s):53 - 61
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB) | HTML iconHTML

    The border gateway protocol (BGP) is the routing protocol used to maintain connectivity between autonomous systems in the Internet. Empirical measurements have shown that there can be considerable delay in BGP convergence after routing changes. One contributing factor in this delay is a BGP-specific timer used to limit the rate at which routing messages are transmitted. We use the SSFNet simulator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal admission control algorithms for scheduling burst data in CDMA multimedia systems

    Publication Year: 2001, Page(s):202 - 210
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (798 KB) | HTML iconHTML

    3rd generation mobile systems are mostly based on the wideband CDMA platform to support high bit rate packet data services. One important component to offer packet data service in CDMA is a burst admission control algorithm. In this paper, we propose and study a novel jointly adaptive burst admission algorithm, namely the jointly adaptive burst admission-spatial dimension algorithm (JABA-SD) to ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing bandwidth guaranteed paths with restoration in label switched networks

    Publication Year: 2001, Page(s):71 - 79
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (846 KB) | HTML iconHTML

    Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity, and allotted bandwidth remains available, eve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding close friends on the Internet

    Publication Year: 2001, Page(s):301 - 309
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (883 KB) | HTML iconHTML

    We consider the problem of finding nearby application-peers (close friends) over the Internet. We focus on unicast-only solutions and introduce a new scheme -Beaconing-for finding peers that are near. Our scheme uses distance measurement points (called beacons) and can be implemented entirely in the application-layer without investing in large infrastructure changes. We present an extensive evalua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conserving transmission power in wireless ad hoc networks

    Publication Year: 2001, Page(s):24 - 34
    Cited by:  Papers (118)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1081 KB) | HTML iconHTML

    This paper introduces PARO, a power-aware routing optimization that helps to minimize the transmission power needed to forward packets between wireless devices in ad hoc networks. Using PARO, one or more intermediate nodes called "redirectors" elects to forward packets on behalf of source-destination pairs thus reducing the aggregate transmission power consumed by wireless devices. PARO is applica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The war between mice and elephants

    Publication Year: 2001, Page(s):180 - 188
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (961 KB) | HTML iconHTML

    Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the traffic (elephants). A careful study of the TCP protocol shows that without help from an active queue management (AQM) policy, short connections tend to lose to long connections in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient QoS routing algorithm for quorumcast communication

    Publication Year: 2001, Page(s):110 - 118
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB) | HTML iconHTML

    This paper extends the concept of multicast to quorumcast, a generalized form of multicast communication. The need of quorumcast communication arises in a number of distributed applications. Little work has been done on routing quorumcast messages. The objective of previous research was to construct a minimum cost tree spanning the source and the quorumcast group members. We further consider the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Drop strategies and loss-rate differentiation

    Publication Year: 2001, Page(s):146 - 154
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (801 KB) | HTML iconHTML

    When offering loss-rate differentiation in IP networks, the drop strategy used can have a considerable influence on packet loss and delay. In particular, a strategy of dropping packets only as they arrive can cause bursty loss patterns and high jitter. When only arriving packets are dropped, the router may need to wait for low priority packets to arrive before dropping any packet. This results in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable socket buffer tuning for high-performance Web servers

    Publication Year: 2001, Page(s):281 - 289
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB) | HTML iconHTML

    Although many research efforts have been devoted to network congestion in the face of an increase in the Internet traffic, there is little discussion on performance improvements for endhosts. We propose a new architecture, called scalable socket buffer tuning (SSBT), to provide high-performance and fair service for many TCP connections at Internet endhosts. SSBT has two major features. One is to r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and robust signaling overload control

    Publication Year: 2001, Page(s):323 - 331
    Cited by:  Papers (25)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB) | HTML iconHTML

    Telecommunication switches implement overload controls to maintain call throughput and delay at acceptable levels during periods of high load. Existing work has mostly focused on controls under sustained overload-they do not meet the demands of modern telecommunication systems where the increased number of services and mobile subscribers often creates fast changing hot spots. We introduce new algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative evaluation of software implementations of layer-4 packet classification schemes

    Publication Year: 2001, Page(s):220 - 228
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    The availability of fast network processors and general purpose CPUs has made software implementation of per-packet processing in network elements an attractive option. Given this, a-priori knowledge of performance of software implementations of the well known Layer-4 packet classification will be very useful. We compare the performance of three state-of-the-art packet classification schemes namel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed token circulation on mobile ad hoc networks

    Publication Year: 2001, Page(s):4 - 13
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (894 KB) | HTML iconHTML

    This paper presents several distributed algorithms that cause a token to continually circulate through all the nodes of a mobile ad hoc network. An important application of such algorithms is to ensure total order of message delivery in a group communication service. Some of the proposed algorithms are aware of, and adapt to changes in, the ad hoc network topology. When using a token circulation a... View full abstract»

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