Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

Proceedings of Sixth International Conference on Computer Communications and Networks

22-25 Sept. 1997

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings of Sixth International Conference on Computer Communications and Networks

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

    Publication Year: 1997, Page(s):549 - 551
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Scheduling support for multicasting sessions in broadband communication networks

    Publication Year: 1997, Page(s):176 - 181
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Multimedia applications require support from the underlying broadband network at the end-to-end communication level. Multicasting is an important paradigm of end-to-end communication. The root node of a multicasting session is responsible for controlling the session including monitoring, maintenance, and the implementation of the multicasting protocol. The job that controls the multicasting sessio... 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 using a spine

    Publication Year: 1997, Page(s):34 - 39
    Cited by:  Papers (85)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    We present a two-level hierarchical routing architecture for ad hoc networks. Within each lower level cluster, we describe a self-organizing, dynamic spine structure to (a) propagate topology changes, (b) compute updated routes in the background, and (c) provide backup routes in case of transient failures of the primary routes. We analyze and bound the worst case of movements between upper level c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Archiving agents for the World Wide Web

    Publication Year: 1997, Page(s):424 - 426
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The information available on the World Wide Web changes with incredible speed. New information is added and old information is altered. This means that a document which is important to a user accessing the Web may change, move or even disappear altogether. Described here is an autonomous agent, written in Java, which locally archives documents that are deemed important by the user. These locally a... View full abstract»

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

    Publication Year: 1997, Page(s):170 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This paper presents FMP, a flexible multicast protocol based on the SRM algorithm in order to guarantee a reliable multipoint communication support. FMP is intended to strengthen the SRM repair/request policies, as well as to optimise the recovery treatments in case of failure occurence. Moreover, FMP is designed to meet the variety of needs of multicast applications by providing a mean to select ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared tree wireless network multicast

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

    In this paper we propose a multicast protocol for a multihop, mobile wireless network with cluster based routing and token access protocol within each cluster. The multicast protocol uses a shared tree which is dynamically updated to adjust to changes in topology and membership (i.e. dynamic joins and quits). Two options for tree maintenance have been simulated and evaluated: “hard state&rdq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability of Internet hosts: a case study from the end user's perspective

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

    This paper presents the results of a 40-day reliability study on a set of 97 popular Web sites done from an end user's perspective. Data for the study was acquired by periodically attempting to fetch an HTML file from each Web site and recording the outcome of such attempts. Analysis of the acquired data revealed: (i) 94% of the HTML file fetch requests succeed on average; (ii) most failures last ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated formal verification of protocols

    Publication Year: 1997, Page(s):166 - 169
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    We adopt a formalism to describe protocols that is close to the human way of thinking and can be easily used to perform reachability analysis of the described protocol in a state-transition format. This formalism allows for an execution tree (ET) to be generated from a set of assertions such that all paths from the root to the leaves are well-defined formulas. We then extend the formalism with reg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP selective acknowledgments and UBR drop policies to improve ATM-UBR performance over terrestrial and satellite networks

    Publication Year: 1997, Page(s):17 - 25
    Cited by:  Papers (8)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    We study the performance of selective acknowledgements (SACK) with TCP over the ATM-UBR service category. We examine various unspecified bit rate (UBR) drop policies, TCP mechanisms and network configurations to recommend optimal parameters for TCP over UBR. We discuss various TCP congestion control mechanisms compare their performance for LANs and WANs. We describe the effect of satellite delays ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended comparison of slotted and unslotted deflection routing

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

    In this paper, we have experimentally compared synchronized versus asynchronous all-optical deflection networks. We have compared four routing modes: synchronous mode, partially synchronous mode, and asynchronous mode with fixed or bound packet sizes. Our experiments mainly show that the natural decrease of the performances of the asynchronous mode, compared to the synchronous mode, can be balance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed control protocols for WDM all-optical networks

    Publication Year: 1997, Page(s):150 - 153
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    Path multiplexing (PM) and link multiplexing (LM) are two approaches for establishing connections (or lightpaths) in optical networks. This paper describes distributed control protocols for establishing lightpaths in WDM networks using LM and PM. We propose and evaluate the performance of two classes of protocols, namely source initiated reservation (SIR) and destination initiated reservation (DIR... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm of delay bounded multicast routing for multimedia applications

    Publication Year: 1997, Page(s):208 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The aim of multicast routing is to find a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree, is a tree where the accumulated delay from the source node to any destination along the tree shall not exceed a pre-specified bound. This paper presents a distributed heuristic algorithm which generates routing trees with sub-optimal network... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance testing of communication protocols for three-tier computing: results for ICA and X window protocols

    Publication Year: 1997, Page(s):450 - 455
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    We present the results of performance tests to compare two protocols for three-tier computing using the Windows NT operating system. Three-tier computing features a data server for stored databases (Tier 1), an application server that runs applications (Tier 2), and a simple client program that runs on desktop machines that presents the user interface (Tier 3). Three protocols are available to com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IP routing on logical address group

    Publication Year: 1997, Page(s):378 - 382
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    In principle, more than one routers are intervened between different IP subnets. IETF RFC1577 “Classical IP and ARP over ATM”, which is specified to provide IP services on an ATM network, also requires that the router be used between different logical IP subnet (LISs). However, the intervention of the router is not always an effective solution on an ATM network. If there is a direct vi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling packet transmissions in a multi-hop packet switched network based on message length

    Publication Year: 1997, Page(s):350 - 357
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static caching in Web servers

    Publication Year: 1997, Page(s):410 - 417
    Cited by:  Papers (12)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    This paper studies caching in primary Web servers. We use log files from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold and the Pitkow/Recker (1994) policy. Web document access patterns change very slowly. Based on this fact, we propose and evaluate static caching, a novel cache policy for Web s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATM network interface architectures for low latency

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

    There are many important factors to consider when designing a network interface for an ATM network, and different applications have different demands. This paper addresses the problem of making an ATM interface with the focus on very low message latency, e.g., for shared memory multiprocessors on top of a network of workstations, and yet making it general enough to be a cost effective solution. Di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of multicast banyan networks

    Publication Year: 1997, Page(s):51 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    Multicast is the ability to transmit information from a single source node to multiple selected destination nodes in a network. Current trends in networking applications indicate that there will be an increasing demand in future networks for multicast communication. Banyan networks have been proposed for use in ATM high-speed communications networks and have been used for the interconnection of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • STEPS: a software tool-set for automated protocol synthesis

    Publication Year: 1997, Page(s):160 - 165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Protocol synthesis represents an important alternative to the classical design process based on reachability analysis where the fundamental drawback is the exponential growth of reachable states. In order to demonstrate the usefulness and the feasibility of the protocol synthesis approach presented by Kahlouche and Girardot (see IEEE INFOCOM'1996, p.1165-73, 1996), we have developed a software too... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance model for ATM switches with multiple input queues

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

    An analytical model for the performance analysis of a novel input access scheme for an ATM switch is developed and presented in this paper. The interconnection network of the ATM switch is internally nonblocking and each input port maintains a separate queue for each output port so as to reduce the head-of-line (HOL) blocking of conventional input queuing switches. Each input is allowed to send on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATM switches with bifurcated input queueing

    Publication Year: 1997, Page(s):504 - 507
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Bifurcated queueing has been shown to be a very practical means to exceed the classical upper bound of 0.568 for throughput of input-queued ATM switches. We report the results from a simulation study of the associated improvements in the average cell delay. Our results indicate sharp reductions in the average cell delays, and our simulations include cases of both uncorrelated and correlated traffi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time dependent priority scheduling for guaranteed QoS systems

    Publication Year: 1997, Page(s):236 - 241
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    With the advances in server technology, and the advent of fast gigabit networks, it has become possible to support multimedia applications. To support the requirements for the transmission of isochronous data, the network must provide service guarantees to connections, including minimum bandwidth, packet delay, delay jitter, and loss. Three factors determine the utilization of the network when pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A burst-level priority scheme for bursty traffic in ATM networks

    Publication Year: 1997, Page(s):11 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Statistical gain is achieved in asynchronous transfer mode (ATM) networks by making bursty connections share resources stochastically. When connections with different QOS requirements share the same resources, the highest QOS requirements would typically be the limiting factor in determining the admissible load at a link. This may lead to connections with low QOS requirements getting better servic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An architecture for inter-domain troubleshooting

    Publication Year: 1997, Page(s):516 - 523
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    We explore the constraints of a new problem: that of coordinating network troubleshooting among peer administrative domains and untrusted observers. Allowing untrusted observers permits any entity to report problems, whether it is a network operations center (NOC), end-user, or application. Our goals are to define the inter-domain coordination problem clearly, and to develop an architecture which ... View full abstract»

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