By Topic

INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE

Date 23-27 April 1989

Filter Results

Displaying Results 1 - 25 of 145
  • Distributed scheduling of broadcasts in a radio network

    Publication Year: 1989, Page(s):497 - 504 vol.2
    Cited by:  Papers (56)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (533 KB)

    A distributed algorithm is presented for obtaining an efficient and conflict-free broadcasting schedule in a multi-hop packet radio network. The inherent broadcast nature of the radio channel enables a node's transmission to be received by all other nodes within range. Multiple transmissions can be scheduled simultaneously because of the multi-hop nature of the network. It is first shown that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE INFOCOM'89 The Conference on Computer Communications. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging? (IEEE Cat. No. 89CH2702-9)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (9 KB)
    Freely Available from IEEE
  • Performance analysis of mobile packet radio networks

    Publication Year: 1989, Page(s):1084 - 1088 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A model is proposed for analyzing the performance of a mobile packet radio network. In this network, a node is allowed to move around with a random velocity. Hence, the distribution of the number of nodes in one's transmission circle is dependent on the mobility of the nodes. A queuing model is developed to evaluate this distribution and the effects of node mobility on system performance. This eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of data capability in TDX-1A system

    Publication Year: 1989, Page(s):408 - 414 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    An overview is given of the TDX-1A system, an enhanced version of the TDX-1 digital switching system. A method of implementing the circuit-switched digital capability (CSDC) for the enhanced system is described. Accommodation of data transmission equipment, loop access, implementation of the digital line subscriber board and clock and test access board, and the maintenance scheme are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive algorithms for improving the throughput of CDMA packet radio networks

    Publication Year: 1989, Page(s):1078 - 1083 vol.3
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The authors present two adaptive techniques, involving route selection and channel access, which significantly improve the throughput and delay performance of a multihop, receiver-directed CDMA (code-division multiple-access) packet radio network. Routing is accomplished by choosing among potential next nodes in a distribution fashion, based on the simple metric of queue length. De facto preferenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network

    Publication Year: 1989, Page(s):400 - 407 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The design is discussed of the Locus family of networks rendering PC interface (PCI) service. Given are the expected user workload, the hardware costs, and the performance constraints. The workload consists of three classes of users: interactive, highly-interactive, and communication-intensive. The number of PCs is given and is equal to the number of users. It is shown that the problem can be redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architectural description of a new, easily expandable self-routing computer network topology

    Publication Year: 1989, Page(s):981 - 988 vol.3
    Cited by:  Papers (2)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The topology described applies to any general-purpose computer networking environment. The scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. The spiral technology features a simple internal self-routing algorithm that adapts quickly and automatically to failed nodes or links. The six most important... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Purely optical networks for terabit communication

    Publication Year: 1989, Page(s):887 - 896 vol.3
    Cited by:  Papers (65)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Emerging applications require a substantially higher bandwidth than the one offered by current networks. The authors propose a novel architectural approach that meets the high bandwidth requirements by introducing a communication architecture based on lightpaths, which are purely optical transmission paths in the network. Since lightpaths form the building block of the proposed architecture, its p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Telescience and high bandwidth networking

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (32 KB)

    Summary form only given. The requirements for high bandwidth networking to support telescience and the science community are discussed. High-rate sensors (such as synthetic aperture radars and high-resolution infrared spectrometer) can generate data at 300 Mb/s. Interaction with remote laboratories requires transmission of video images. Low delay is required for remote control, implying high bandw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On channel power sensing in terrestrial spread spectrum packet radio networks

    Publication Year: 1989, Page(s):1072 - 1077 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The author considers the possibility of obtaining performance gains by using channel power sensing in the channel access protocol of a terrestrial spread-spectrum packet radio network as a generalization of the CSMA (carrier-sense multiple-access) protocol of narrowband networks. Channel load sensing is viewed as a method of estimating the interference at the receiver based on the interference mea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of the token holding timer on MAP performance

    Publication Year: 1989, Page(s):342 - 347 vol.2
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Expressions are obtained for the mean excess token holding time for general service time distributions. They were used in the mean message delay approximations for both homogeneous token holding timer (THT) networks and nonhomogeneous THT and token rotating timer networks. Comparisons with simulation results indicated that these approximate formulas are quite accurate. The nonhomogeneous case cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of window type random-access algorithms for packet radio networks

    Publication Year: 1989, Page(s):505 - 511 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A method for delay distribution analysis of window random-access algorithms is presented. The window size is allowed to vary during the operation of the algorithm. It is shown that the quantities of interest can be obtained from the solution of appropriate infinite systems of linear equations. Once the constants and the coefficients of the unknowns of a system are determined, bounds on the solutio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Location of central nodes in time varying computer networks

    Publication Year: 1989, Page(s):193 - 199 vol.1
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A single-facility dynamic-network location problem with a continuous (rather than discrete) time domain is considered. It is assumed that the network state changes constantly and thus at each moment a different point may be the best choice for facility location. The cost of switching the facility from one node to another is taken into account because this switching consumes resources (although swi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing algorithms for Jacksonian networks with acknowledgement delays

    Publication Year: 1989, Page(s):749 - 757 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Load-balancing algorithms for Jacksonian networks are derived. The state of the network is represented by the total number of packets for which the source has not yet received an acknowledgement. The networks studied are subject to state-independent routing and state-dependent and state-independent flow control. The objective is to maximize the throughput of the network so that the end-to-end expe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Programmable Network Prototyping System

    Publication Year: 1989, Page(s):393 - 399 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The Programmable Network Prototyping System (PNPS), which is a rapid-prototyping tool used for emulating a wide variety of communication networks, is discussed. There are two parts to the PNPS hardware: the reusable hardware modules and the control and observation system. The reusable hardware modules consist of a channel emulator and a collection of node emulators. The channel emulator can be pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and analysis of systems with multimode components and dependent failures

    Publication Year: 1989, Page(s):972 - 980 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    A model is presented for the reliability and performance analysis of systems where components can go through degraded states in a statistically dependent manner. The model, called the cause-based multimode model (CBMM), is based on the idea that deviations of components from the `up' state have underlying physical causes which can be explicitly identified and are statistically independent. The eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-log2N self-routing networks and their applications in high speed electronic and photonic switching systems

    Publication Year: 1989, Page(s):877 - 886 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    A novel class of switching networks has been proposed to remove the time and space bottlenecks in conventional RAM-controlled switching architectures. The proposed networks possess many desirable characteristics for high-speed electronic and photonic switching systems, such as tolerance of faults, O(log2N) stages between each inlet-outlet pair, self-routing capability, easy pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multistage, multifaceted analysis of telecommunications network architectures

    Publication Year: 1989, Page(s):91 - 95 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    It is shown that a multilanguage approach can provide more useful feedback than the use of any single specification language by itself. The point is illustrated by an architectural model written in two executable specification languages, PAISLey and CSP. The model can be subjected to formal type checking, protocol analysis and timing analysis. In all three cases, a notion of consistency between de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Norton's theorem on queueing networks with finite capacities

    Publication Year: 1989, Page(s):914 - 923 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    A method is developed which allows the application of Norton's theorem on queuing networks with finite capacities. A node is arbitrarily selected and the subnetwork containing all remaining nodes is replaced by a composite node with infinite capacity; thus the entire network is reduced to a two-node network having the node of interest and the composite node. Although blocking causes interdependenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of high speed continuous stream data traffic in a broadband packet network

    Publication Year: 1989, Page(s):1063 - 1071 vol.3
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    With the advent of high-speed networks, there has been a tendency to simplify flow/congestion control functions at lower levels of the OSI model and relegate them to higher levels. This paper shows that a class of traffic, namely host-to-host file transfers, can experience severe degradation in performance due to lack of proper control in such networks. A simple distributed rate-based flow control... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized access control strategies for token passing systems

    Publication Year: 1989, Page(s):332 - 341 vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A very large class of access control strategies is proposed and studied for token passing systems, generalized from the timer-based approach. The idea is to assign transmission quotas dependent on past service times to control the token cycles dynamically while utilizing the token channel efficiently. The dynamics inherent in the control scheme are identified as an important issue and, under heavy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic analysis of complete sharing policy

    Publication Year: 1989, Page(s):1038 - 1046 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A model is considered which has several classes of customers arriving in independent Poisson processes at a multiserver facility and requiring a specific number of servers for a random period of time (arbitrarily distributed with a finite mean). If these servers cannot be provided, the customers are cleared. The problem is to determine the blocking probabilities. The exact expression is available ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast distributed shortest path algorithm for a class of hierarchically structured data networks

    Publication Year: 1989, Page(s):183 - 192 vol.1
    Cited by:  Papers (1)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    A distributed algorithm is presented which finds the shortest path from every node in the network to a given destination node. The network topology is assumed to be organizable into a generalized balanced-tree hierarchy (BH). The BH topology is introduced and characterized, and it is shown that most large interconnected data networks are of this type. It is also shown that the algorithm converges ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic analysis of a threshold load balancing policy

    Publication Year: 1989, Page(s):740 - 748 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A specific threshold load-balancing policy is described and analyzed for distributed computer systems in which each node executes job according to a priority schedule that depends on where the job originates. An approximate analysis is carried out to obtain the mean response time performance of the system in closed-form expression. In the analysis, it is assumed that the job transfers between node... View full abstract»

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

    Publication Year: 1989, Page(s):303 - 311 vol.1
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    General techniques are first examined for managing distributed information and how various evaluation criteria, when applied to the techniques, are affected by the parameters and scale of a problem. Then the use of the techniques and criteria is illustrated for the problems of locating service and server status information, as well as determining the current status of a user in a distributed envir... View full abstract»

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