By Topic

Performance, Computing and Communications Conference, 1999 IEEE International

Date 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)
    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
  • 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.
  • Virtual personal computers and the portable network

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

    Three categories of remote computing (client/server) in use and development today are the Network Computer (Java), the Web Browser interface, and Remote Screen/Keyboard. The Remote Screen/Keyboard model offers the greatest flexibility, the `thinnest clients': and the strongest immunity to the need for upgrades to users' terminals. It also allows the use of lightweight, ultra-portable, wireless ter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent framework for survivable network systems

    Publication Year: 1999, Page(s):469 - 475
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Large network systems elevate the levels of efficiency and effectiveness of organisations by improving systems integration. This improved integration of computer networks and information systems is accompanied by increased risks of intrusion and compromise. Survivability of networks and information systems in face of these risks becomes an important aspect in the effective functioning of an organi... 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.
  • Power-based leader selection in ad-hoc wireless networks

    Publication Year: 1999, Page(s):134 - 139
    Cited by:  Papers (10)
    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.
  • Design and analysis of one prong network restoration algorithms

    Publication Year: 1999, Page(s):210 - 216
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approa... 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.
  • Hybrid TCP-UDP transport for Web traffic

    Publication Year: 1999, Page(s):177 - 184
    Cited by:  Papers (5)  |  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.
  • A hierarchical routing protocol for large scale ad hoc network

    Publication Year: 1999, Page(s):379 - 385
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The hierarchical network structure significantly reduces the size and maintenance cost of routing table for huge networks. But in ad hoc networks, no fixed host leads to the challenge of the hierarchical structure, since the topology information needs to be updated dynamically due to membership changes caused by mobility. To construct the hierarchical structure of physical locations, we adopt a cl... 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.
  • A new synchronization algorithm for hitless protection switching in ATM networks

    Publication Year: 1999, Page(s):370 - 376
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Redundant transmission on disjoint paths is a common precaution against the effects of failures in communication networks. To allow hitless switching from one path to the other, synchronization algorithms are required. Most of the current algorithms are based on supplementary synchronization information (e.g. synchronization cells). A novel algorithm for the synchronization and selection of redund... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and evaluation of channel management for real-time multimedia connections in highway cellular networks

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

    The wide deployment of multimedia services in third generation wireless networks will require designs that can simultaneously reduce the blocking probability of handoff requests and decrease the handoff delay. In this paper, we discuss this type of designs for dynamic channel assignment and reassignment strategies in highway cellular networks with a small channel reuse distance. A threshold-based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a general traffic control framework in ATM networks

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

    This paper presents a general traffic control framework for Asynchronous Transfer Mode (ATM) networks with its performance evaluation. The proposed traffic control scheme can incorporate all the recently considered ATM service classes including Constant Bit Rate (CBR), real time Variable Bit Rate (rtVBR), non-real time Variable Bit Rate (nrVBR), Available Bit Rate (ABR) and Unspecified Bit Rate (U... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput analysis of WDM-based dual-bus local area networks

    Publication Year: 1999, Page(s):426 - 432
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    This paper investigates the possibility of using wavelength division multiplexing to enhance the system capacity of local area networks with the bus topology. We first consider the choice between wavelength fixed and wavelength tunable transceivers based on practical considerations, and we conclude that the use of fixed wavelength transceivers allows one to employ WDM while still using standard in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sectored renaming for superscalar microprocessors

    Publication Year: 1999, Page(s):59 - 64
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    High Performance superscalar computer processors use a technique known as “register renaming” to facilitate out-of-order instruction execution. Most of these processors support instruction set architectures with multiple data sizes. Register renaming in such processors can be made much more effective and a performance improvement may be gained by implementing a technique we call sector... 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.
  • Distributed dynamic channel allocation in mobile networks: combining search and update

    Publication Year: 1999, Page(s):120 - 126
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Distributed dynamic channel allocation techniques are becoming important with the tremendous growth in mobile cellular communication and demand for wireless multimedia applications. These techniques can be categorized as search based or update based. Search based techniques have low messaging complexity and are suited for high system load and low request rates. On the other hand update based schem... 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.
  • Sidney and RDS: an evaluation of two persistent storage systems

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

    Comparative experimentation is increasingly important in computer science, but performing such experiments can be challenging. The paper presents a set of experiments that compare the performance of two persistent storage managers, and answer the question of whether the safer storage manager has performance comparable to the less safe one. This comparison was difficult for a number of reasons, amo... 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.