By Topic

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Date 27-31 March 1988

Filter Results

Displaying Results 1 - 25 of 134
  • IEEE INFOCOM '88 - The Conference on Computer Communications Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies - Networks: Evolution or Revolution? (Cat. No.88CH2534-6)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • The architecture of a multicast broadband packet switch

    Publication Year: 1988, Page(s):1 - 8
    Cited by:  Papers (52)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    The authors propose an architecture that can switch hundreds of gigabits while meeting a wide variety of service requirements. The switch can be constructed out of a few atomic cell types with regular interconnection patterns. This simple structure lends itself to very effective VLSI implementation. The multicast packet switch consists of three internally nonblocking, self-routing subnetworks. Fir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-performance switch fabric for integrated circuit and packet switching

    Publication Year: 1988, Page(s):9 - 18
    Cited by:  Papers (38)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (743 KB)

    An architecture is described for a high-performance switching fabric that can accommodate circuit-switched and packet-switched traffic in a unified manner. The switch fabric is self-routing and uses fixed-length minipackets within the switching fabric for all types of connections. Its architecture provides full input/output connectivity paths with FIFO (first-in-first-out) queueing at each output.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast and broadcast services in a knockout packet switch

    Publication Year: 1988, Page(s):29 - 34
    Cited by:  Papers (50)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB)

    The knockout switch is a packet-switch architecture recently proposed for high-performance packet networks. In addition to providing point-to-point connections among user pairs, a packet network must often support multicast and broadcast capabilities. Multicast connections differ from point-to-point connections in that each packet is addressed to a number of destinations. Two specific approaches u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path allocation access control in fiber optic communication systems

    Publication Year: 1988, Page(s):35 - 44
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (418 KB)

    The authors consider a path-oriented channel allocation management. As opposed to multiaccess protocols of existing fiber-optic systems, in the proposed approach the outgoing channel of the source node and the incoming channel of the destination node are allocated time-sequentially, creating a time-dependent virtual path for all pairs of users. Using the time-oriented path allocation, the need for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fiber optic tactical voice/data network based on FDDI

    Publication Year: 1988, Page(s):45 - 54
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (805 KB)

    An asynchronous high-speed fiber-optic local area network is described that supports ordinary data packet traffic simultaneously with synchronous TI voice traffic over a common FDDI (fiber-optic distributed data interface) token ring channel. A voice interface module was developed that parses, buffers, and resynchronizes the voice data to the packet network. The technique is general, however, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fiber optic CDMA network for real-time communication

    Publication Year: 1988, Page(s):62 - 69
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB)

    An analysis is presented of a fiber-optic random-access network suitable for real-time communication. It is based on pure Aloha access discipline of a hybrid, time-wavelength, code-division-multiplexed channel. The network performance is determined as a function of the signaling parameters, number of active users, and their information rates. It is shown that the network throughput can be signific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An experience in estimating fault coverage of a protocol test

    Publication Year: 1988, Page(s):71 - 79
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (619 KB)

    A description is given of an experience in estimating fault coverage of a test sequence designed to test the control portion of a protocol. The control portion of this protocol is modeled as a finite-state machine. This study uses Monte Carlo simulation and introduces a novel notion of machine equivalence. An algorithm given checks for this notion of machine equivalence.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault coverage of protocol test methods

    Publication Year: 1988, Page(s):80 - 85
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB)

    The authors present an estimation of fault coverage of four protocol test sequences generation techniques (T-, U-, D-, and W-methods) using Monte Carlo simulation on a simple protocol machine. The ability of a test sequence to decide whether a protocol implementation conforms to its specification heavily relies upon the range of faults that it can capture. This study shows that a test sequence pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computer-aided design tool for protocol testing

    Publication Year: 1988, Page(s):86 - 95
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (549 KB)

    A computer-aided design tool is presented for designing test for protocols. CAD-PT accepts a formal specification in Estelle of the protocol and generates control and dataflow graphs on a graphic workstation. The tool is explained component-by-component, using a simplified ISO Class 2 transport protocol as an example.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of formal description techniques to the specification of distributed test systems

    Publication Year: 1988, Page(s):96 - 109
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (965 KB)

    As part of a planned transition by the US Department of Defense (DoD) from military standard to open systems interconnection (OSI) protocols, the National Bureau of Standards (NBS) is implementing and testing two application-layer gateways. NBS is applying description techniques developed within the International Organization for Standardization (ISO) and the Consultative Committee for Internation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent token ring protocol

    Publication Year: 1988, Page(s):145 - 154
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB)

    Concurrent token ring (CTR), a multiple-access protocol for ring-type area networks, is proposed. In CTR, message frames are partially removed by the destination node. A truncated portion of the frame, which contains the source and destination addresses, is configured by the destination into a conditional token which is allowed to circulate back to the source for removal. The conditional token inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access scheduling schemes using global information on local area networks

    Publication Year: 1988, Page(s):155 - 163
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB)

    Random access scheduling schemes for broadcast-bus-type local area networks are considered. It is found that a good access scheduling scheme not only has information about the number of packets to be scheduled, but which, more importantly controls the average of this number, which can be achieved by properly choosing the scheduling interval. Furthermore, this scheduling interval is updated in such... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance model for concurrent message transfer on Playthrough rings

    Publication Year: 1988, Page(s):164 - 173
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (801 KB)

    The authors present analytical models to approximate average message queueing time, service time, and token round trip time on ring topology local area networks that use a Playthrough protocol. Playthrough's data-link-layer protocol uses a continually circulating control token, source removed update control messages, and destination-removed data messages to achieve concurrent transfer of multiple ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a knowledge base for specifying multilayer architectures-application to internetworking

    Publication Year: 1988, Page(s):186 - 194
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB)

    The authors are concerned with the design of multilayer architectures in distributed systems and computer networks. First, they give the basic knowledge that any designer must have for designing, in a consistent way, a set of layers. This knowledge concerns the objects of a layer, their attributes and their relationships. Second, they consider an example of network interconnection, at the network ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of network down line road protocols

    Publication Year: 1988, Page(s):195 - 207
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (847 KB)

    The authors present the framework for a downline load service to which users subscribe to be properly loaded with their required code images. They review the user's requirements and present the outline of a service definition and protocol that satisfies the requirements. The analysis of downline-load protocol performance is given from the point of view of the time required to downline load a large... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection-based media access for multichannel local and metropolitan area networks

    Publication Year: 1988, Page(s):226 - 233
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (422 KB)

    A media access technique called MICON (Migratory Connection-Based Media Access) is presented for broadband local and metropolitan area networks. In the technique proposed, CSMA/CD (carrier-sense multiple access with collision detection) is combined with a dynamic channel assignment scheme applied to multichannel network architectures. By virtue of a controlled migration of users the channel select... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered dynamic bandwidth allocation in a tree metropolitan area network

    Publication Year: 1988, Page(s):244 - 253
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (547 KB)

    A tree metropolitan area network (MAN) is proposed that is based on a broadband cable, enabling bandwidth to be dynamically allocated between groups of stations in an integrated voice/data/video system. The stations are grouped into local area networks (LANs) according to the particular applications involved and also to their distance one from the other. A first goal of the proposed network is to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal joint load balancing and routing in message switched computer networks

    Publication Year: 1988, Page(s):274 - 281
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (597 KB)

    The load balancing and routing problems are combined as a single problem to capture the interaction between them. An optimization problem for joint load balancing and routing is formulated using a linear combination of the average job response time and average message delay as the performance criterion. Given an initial feasible solution, the Frank-Wolfe method is applied to solve the problem. An ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shortest-path algorithms for time-dependent networks

    Publication Year: 1988, Page(s):282 - 287
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 KB)

    The authors consider the shortest-path problem in networks in which the length (or weight) of the edges change with time according to arbitrary functions. They present algorithms for finding the shortest-path and minimum-delay under various waiting constraints and investigate the quality of the derived path. They also show that if departure time from the source node is unrestricted and delay funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control and accounting of user access to a PDN from private X.25 data networks

    Publication Year: 1988, Page(s):314 - 319
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB)

    Methods have been developed in a DFN (Deutsches Forschungs-Netz) project for checking access rights of calls into the DATEX-P public network and recording costs which can be assigned to users. This is done using a gateway computer. The methods which can be used for interactive services using X.3, X.28 and X.29, and for level-7 services, are discussed. Experience with a prototype gateway computer i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On non-blocking properties of parallel delta networks

    Publication Year: 1988, Page(s):326 - 333
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    The definition of a class of N*N interconnection networks called the parallel delta network (PDN) is studied. For this class of networks the nonblocking conditions are given. In particular, by the graph colouring technique, it has been proved that the minimum number of delta subnetworks (L) necessary to provide the nonblocking property is L=n where n is the size of the basic switching element and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing in space-division packet switching

    Publication Year: 1988, Page(s):334 - 343
    Cited by:  Papers (20)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The authors study the performance of four different approaches for providing the queuing necessary to smooth fluctuations in packet arrivals to a space-division packet switch. They are (1) input queueing, where a separate first-in, first-out (FIFO) buffer is provided at each input to switch; (2) input smoothing, where a frame of b packets is stored at each of the N input lines to the switch and si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of buffered Banyan networks under nonuniform patterns

    Publication Year: 1988, Page(s):344 - 353
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB)

    The authors present an analytical method to evaluate the performance of the buffered Banyan packet-switching network under nonuniform traffic patterns. It is shown that the nonuniform traffic can have a detrimental effect on the performance of the network. The analytical model is extended to evaluate the performance of multibuffer and parallel Banyan networks. These modified networks are shown to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ShuffleNet: an application of generalized perfect shuffles to multihop lightwave networks

    Publication Year: 1988, Page(s):379 - 390
    Cited by:  Papers (115)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (794 KB)

    The authors propose a multihop wavelength-division-multiplexing (WDM) approach, referred to as ShuffleNet, for achieving concurrency in distributed lightwave networks. ShuffleNet can be configured with each user having as few as one fixed-wavelength transmitter and one fixed-wavelength receiver, avoiding both wavelength agility and pretransmission coordination problems. Still, the network can achi... View full abstract»

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