1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)

12-12 Feb. 1999

Filter Results

Displaying Results 1 - 25 of 67
  • 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)

    Publication Year: 1999
    Request permission for commercial reuse | |PDF file iconPDF (284 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):vi - ix
    Request permission for commercial reuse | |PDF file iconPDF (259 KB)
    Freely Available from IEEE
  • Accelerating ATM: on-line compression of ATM streams

    Publication Year: 1999, Page(s):233 - 239
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (685 KB)

    Since ATM switches intended to be simple and inexpensive, a significant part of the network cost is in the cost of the links. A way of increasing the traffic we can send over these expensive links is to transmit compressed ATM cells. This idea, although it seems very simple, is a new one for ATM and in this paper we show that it can significantly increase the bandwidth of a typical ATM network. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contrasting branch characteristics and branch predictor performance of C++ and C programs

    Publication Year: 1999, Page(s):275 - 283
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (919 KB)

    In today's superscalar and superpipelined computers, branch instructions are the main culprits that limit the processor from issuing instructions at a peak rate. Although C++, which is an object-oriented programming language, provides great flexibility to help solve complex programming problems, the cost is a penalty in performance when compared to C. This paper compares the intrinsic branch behav... View full abstract»

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

    Publication Year: 1999, Page(s): 499
    Request permission for commercial reuse | |PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • A method of service quality estimation with a network measurement tool

    Publication Year: 1999, Page(s):201 - 209
    Cited by:  Papers (3)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (576 KB)

    Recently, many kinds of real-time applications have become available over IP networks. It is important to measure network performance for such applications before making use of real applications. The authors developed a general purpose traffic measurement tool for IP networks. This system can generate any kind of traffic flexibly and calculate network performance such as throughput, delay and loss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimisation of the performance of a rate-based congestion control system by using fuzzy controllers

    Publication Year: 1999, Page(s):192 - 198
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (572 KB)

    This article describes a congestion control protocol, based on the use of fuzzy controllers, for efficient utilisation of the capacity of the network. The basic control mechanism uses rate-based control, closely resembling the one specified by the ATM Forum for the Available Bit Rate (ABR) service category. Fuzzy logic is utilised in the network elements to enhance the required control decisions w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Latency analysis of UDP and BPI on Myrinet

    Publication Year: 1999, Page(s):185 - 191
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (556 KB)

    High-speed networks such as ATM, Myrinet, and Gigabit Ethernet are available today, and many researchers make efforts to enhance the performance of end-to-end communication on these high-speed networks. One of the efforts is to develop new light-weight communication primitives for high-speed network. However the latency of the new primitives has not been characterized thoroughly, partly because ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation evaluation of optimistic replicated filing in mobile environments

    Publication Year: 1999, Page(s):43 - 51
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    Optimistic replication of data is becoming increasingly popular in mobile environments, but its performance and scaling characteristics are not well understood. This paper presents a simulation evaluation of optimistic replicated filing in a mobile environment. We first compare full and selective optimistic replication systems to capture the properties required for scaling. We then show that the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid TCP-UDP transport for Web traffic

    Publication Year: 1999, Page(s):177 - 184
    Cited by:  Papers (7)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (564 KB)

    Most of the web traffic today uses the HyperText Transfer Protocol (HTTP), with Transmission Control Protocol (TCP) as the underlying transport protocol. Unfortunately, TCP is poorly suited for the short conversations that comprise a significant component of web traffic. The overhead of setting up and tearing down TCP state amortizes poorly for these small connections. Moreover, emerging modern we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive distributed channel allocation strategy for mobile cellular networks

    Publication Year: 1999, Page(s):36 - 42
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (736 KB)

    There are two approaches to design a distributed channel allocation algorithm: Search and Update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we propose a novel distributed acquisition algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulation performance study of TCP Vegas and Random Early Detection

    Publication Year: 1999, Page(s):169 - 176
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (588 KB)

    This paper presents results from a series of simulation experiments designed to study network performance when TCP Vegas and the Random Early Detection (RED) algorithm are used together. Using the x-Sim network simulator, simulation tests were conducted with a variety of traffic scenarios using both TCP Reno and TCP Vegas in combination with First-Come-First-Served (FCFS) and RED routers. Analysis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving the consensus problem in a mobile environment

    Publication Year: 1999, Page(s):29 - 35
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (672 KB)

    Atomic broadcast or non-blocking atomic commitment are classic agreement problems encountered when designing fault-tolerant distributed systems. Specific protocols that solve such agreement problems can be designed based on a common building block, namely the consensus service. Unfortunately, the consensus problem has no deterministic solution in an asynchronous distributed system that is subject ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On estimating protocol performance from a formal specification

    Publication Year: 1999, Page(s):157 - 163
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (520 KB)

    This paper introduces an approach for protocol performance estimation directly from a formal model of the protocol. By using the approach presented in this paper, performance of a protocol can be quickly estimated at an early stage of protocol design. The simplicity of analysis, achieved by deterministic analysis, and the tight integration of the performance model, called the performance reachabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space optimal PIF algorithm: self-stabilized with no extra space

    Publication Year: 1999, Page(s):20 - 26
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (608 KB)

    Recently (1998), we introduced a new self-stabilizing PIF paradigm, called the Propagation of information with Feedback and Cleaning (PFC), for the rooted tree networks. In this paper, we propose the first self-stabilizing PIF scheme for the tree networks without sense of direction-the trees do not have a root and the processors do not maintain any ancestor. The proposed PIF scheme is based on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple paths protocol for a cluster type network

    Publication Year: 1999, Page(s):150 - 156
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (576 KB)

    We can access Internet by carrying a portable computer and using the wireless communication. The wireless network with PHS (Personal Handy phone System) and portable cellular telephone has only rates of tens of Kbps to a few Mbps. Compared with the cable network, the transfer rate cannot generally satisfy a highly developed communication services such as large file transfer and real-time communica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The most reliable data path transmission

    Publication Year: 1999, Page(s):15 - 19
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (352 KB)

    We examine the problem of transmitting a units of data in the most reliable manner along an (s,t) path of a network N=(V,E,c,d,r,s,t). Each edge of a network is assigned a capacity, a delay and a reliability value. In contrast to the similarly defined shortest path problem, it is shown that for this more complex routing problem the subpaths of an optimal path are not necessarily optimal. However, ... View full abstract»

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

    Publication Year: 1999, Page(s):143 - 149
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (592 KB)

    This paper presents modifications to the Core Based Tree (CBT) multicast routing protocol for selecting a set of optimal routers in a domain as core routers for a multicast group. Currently, there is no mechanism in CBT to locate core routers in an automatic fashion, adapting to network changes. Our proposed modifications help configure an optimal router as core based on three heuristics: Center o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDATS II: improved compression of address traces

    Publication Year: 1999, Page(s):72 - 78
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (432 KB)

    The tremendous storage space required for a useful data base of memory reference traces has prompted a search for trace compaction techniques. PDATS is the standard trace format used in the NMSU TraceBase, a widely used archive of memory and instruction traces. The PDATS family of trace compression techniques achieves trace coding densities of about six references per byte with no loss of referenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a single address space operating system for distributed computing and high performance

    Publication Year: 1999, Page(s):8 - 14
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (660 KB)

    Recent 64-bit microprocessors have made a huge 18.4 quintillion byte address space potentially available to programs. This has led to the design of Operating Systems that provide a single virtual address space in which all code and data reside in and that spans all levels of storage and all nodes of a distributed system. These operating systems called SASOSs, have characteristics that can be used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optical layer protocol for lightpath management in WDM networks

    Publication Year: 1999, Page(s):412 - 418
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (416 KB)

    This paper deals with an optical layer protocol designed for next generation lightwave networks, known as all-optical networks (AONs), where path between end-to-end nodes remains entirely optical. These paths are called lightpaths. Unlike OSI-RM, in the AON architecture, a new layer, called optical layer, has been introduced to manage the lightpath-related-functions. The optical layer lies in betw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power-based leader selection in ad-hoc wireless networks

    Publication Year: 1999, Page(s):134 - 139
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (528 KB)

    In this paper, we develop a physical layer-based framework for the organization of an ad-hoc wireless network. The focus is quasi-static environments, such as multimedia classrooms, and situations characterized by real-time services and high traffic loads. In these cases, centralized control may be preferable due to its simplicity and high efficiency. Using a link loss matrix, an approach is propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Session traces: an enhancement to network simulator

    Publication Year: 1999, Page(s):225 - 229
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (308 KB)

    This paper discusses a methodology for lifting a sessions trace from a packet trace. The session trace is created from a packet trace by removing many of the physical and network layer control mechanisms from the packet trace. The session trace embodies the true client/server transaction induced on the network link. We show that the session trace is superior to a packet trace for network simulatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accurately modeling speculative instruction fetching in trace-driven simulation

    Publication Year: 1999, Page(s):65 - 71
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (780 KB)

    Performance evaluation of modern, highly speculative, out-of-order microprocessors and the corresponding production of detailed, valid, accurate results have become serious challenges. A popular evaluation methodology is trace-driven simulation which provides the advantage of a highly portable simulator that is independent of the constraints of the trace generation system. While developing and mai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalent permutation capabilities between time division optical omega network and non-optical extra stage omega network

    Publication Year: 1999, Page(s):356 - 362
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (408 KB)

    Since optical networks must support crosstalk-free (CF) connections, regular N×N multistage interconnection networks (MINs) cannot be directly used to provide connections between N inputs and N outputs. A solution is to use a 2N×2N Cube-Type MIN to provide the N×N connections. C. Qiao (1993) proposed a time domain approach that divides the N optical inputs into several groups suc... View full abstract»

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