By Topic

Network Protocols, 2001. Ninth International Conference on

Date 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 (124)  |  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
  • Scalable socket buffer tuning for high-performance Web servers

    Publication Year: 2001, Page(s):281 - 289
    Cited by:  Papers (2)
    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.
  • Evaluation of a novel two-step server selection metric

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

    Choosing the best-performing server for a particular client from a group of replicated proxies is a difficult task. We offer a novel, two-step technique for server selection that chooses a small subset of five servers, and isolates testing to that subset for ten days. We present an empirical evaluation of both our method and previously proposed metrics based on traces to 193 commercial proxies. We... 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 (9)
    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.
  • 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.
  • 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.
  • TCP over load-reactive links

    Publication Year: 2001, Page(s):172 - 179
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (757 KB) | HTML iconHTML

    Emerging network technologies offer new design choices for performing traffic engineering and management, while introducing challenges for existing protocol control mechanisms. There is a tension between new hop-by-hop capabilities and existing end-to-end mechanisms. We examine one such capability, the load-reactive link (LRL), which has a capacity that can be automatically varied in response to t... 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.
  • 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.
  • 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.
  • Dynamic class selection: From relative differentiation to absolute QoS

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

    The relative differentiation architecture does not require per-flow state at the network core or edges, nor admission control, but it can only provide higher classes with better service than lower classes. A central premise in this context is that users with absolute QoS requirements should search dynamically for an appropriate class. We investigate this dynamic class selection (DCS) framework, an... 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 (41)  |  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.
  • Recursive position estimation in sensor networks

    Publication Year: 2001, Page(s):35 - 41
    Cited by:  Papers (119)  |  Patents (3)
    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.
  • Source filtering in IP multicast routing

    Publication Year: 2001, Page(s):82 - 90
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (781 KB) | HTML iconHTML

    IP multicasting is an efficient group communication mechanism. It avoids transmitting packets from a sender to each of the receivers separately. With the current IP multicast mechanism, once having joined a group, a host will receive all data destined to the group from any source, irrespective of whether it wishes to receive them. This paper studies source filtering in IP multicasting. Source filt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A memory-based approach for a TCP-friendly traffic conditioner in DiffServ networks

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

    Markers, one of the building blocks of a traffic conditioner, play a major role for resource allocation in a DiffServ network. Recently, there has been a considerable research interest in designing intelligent markers, tailored for TCP traffic. The TCP dynamics make the design of a marker difficult in many respects. We list the issues related to designing a TCP-friendly marker and propose an intel... 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.
  • Responder anonymity and anonymous peer-to-peer file sharing

    Publication Year: 2001, Page(s):272 - 280
    Cited by:  Papers (40)  |  Patents (24)
    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.
  • 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.
  • Channelization problem in large scale data dissemination

    Publication Year: 2001, Page(s):100 - 109
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (851 KB) | HTML iconHTML

    In many large scale data dissemination systems, a large number of information flows must be delivered to a large number of information receivers. However, because of differences in interests among receivers, not all receivers are interested in all of the information flows. Multicasting provides the opportunity to deliver a subset of the information flows to a subset of the receivers. With a limite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making QoS aware multicast scalable in terms of link state advertisement

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

    Recently routing protocols for QoS aware multicast have been actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our ... 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.
  • Controlling high-bandwidth flows at the congested router

    Publication Year: 2001, Page(s):192 - 201
    Cited by:  Papers (107)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB) | HTML iconHTML

    FIFO queueing is simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control, but also short round-trip time TCP flows. At the other extreme, per-flow scheduling mechanisms provide max-min fairness but are more complex, keeping state for all flows going through the router. This paper presents RED-PD (Random Early Detect... View full abstract»

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