By Topic

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
  • Fundamental trade-offs in aggregate packet scheduling

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

    We investigate the fundamental trade-offs in aggregate packet scheduling for the support of guaranteed delay service. Besides the simple FIFO packet scheduling algorithm, we consider two new classes of aggregate packet scheduling algorithms: the static earliest time first (SETF) and dynamic earliest time first (DETF). Through these two classes of aggregate packet scheduling, we show that, with add... 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.
  • 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.
  • 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.
  • 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 (19)  |  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.
  • 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.
  • 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.
  • 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.
  • Fast and robust signaling overload control

    Publication Year: 2001, Page(s):323 - 331
    Cited by:  Papers (22)  |  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.
  • An experimental analysis of BGP convergence time

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

    Publication Year: 2001, Page(s):290 - 300
    Cited by:  Papers (17)  |  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.
  • Adapting to route-demand and mobility (ARM) in ad hoc network routing

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

    We present ARM (adapting to route-demand and mobility), a control mechanism that allows any proactive routing protocol to dynamically adapt in a totally distributed manner to changes in node mobility and workload route-demands. Each node independently maintains a mobility metric indicating how fast its neighborhood is currently changing, and a route-demand metric indicating which destinations are ... 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.
  • 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.
  • 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.
  • On-demand multipath distance vector routing in ad hoc networks

    Publication Year: 2001, Page(s):14 - 23
    Cited by:  Papers (496)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (858 KB) | HTML iconHTML

    We develop an on-demand multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loop-freedo... View full abstract»

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