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 (53)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 construction of a broadcasting schedule of minimum length is NP-complete, and then a centralized algorithm based on a sequential graph-coloring heuristic is presented to construct minimal-length schedules. A distributed implementation of this algorithm is then proposed, which is based on circulating a token through the nodes in the network.<> 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
    Save to Project icon | Request Permissions | PDF file iconPDF (9 KB)  
    Freely Available from IEEE
  • An asymptotic analysis of a threshold load balancing policy

    Publication Year: 1989 , Page(s): 740 - 748 vol.2
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 nodes are Poisson processes. It is proved that the Poisson assumption on the job transfers is asymptotically exact (and hence the performance predictions of the model is asymptotically exact) as the number of nodes in the system increases. Simulations studies reveal that the Poisson job transfer assumption is good for small systems containing several nodes when one is interested in obtaining the response time performance of the system 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)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 expected packet time delay does not exceed an upper bound. The optimal flow control is shown to be of a window type, while the routing policy balances the traffic inside the network. Several load-balancing algorithms are evaluated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation with load balancing consideration in distributed computing systems

    Publication Year: 1989 , Page(s): 758 - 765 vol.2
    Cited by:  Papers (1)  |  Patents (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (572 KB)  

    A new resource allocation model is presented in which a given number of copies of a single resource are allocated to the processing sites in such a way that the total communication cost incurred is minimized. The accessing scheme considers both the communication costs and the load levels at the resource sites. Load leveling is imposed as a constraint. This improves system throughput as well as response time. The allocation provided by the model reflects the realistic environment more accurately and therefore gives a better dynamic performance. It is shown that the model can be extended to include other costs such as installation cost and communication cost due to `write' accesses 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)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 preference is given to congested nodes by the channel access protocol, based on queue length ratios, in order to increase their (outbound) throughput without increasing the number of channel collisions. These algorithms have the effect of spreading network traffic more evenly across the network, thereby alleviating the congestion at bottleneck nodes, so that network throughput approaches that analytically predicted using a homogeneity assumption. Simulation results are presented which quantify the achieved improvement for networks with varying connectivity fractions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FTAM test design using an automated test tool

    Publication Year: 1989 , Page(s): 251 - 260 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (636 KB)  

    An experience is presented with an automated test design tool for functional analysis and test derivation of distributed systems formally specified using Estelle, a description technique based on an extended finite-state machine model. The tool accepts a formal specification of the system and generates control, data flow graphs, and unparameterised test sequences. The tool has been used, on an experimental basis, for conformance test design of ISO File, Transfer, access and Management protocols View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formalization of ISDN LAPD for conformance testing

    Publication Year: 1989 , Page(s): 234 - 246 vol.1
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (896 KB)  

    Usefulness of a formalization of the specification of ISDN LAPD is demonstrated for designing and developing a comprehensive set of conformance tests. Since many protocol standards are specified in a natural language (i.e., English), a method for formalizing protocol specifications with a view to a number of validation activities, including conformance testing, is also presented. In particular, it is shown how to utilize the state-transition-oriented approach to automatically generate a major component of standard conformance test suites. The use of formalized specifications is also illustrated for verifying the specification by selective executions, and for validating conformance test cases against the specification View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks

    Publication Year: 1989 , Page(s): 800 - 809 vol.3
    Cited by:  Papers (77)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (716 KB)  

    The Manhattan Street Network (MS-Net) and Shuffle-Exchange Network (SX-Net) are two-connected networks with significantly different topologies. Fixed-size packets are transmitted between nodes in these networks. The nodes are synchronized so that all of the packets that are received by a node within a slot transmission time arrive at a switching point simultaneously. Instead of storing large numbers of packets at intermediate nodes, a deflection strategy similar to hot-potato routing is used. There are characteristics of the MS-Net that make it well suited for deflection routing. With no buffer, 55-70% of the throughput with an infinite number of buffers has been obtained; with a single buffer per node, the throughput increases to 80-90%. With uniform load the throughput does not decrease significantly as the network utilization increases. Therefore, additional flow control mechanisms are not required to achieve the highest network throughput. The SX-Net does not have the above characteristics of the MS-Net. However, deflection routing still provides a significant portion of the available throughput. In the SX-Net, more buffers are required than in the MS-Net, and a flow control mechanism must be used to achieve the greatest throughput View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSMa/CD with two persistence factors: a unified performance model for CSMA/CD

    Publication Year: 1989 , Page(s): 152 - 162 vol.1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB)  

    CSMA/CD (carrier-sense multiple-access with collision detection) protocols with two persistence factors is presented. One factor is used to define the protocol action if a station becomes ready when the channel is busy, and the other one is the normal persistence factor used to determine transmission rights. A family of new protocols is described which corresponds to different values of the persistence factors. The performance model of this protocol also acts as a unified performance model for the slotted CSMA/CD protocol with finite population. The non-persistent, 1-persistent and p-persistent variants of the CSMA/CD protocol can all be modeled as special cases of this general model. In addition to average performance measures, the output process and the packet delay time distributions are evaluated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An error control technique for high data rate communication networks

    Publication Year: 1989 , Page(s): 594 - 601 vol.2
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (388 KB)  

    A new method is discussed for modifying majority-logic convolutional decoders for use in a type-I hybrid-ARQ protocol. In standard forward error correcting (FEC) operation, these decoders generate reliability information in the form of orthogonal sets of parity check sums. The modified decoder uses this information to identify received packets whose decoded data may be unreliable and to request retransmission of these packets. It is shown through analysis and simulation that the resulting error control system provides substantially higher data reliability than its FEC counterpart at the expense of a very small reduction in data throughput View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple packet multiple channel CSMA/CD protocols for local area networks

    Publication Year: 1989 , Page(s): 163 - 172 vol.1
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (744 KB)  

    Multiple-channel architectures have been proposed for broadcasting-based local area networks to overcome the problem of deteriorating performance when a very high speed communication channel is used. Such networks are called multiple-channel local area networks (M-LANs). In a carrier-sense multiple-access with collision detection (CSMA/CD) protocol designed for M-LANs (M-CSMA/CD), a ready station selects only one channel to transmit its packet according to some channel selection mechanism. A new CSMA/CD protocol for M-LAN architecture is proposed by which a station may select and try to transmit the same packet on K channels (K⩾1). If it has been successfully transmitted on more than one channel after the end-to-end propagation delay, it randomly selects one channel to finish its transmission and immediately stops its transmission on the rest of the channels. This is called the multipacket multichannel CSMA/CD protocol (MM-CSMA/CD). The performance of the proposed MM-CSMA/CD protocol can be shown to be potentially better than that of the M-CSMA/CD protocol and the traditional CSMA/CD protocol View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SFPS: a synchronous fast packet switching architecture for very high speeds

    Publication Year: 1989 , Page(s): 641 - 646 vol.2
    Cited by:  Papers (1)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (476 KB)  

    A switching architecture, synchronous fast packet switching (SFPS), is proposed whereby an optical space switch provides a circuit-switching type of transmission to applications with rigid delay requirement and continuous traffic pattern (e.g., video). A fast packet switch fabric is connected to the space switch to handle packets of more conventional applications. The transmission scheme and the switch design are described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparative performance study of various congestion controls for ISDN frame-relay networks

    Publication Year: 1989 , Page(s): 674 - 675 vol.2
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (188 KB)  

    Detailed simulation results are presented to illustrate the throughput performance of various congestion control schemes that have been considered when using link access protocol D as the level-2 protocol. Three classes of adaptive window schemes, all of which use implicit detection, are examined. In all of them, receiving a REJECT frame (which is sent by the far end when it receives an out-of-sequence frame) is interpreted as a sign of congestion, and the control action taken by the end-systems is in the form of reducing their layer-2 window. It is shown that these schemes perform fairly well over a wide range of network parameters and traffic patterns, with one in particular providing a very robust performance over the range. It involves reducing the window size to 1/2 upon receiving a REJECT frame View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized parallel delta networks: a new class of rearrangeable interconnection networks

    Publication Year: 1989 , Page(s): 219 - 226 vol.1
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (580 KB)  

    The definition is presented of a class of N×N multistage interconnection networks called generalized parallel delta networks (GPDNs). This class includes the already known replicated delta networks (RDNs) and parallel delta networks (PDNs). For GPDNs, the rearrangeability condition is given and a routing algorithm for the establishment of any set of connection requests is presented. The proposed algorithm operates for GPDNs composed of 2q×2 q switching elements and it is able to set up any permutation with a time complexity equal to O(N log2 N). The applicability of RDNs, PDNs, and other GPDNs for the implementation of rearrangeable topologies is investigated. In particular, it is proved that if large networks (N>256) have to be implemented, GPDNs require a smaller number of switching elements than RDNs or PDNs 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
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 reduced to a discrete capacity and flow assignment (CFA) problem. The backbone capacity assignment is inspired by the Lagrangian decomposition approach. It starts from a backbone capacity assignment which matches the initial flow and chooses a backbone server upgrade that gives the greatest response-time reduction per dollar. At this point, the flow deviation method is applied and iteration is continuous until the constraints are met. Several computational examples of network configuration synthesis are presented that emphasize the significance and generality of the results obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of mobile packet radio networks

    Publication Year: 1989 , Page(s): 1084 - 1088 vol.3
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 effect cannot be obtained by classical two-dimensional Poisson model. It is found that an optimal power radius is dependent on the node mobility View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated services local area network with hybrid access

    Publication Year: 1989 , Page(s): 439 - 447 vol.2
    Cited by:  Papers (1)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (512 KB)  

    A broadcast-bus type of integrated services local area network with hybrid access is proposed. The proposed media access protocol, slot reservation-CSMA/CD, uses an adaptive speech coding technique to provide a TDMA-like service to voice stations and a CSMA/CD-type service to data stations. Hence, contention between voice stations is totally avoided and contention between voice and data stations is kept to a very low level View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadband communications: the commercial impact

    Publication Year: 1989 , Page(s): 602 - 610 vol.2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (484 KB)  

    Research carried out by Ovum for its report of the same title, published in 1987, is summarized and updated. The major technologies and commercial applications underlying the development of broadband communications are outlined, and the speed of its introduction is forecast. The picture emerging in the four countries studied here (the United States, United Kingdom, France and West Germany) is one of islands of fiber in major commercial centers. Once these are in place, it will not be too costly to introduce broadband switches, supporting niche applications on an overlay basis 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)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 in an asynchronous environment. Therefore, some of the difficulties associated with synchronizing the order of events can be avoided in the actual implementation of the proposed algorithm 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 (60)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | 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 performance hinges on their efficient establishment and management. The authors shown that although the problem of optimally establishing lightpaths is NP-complete, distributed heuristics provide near-optimal solutions for several of the basic problems presented by the lightpath architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Switch access architecture for quad voice lines with data on-demand per ISDN BRI

    Publication Year: 1989 , Page(s): 647 - 654 vol.2
    Cited by:  Papers (2)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (600 KB)  

    A single international-standard ISDN (integrated services digital network) basic rate interface (BRI) has been arranged so that a data terminal and either two, three, or four voice terminals can be operated simultaneously through the interface. The switch access architecture for quad voice lines with data-on-demand ISDN BRI (basic rate interface) is introduced. The BRI S/T interface bit framing requirements and the Q.931 call control procedures required for the new service are discussed. The results show that relatively simple additional hardware could be used to upgrade an existing ISDN 5ESS switch to quad voice lines with data capability per BRI View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markov chain analysis of packet-switched banyans with arbitrary switch sizes, queue sizes, link multiplicities and speedups

    Publication Year: 1989 , Page(s): 960 - 971 vol.3
    Cited by:  Papers (33)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (844 KB)  

    Approximate Markov chains for the performance of banyan networks built with basic switches of arbitrary size containing input queues, output queues or a combination of input buffers and output queues are presented. These chains are also extended to model banyans where each link is replaced by a number of parallel links. Comparison with simulations indicates that the chains are reasonably accurate for practical network loads. It is shown that banyans built with switches containing a combination of single input buffers and output queues outperforms banyans built with switches containing only input queues or only output queues. Banyans built with larger nodes are shown to outperform banyans built with smaller nodes. It is shown that banyan-based networks with multiple links can be designed to have extremely low blocking probabilities View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal selection of multicast groups for resource location in a distributed system

    Publication Year: 1989 , Page(s): 312 - 321 vol.1
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (676 KB)  

    A protocol is presented to locate (or find) named resources in a distributed system which uses the multicast capabilities of the underlying network. Each node in the network uses a sequence of node groups, and each node group is associated with a unique multicast address. To locate a resource, the searching node sequentially polls each one of the groups until the resource is found; this scheme is a generalization of both pure polling and broadcast. To obtain an optimal division of the nodes into multicast groups, the protocol is analyzed and an efficient algorithm is given that provides a group division minimizing the expected cost per location operation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On generalizations in networking software to encourage code portability

    Publication Year: 1989 , Page(s): 261 - 267 vol.1
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (496 KB)  

    The principal issues involved in porting networking software are discussed and solutions that have been used to implement a standard environment interface to encourage code portability are reported. This interface has been designed to provide a uniform environment to protocol drivers generated by the Archetype language compiler. The structure of the present implementation is outlined and issues relating to the environment interface are elaborated. The implementation provides both portable data representation and portable systems services View full abstract»

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