Proceedings 1997 International Conference on Network Protocols

28-31 Oct. 1997

Filter Results

Displaying Results 1 - 25 of 34
  • Proceedings 1997 International Conference on Network Protocols

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (271 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s): 309
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • Design and implementation of a real-time switch for segmented Ethernets

    Publication Year: 1997, Page(s):152 - 161
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    Providing network bandwidth guarantees over an Ethernet requires coordination of the network nodes for traffic prioritization such that real-time data can have deterministic access to the network. We have shown previously how RETHER, a software based token passing protocol can efficiently provide real-time support over a single shared Ethernet segment. This work extends the token passing mechanism... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ABR service for applications with non-linear bandwidth utility functions

    Publication Year: 1997, Page(s):15 - 23
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    An available bit rate (ABR) service allows applications to access a time-varying network capacity. In a basic ABR service the available network capacity is divided “fairly” amongst active connections, without regard to the utility that each application derives from the bandwidth allocation. The goal of this paper is to improve both the global and individual utility obtained by applicat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Admission control and loss management for an application-level statistical service

    Publication Year: 1997, Page(s):142 - 151
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    We present an admission control framework and loss management techniques in support of a guaranteed statistical service. The service is characterized by (i) the loss rate of application data units (ADUs) bounded below a specified value, and (ii) ADU losses distributed evenly among flows subscribing to the service and uniformly over the duration of each flow. Specifically, a flow is modeled as a se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

    Publication Year: 1997, Page(s):7 - 14
    Cited by:  Papers (32)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The fluid generalized processor sharing (GPS) algorithm has desirable properties for integrated services networks and many packet fair queueing (PFQ) algorithms have been proposed to approximate GPS. However, there have been few high speed implementations of PFQ algorithms that can support large number of sessions with diverse rate requirements and at the same time maintain all the important prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the accuracy of admission control tests

    Publication Year: 1997, Page(s):125 - 133
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    In guaranteed performance networks, a connection admission control (CAC) algorithm determines whether or not a new connection can be admitted to the network such that all connections will obtain their required quality of service (QoS) guarantees. However, inaccuracies in a CAC algorithm lead to either under utilization of resources or violations of the promised QoS guarantees. We evaluate the accu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experimental study of insider attacks for OSPF routing protocol

    Publication Year: 1997, Page(s):293 - 300
    Cited by:  Papers (15)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    It is critical to protect the network infrastructure (e.g., network routing and management protocols) against security intrusions, yet dealing with insider attacks are probably one of the most challenging research problems in network security. We study the security threats, especially internal/insider threats, for the standardized routing protocol OSPF. In OSPF, a group of routers collaborate, exc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing guaranteed quality of service connections in integrated services packet networks

    Publication Year: 1997, Page(s):175 - 182
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A critical functional component of quality-of-service (QoS) deployment in packet-switched networks is QoS-based routing. In this paper, we present a routing solution for guaranteed quality-of-service connections in integrated services packet networks (ISPN)-the future QoS-capable Internet proposed by the IETF. The problem is in essence a path finding problem with both end-to-end delay and per-node... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal feedback control for ABR service in ATM

    Publication Year: 1997, Page(s):32 - 41
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The efficient support of data traffic over ATM networks requires congestion control, whose objectives include maximizing throughput, minimizing switch buffer requirement, and attaining a fair bandwidth allocation. With available bit rate (ABR) service in ATM, congestion control is achieved by requiring data sources to adjust their rates based on the feedback from the network. The difficulties in p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User agents and flexible messages: a new approach to wireless two-way messaging

    Publication Year: 1997, Page(s):53 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Wireless messaging, in the form of two-way paging, is an integral part of universal Personal Communications Services (PCS). Basic wireless messaging services include providing reliable (acknowledged) message delivery, reply capabilities, and message origination from a messaging device. Many more advanced services can also be envisioned. Wireless networks and end devices impose many limitations on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On path selection for traffic with bandwidth guarantees

    Publication Year: 1997, Page(s):191 - 202
    Cited by:  Papers (101)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    Transmission of multimedia streams imposes a minimum-bandwidth requirement on the path being used to ensure end-to-end Quality-of-Service (QoS) guarantees. While any shortest-path algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved virtual queueing and dynamic EPD techniques for TCP over ATM

    Publication Year: 1997, Page(s):212 - 219
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    It is known that TCP throughput can degrade significantly over UBR service in a congested ATM network, and the early packet discard (EPD) technique has been proposed to improve the performance. However, recent studies show that EPD cannot ensure fairness among competing VCs in a congested network, but the degree of fairness can be improved using various forms of fair buffer allocation techniques. ... View full abstract»

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

    Publication Year: 1997, Page(s):277 - 284
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The distance vector routing protocol satisfies the following property. If this protocol is used to route a sequence of data messages from a source to a destination, then these data messages will follow the same shortest-distance path from the source to the destination. In this paper, we show how to modify this protocol, without adding new messages, in order to satisfy the following load balancing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS based routing algorithm in integrated services packet networks

    Publication Year: 1997, Page(s):167 - 174
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the prob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multicasting ABR protocols for wireless ATM networks

    Publication Year: 1997, Page(s):24 - 31
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The major challenges of designing multicast rate-control protocols for a combined wired/wireless network are the varying transmission characteristics (bandwidth, error, and propagation delay) of the wireless and wired media, and the different, possibly conflicting flow control requests from multiple receivers. To address these issues, in this paper we study multicasting rate-control ABR algorithms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Carrier-sense protocols for packet-switched smart antenna basestations

    Publication Year: 1997, Page(s):45 - 52
    Cited by:  Papers (13)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    Researchers have recently considered the use of smart antennas in various packet-switched data networks. Previously, a single-beam system was described which employs a smart antenna basestation, operating in carrier-sense (CSMA) mode. Performance improvements are obtained by having the antenna dynamically point pattern nulls in the direction of interfering stations, thus reducing the frequency of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line dynamic bandwidth allocation

    Publication Year: 1997, Page(s):134 - 141
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these guarantees as efficiently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allocat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic host routing for production use of developmental networks

    Publication Year: 1997, Page(s):285 - 292
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Many high-speed networks are in a development stage, compared to established technologies like Ethernet. Use of these networks for production service provides substantial benefits to the developers, e.g., for large-scale testing. However, most users are not tolerant of pre-production network outages, even in exchange for the higher bandwidth these networks afford. This paper describes ISI's experi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load profiling for efficient route selection in multi-class networks

    Publication Year: 1997, Page(s):183 - 190
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    High-speed networks, such as ATM networks, are expected to support real-time Quality of Service (QoS) guarantees required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these algorithms assign VCs to routes usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A join-the-shortest-queue prefetching protocol for VBR video on demand

    Publication Year: 1997, Page(s):63 - 72
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    We present a high-performance prefetching protocol for the delivery of prerecorded VBR video from a server across a packet-switched network to a large number of clients. Not only does the protocol give constant perceptual quality and almost 100% link utilization, but it also allows for immediate commencement of the video upon user request and near instantaneous response to pause/resume and tempora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP behavior with many flows

    Publication Year: 1997, Page(s):205 - 211
    Cited by:  Papers (62)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows, than packers in the delay-bandwidth product. In the limit of large numbers of flows, TCP forces a packet loss rate approaching 50%, causing delays that users are likely to notice. TCP's minimum congestion window of one packet is th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active networking and the end-to-end argument

    Publication Year: 1997, Page(s):220 - 228
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    Active networking is the placement of user-controllable computing functionality in the switching nodes of a network. The end-to-end argument states that functions should be placed “in” the network only if they can be cost-effectively implemented there. We argue that active networking is a natural consequence of the end-to-end argument, because certain functions can be most effectively ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-layer group communication server for extending reliable multicast protocols services

    Publication Year: 1997, Page(s):267 - 274
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    Reliable multicast protocols are becoming an essential element in distributed applications such as interactive distance learning applications. However, the existing implementations of reliable multicast protocols are not sufficient to satisfy the group communications requirements of some distributed applications. Our experience of using number of multicast protocols in IRI distance learning applic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical multicasting on a nonbroadcast subnetwork

    Publication Year: 1997, Page(s):251 - 258
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    LAN multicast is now an essential service for users of the MBone and other IP multicast tools. Traditional IP multicast has travelled over two types of subnetwork: point-to-point links and subnetworks with inherent multicast capability, such as Ethernet and token ring. More recent LANs may be arbitrary mesh networks with no built-in, efficient, multicast capability. The authors describe a successf... View full abstract»

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