INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

7-11 April 1991

Filter Results

Displaying Results 1 - 25 of 168
  • Algorithms for routing in a linear lightwave network

    Publication Year: 1991, Page(s):1 - 9 vol.1
    Cited by:  Papers (24)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Routing algorithms are proposed for setting up calls on a circuit-switched basis in linear lightwave networks (LLN), i.e., networks composed only of linear components, including controllable power combiners and dividers, and possibly linear (non-regenerative) optical amplifiers. The overall problem is decomposed into three subproblems: (1) physical path allocation, (2) checking for violations of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum fragmentation internetwork routing

    Publication Year: 1991, Page(s):289 - 294 vol.1
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The problem of minimizing the internetwork packet fragmentation cost by selecting an appropriate route from the origin to the destination network is investigated. It is shown that this problem is NP-complete, and optimal (minimum fragmentation cost) paths cannot be computed by fast algorithms when the intranetwork strategy is used. Then, the internetwork fragmentation strategy is considered, and a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the equivalence of IEEE 802.4 and FDDI timed token protocols

    Publication Year: 1991, Page(s):435 - 440 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (542 KB)

    Two timed token protocols, the IEEE 802.4 and FDDI (fiber distributed data interface), are considered. Although IEEE 802.4 and FDDI have similar protocol rules, the different method of measuring the duration of the generic token rotation has imposed separate analyses for the two protocols. Presented is a general proof of equivalence between IEEE 802.4 and FDDI networks, where both consist of queue... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE INFOCOM '91. The Conference on Computer Communications. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s (Cat. No.91CH2979-3)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE
  • Systematic design of a network gateway using FDT LOTOS

    Publication Year: 1991, Page(s):1344 - 1352 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The design and partial implementation of a network gateway (an intermediate system) using the formal description technique (FDT) LOTOS are described. The requirements capturing process and the formalization process that results in an abstract and formal description of the gateway are described. This description is then refined through a series of functionality decomposition steps. It is claimed th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput-delay and stability analysis of an asynchronous spread spectrum packet radio network

    Publication Year: 1991, Page(s):1334 - 1343 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A continuous-time Markov chain model for an asynchronous spread spectrum packet radio network is presented. The network consists of N fully connected nodes, and the radios in all nodes are identical. Packets arrive at each node and are retransmitted when lost, both according to Poisson processes with different rates, and packet lengths are exponential in distribution. A simple threshold a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The receiver and transmitter code sensing protocol and its applications in distributed CDMA networks

    Publication Year: 1991, Page(s):1326 - 1333 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A new collision-avoiding protocol, the receiver-and-transmitter (R&T) code-sensing protocol, is formulated and its performance upper bounds are numerically analyzed. The results reveal that a high throughput and a stable performance of a distributed code-division multiple-access (CDMA) packet radio network can be achieved by broadcasting both transmitter and receiver codes into the shared CDMA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy

    Publication Year: 1991, Page(s):1168 - 1177 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Motivated by token-passing protocols in LANs, a system of multiple queues, attended by a cyclic server, is considered. The server will switch from the ith queue to the next when either Ki customers are served consecutively or the queue is empty, whichever comes first. Using the pseudoconservation laws, an approximation method is developed to obtain the mean waiting time for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability analysis for persistent CSMA/CD systems

    Publication Year: 1991, Page(s):1316 - 1325 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The concepts of expected drift and first exit time are applied to address the stability issue of a generic p-persistent carrier sense multiple access with collision detection (CSMA/CD) protocol that includes the nonpersistent and 1-persistent protocols as special cases. Both slotted and nonslotted operations are treated. By utilizing the zero-drift condition as an input-output balance con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A proposal for interconnecting FDDI networks through B-ISDN

    Publication Year: 1991, Page(s):1160 - 1167 vol.3
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The problem of a transparent interconnection of remote fiber distributed data interface (FDDI) networks, through broadband ISDN (B-ISDN), forming an internet which could be defined as an extended FDDI is investigated. A hybrid interworking method is proposed that keeps connectionless transfer mode on FDDI and a connection-oriented mode on B-ISDN. The major focus of this work is on a bandwidth allo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preassigned retransmission slots multiple access scheme (PARS)

    Publication Year: 1991, Page(s):1306 - 1315 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A new multiple-access scheme for a finite number of stations, called preassigned retransmission slots (PARS), is introduced. The delay-throughput performance of the algorithm has been analyzed under single buffer assumption, and simulated under the infinite buffer assumption. Both performance studies show that the algorithm is stable and performs like slotted-ALOHA in light traffic situations and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple design algorithms for interconnected bus networks

    Publication Year: 1991, Page(s):1151 - 1159 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Simple strategies are analyzed for the layout of networks of interconnected buses. The networks considered have topologies of a square grid and a mesh of cubes of buses. These regular topologies have properties that are desirable for very large high-speed networks. The objective of the design strategies is to minimize the maximum bus length. To demonstrate the effectiveness of the algorithms, it i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time slot assignment in TDM multicast switching systems

    Publication Year: 1991, Page(s):1296 - 1305 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The time slot assignment problem is studied in time-division multiplexing (TDM) switching systems which can support multicast transmissions. It is shown that this problem is NP-complete, i.e., computationally intractable. Two effective heuristic algorithms are proposed. To evaluate and compare the performance of these algorithms, a lower bound on the solution of this problem is derived and compute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cost-based scheduling algorithm to support integrated services

    Publication Year: 1991, Page(s):741 - 753 vol.2
    Cited by:  Papers (12)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    Heuristic scheduling and dropping algorithms are presented for improving the efficiency of single packet-switched networks with diverse traffic. In the authors approach, arbitrary performance objectives are defined in the form of cost functions, which map the queueing delay experienced by each packet to a cost incurred. The algorithms, cost-based scheduling (CBS) and cost-based dropping (CBD), the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth advertising for MAN/ATM connectionless internetting

    Publication Year: 1991, Page(s):1145 - 1150 vol.3
    Cited by:  Papers (10)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A preliminary proposal is made for a new approach to connectionless traffic handling in asynchronous transfer mode (ATM) networks. The approach is based on available bandwidth information on the virtual path (VP) periodically supplied by the network to the gateway (bandwidth advertising). The knowledge of available bandwidth allows the gateway to inject (with relatively low risk of cell loss) shor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A recursive multistage structure for multicast ATM switching

    Publication Year: 1991, Page(s):1289 - 1295 vol.3
    Cited by:  Papers (15)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A recursive multistage structure for multicast asynchronous transfer mode (ATM) switching is proposed, based on a connection network with a copying facility and external links connecting the outlets to the inlets. While the network generates only a few copies of an output multicast cell, the remaining are obtained by recycling the output copied cells to the corresponding inputs as many times as ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating minimal length test sequences for conformance testing of communication protocols

    Publication Year: 1991, Page(s):970 - 979 vol.2
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A new technique of generating a test sequence for conformance testing of communication protocols is presented. This approach shows that it is possible to generate optimal length test sequences which include multiple unique input output sequences that overlap under certain conditions. In the absence of these conditions, a heuristic technique is used to obtain sub-optimal solutions, which show signi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the packet size in integrated networks

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

    The authors address the selection of a single packet size for broadband integrated packet networks (e.g., B-ISDN) that carry many traffic types, each with different performance requirements. To meet the requirements of different types of traffic in an integrated network (for example, synchronous stream traffic and delay sensitive bursty traffic, or two different types of synchronous traffic), the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load sharing and shortest-path routing in transparently interconnected local area networks

    Publication Year: 1991, Page(s):1135 - 1144 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    A new transparent bridging scheme, called the source dependent spanning tree (SDS), is presented in which bridges observe broadcast packets from active hosts to create the shortest path trees for these hosts dynamically. Issues related to packet forwarding in the presence of multiple trees are identified and algorithms for addressing these issues are presented. Some important properties of SDS, su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-speed packet switch architecture with a multichannel bandwidth allocation

    Publication Year: 1991, Page(s):155 - 162 vol.1
    Cited by:  Papers (1)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A novel packet switch architecture is proposed based on a channel grouped virtual circuit (CG-VC) scheme for high-speed communication networks. The case is considered in which there are several parallel channels between two switching nodes. The CG-VC scheme allows a packet to select an available channel in such a way as to avoid congested channels using a simple, hardware-based, self-routing mecha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Growing binary trees in a random environment

    Publication Year: 1991, Page(s):638 - 647 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A study is made of a class of binary trees that grow in a random environment, where the state of the environment can change at every vertex of the trees. Such trees arise in multiaccess communication. The trees considered are single-type and two-type binary trees that grow in a two-state Markovian environment. For each kind of tree, the conditions on the environment process for extinction of the t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast source routing in packet-switched networks

    Publication Year: 1991, Page(s):1284 - 1288 vol.3
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    An address coding mechanism is presented for multicast source routing packets in packet-switched networks. A simple algorithm for processing these address codes at intermediate output link adaptors is presented. It involves only the recognition of a particular link label at the front part of the address code and the stripping off of a front segment of the address code and so can easily be implemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing protocol converters with guaranteed service

    Publication Year: 1991, Page(s):960 - 969 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The authors consider the conformity property, i.e. that the protocol converters providing communication between different networks meets the service specified by the designer, in constructing protocol converters. Using the top-down approach, an algorithm consisting of the following five steps is proposed to construct a protocol converter: (1) construction of a system graph from the given input; (2... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a virtual circuit connection in a high speed ATM WAN using the best effort delivery strategy

    Publication Year: 1991, Page(s):1377 - 1385 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    An analytical approach is provided for determining the performance of a virtual circuit connection for data transmission in high speed asynchronous transfer mode (ATM) network buffers at wide area network (WAN) nodes. The analysis assumes that the network operates using the best effort delivery strategy and that the end-to-end virtual circuit is responsible for guaranteeing the integrity of the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of multihop lightwave networks with hot potato routing and distance-age-priorities

    Publication Year: 1991, Page(s):1012 - 1021 vol.3
    Cited by:  Papers (25)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A network is studied in which contention for an outbound link is resolved by assigning to each packet a priority based on its distance to destination and its age (number of misroutes previously suffered). Queueing delay, lost packet performance and network aggregate capacity (saturation throughput) are compared for distance-age prioritization, age-distance prioritization and no prioritization. Res... View full abstract»

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