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
  • 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.
  • 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.
  • 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.
  • Multi-frame isochronous service for ATM networks: stop-and go revisited

    Publication Year: 1997, Page(s):4 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The ATM switching scheme we propose is similar to the multi-frame stop-and-go, except that we use EDF (earliest-deadline-first) scheduling, instead of rate-monotonic, static-priority scheduling. Unlike the multi-frame stop-and-go, our scheme can fully utilize the link bandwidth, and does not require that the input or output frames of the same size be synchronized. EDF scheduling is, in general, mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling ATM traffic using stochastic Petri net

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

    This paper describes a general framework for modeling and analyzing ATM traffic control using the stochastic high level Petri net (SHLPN). The reasons SHLPN is chosen are two fold: it can handle concurrent, asynchronous, nondeterministic and stochastic events; and it provides an intuitive yet efficient mechanism that can decompose a complex model into submodels. In addition, there exists a set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protocol filtering: a microscopic approach to Windows NT and Novell NetWare network modeling

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

    The application of protocol filtering in network modeling was discussed. This technique can be used to conduct performance analysis by simulating system “what-if” scenarios. The Windows NT and Novell Netware subnets of the School of Engineering at Widener University were considered as the problem domain. Analysis was conducted on 1.2 GB of data gathered daily over a period of two month... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An API for scalable reliable multicast

    Publication Year: 1997, Page(s):60 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    There are many scenarios in which the same data must be delivered over a packet switched network to a large set of receivers. The Internet enables efficient multipoint transmissions through IP multicast by allowing data transmission to all receivers with a single send. Most approaches to scalable reliable multicast utilize receiver-oriented retransmissions. Defining an API for receiver-oriented re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic algorithms for path selection in private ATM networks

    Publication Year: 1997, Page(s):372 - 377
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The path selection problem is formulated as a shortest path problem with multiple constraints which is known to be NP-complete. We propose heuristic algorithms to find a minimum hop path satisfying the constraints of end-to-end delay requirement, maximum load level on each of its link and minimum probability to pass the local call admission control. The spirit of the proposed heuristic is to trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing automated protocol testing oracles to accommodate specification nondeterminism

    Publication Year: 1997, Page(s):532 - 537
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The large number of test inputs and outputs usually involved in testing of protocols makes automated output checking necessary. An automated oracle in the test environment achieves this automation. It is imperative that the oracle should be tolerant of nondeterminism in the specifications. This paper presents an and-state method to accommodate specification nondeterminism in automated protocol res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of parallel frame synchronization scheme in SDH systems

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

    We analyze the performance of a new parallel frame synchronization system used for SDH networks. The performance is measured by using false synchronous probability PFS, the average synchronous incoming time TASI, the average synchronous catching time TASC , and the average synchronization holding time TASH. Analysis indicates that the performance of our ... 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.
  • Explicit rate ABR schemes using traffic load as congestion indicator

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

    A central issue in congestion control for available bit rate (ABR) services is the computation of the fair share for every connection at each switching node in the network. An important class of algorithms for the switch behavior computes the fair share according to the exact definition of max-min fairness, and uses it as the explicit rate conveyed to the sources. These algorithms may encounter di... 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.
  • Mobile extensions to RSVP

    Publication Year: 1997, Page(s):132 - 136
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    RSVP (resource reservation protocol) is a receiver oriented resource reservation setup protocol targeted for integrated services packet networks (ISPNs). RSVP has a number of desirable attributes which make it a leading candidate for Internet standardization. These attributes include flexibility, robustness, and scalability. However, RSVP does not adequately address the issue of resource reservati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multispace search for minimizing the maximum nodal degree

    Publication Year: 1997, Page(s):364 - 367
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Hajek and Sasaki (1988) showed that, for continuous traffic and packet radio network, the selection of paths that minimize the maximum nodal degree generates schedules of minimum-length. This result suggests that minimization of the maximum nodal degree provides good (although not necessarily optimal) performance in slotted networks with fixed-length packets. We give a multispace search algorithm ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An innovative routing protocol evaluation tool

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

    We describe a software tool MCS (multicast simulation) that we developed to evaluate routing protocols. MCS is based on several innovative ideas and provides a very user-friendly, flexible, and dynamically configurable GUI. We present results of applying MCS to the PIM (protocol independent multicast) routing protocol View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving video-on-demand server efficiency through stream tapping

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

    Efficiency is essential for video-on-demand (VOD) to be successful. Conventional VOD servers are inefficient, they dedicate a disk stream for each client, quickly using up all available streams. However, several systems have been proposed that allow clients to share streams. We present a new system called stream tapping that allows a client to greedily “tap” data from any stream on the... 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.
  • Performability analysis of handoff calls in personal communication networks

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

    A combined performance and dependability (called performability) model for dealing with handoff calls is introduced. Stochastic reward nets (SRNs) are used for this purpose. An SRN model of channel assignment is developed and analyzed. The method of phase type expansion is used is approximate non-exponential call holding time distribution. A discussion, of how hand-off models with failure relate t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QOS based performance of selective repeat transport user in hybrid ATM/TDMA networks

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

    The selective repeat (SR) transport user end-to-end throughput and delay characteristics are analyzed in a hybrid asynchronous transfer mode/time division multiple access (ATM/TDMA) network. The SR transport user is assumed with an underlying cell-level global congestion control in the ATM multiplexer node. The analysis is based on the interaction of packet level control with the queue management ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the latency of the Totem multicast protocols

    Publication Year: 1997, Page(s):42 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    Multicast group communication protocols provide a foundation on which distributed systems can be built. The performance of these protocols is, however, not easy to characterize or to analyze. This research determines probability density functions for the latency to message delivery for the Totem multicast protocols, which provide reliable totally ordered delivery of multicast messages across singl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design issues in data networks

    Publication Year: 1997, Page(s):475 - 479
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The paper describes the network design and analysis of a multi-protocol application environment characterized by a client/server architecture, integration of legacy and distributed database structures, frame relay wide area network, and token ring local area networks. Detailed workload characterization and performance modeling of the application environment is presented, and network design issues ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of rate-based congestion control scheme and choice of high and low thresholds

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

    The paper presents a performance analysis of a rate-based congestion control mechanism. The switching capacity of the buffer is finite to reflect real conditions. Using a differential equation approach, we get the closed-form equations of cell loss probability, and utilization. Numerical results are given to show that our analysis is correct. In rate-based control, the important issue is how to de... View full abstract»

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