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
  • A high speed protocol processor to execute OSI

    Publication Year: 1991, Page(s):944 - 949 vol.2
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    A high-speed open systems interconnection (OSI) protocol processor is described which is intended for use in LAN adapters. The processor uses recently developed hardware for normal data transfer on layer 2 (LLC class 1), layer 3 (CLNP) and layer 4 (TP4). Connection control and abnormal data transfer (i.e. error handling) of OSI are executed by a general purpose microprocessor. In an experimental s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of synchronous and asynchronous algorithms in multiclass networks

    Publication Year: 1991, Page(s):939 - 943 vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (408 KB)

    The Nash equilibrium point for optimum flow control in a noncooperative multiclass environment is studied. Convergence properties of asynchronous as well as synchronous algorithms are investigated. The convergence of a greedy algorithm for the n users case is proved, and necessary and sufficient conditions for the convergence of asynchronous algorithms are obtained. Since asynchronous alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATM system buffer design under very low cell loss probability constraints

    Publication Year: 1991, Page(s):929 - 938 vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (712 KB)

    This work deals with a general method for buffer design in an ATM system in which the target loss probability should be very low (e.g. less than 10-9). This method is based on the application of the generalized extreme value theory (GEVT) to results arising from simulation runs. This theory allows the estimation of very small probabilities which would not be evaluable with the tradition... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of simple error control protocols under correlated packet losses

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

    A study is made of the effect of correlated packet losses for some simple automatic repeat request (ARQ) protocols: go-back-∞, and Blast. The packet losses are modeled by a two state Markov chain and it is assumed that the round trip delay is random. Expressions are derived for the z-transform and the first and second moments of the time [τ], taken to successfully transmit N... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some performance aspects of trading service design

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

    The first systematic investigation is presented of the consequences of using out-of-date load information in a server selection process. The authors suggest a selection policy allowing for the use of significantly outdated information and demonstrate the possible consequences of client autonomy, i.e. of clients using other server selection rules, such as the one suggested in the common trading con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to generating network requirements

    Publication Year: 1991, Page(s):754 - 763 vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (500 KB)

    A formal technique is presented for generating traffic matrices for distributed data networks. Traffic matrices are used by engineers to design new networks or, more typically, plan for changes in an existing network. The technique combines measured data from proposed design changes to calculate a set of traffic matrices. Network hardware and applications are defined by a weighted connection matri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution of the total delay of packets in virtual circuits

    Publication Year: 1991, Page(s):911 - 918 vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    In some computer network architectures a process communicates with another process across the network by establishing a virtual circuit. Consider a virtual circuit from node S to node D connected by multiple links. The delay suffered by the packets of the virtual circuit has three components: waiting time or queueing delay, service time or transmission delay, and resequencing del... 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.
  • Fiber optic configurations supporting confidentiality in passive DQDB systems

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

    A method is proposed to support confidentiality in broadcast fiber-optic LAN/MAN (local/metropolitan area network) systems. This approach, which is different from the conventional approach, is based on a fundamental property of fiber optics, viz., optical bidirectionality. That is, two distinct transmissions in opposite directions can occur simultaneously on the same channel. This property can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ALOHA/slotted-CSMA protocol for a very high-speed optical fiber local area network using passive star topology

    Publication Year: 1991, Page(s):1510 - 1515 vol.3
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (384 KB)

    A protocol for a multiuser very high-speed optical data network based on a passive star topology is presented and analyzed. The users' traffic is assumed to be bursty as in the case of computer communications. Tunable transmitters and receivers which are capable of tuning to N+1 relatively stable wavelengths are required to be cross-connected via a passive optical star coupler to the othe... 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.
  • Analysis of a packet switch with input and output buffers and speed constraints

    Publication Year: 1991, Page(s):694 - 700 vol.2
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (452 KB)

    A nonblocking N×N switch for high speed packet switching networks is considered. In practice such a switch may operate L times faster than the input/output trunk. When 1< L<N, the switch would require buffers at input as well as at output ports to keep the packet loss probability and delay within some desirable limits. An analysis is made of... View full abstract»

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

    Publication Year: 1991, Page(s):579 - 588 vol.2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (812 KB)

    A study is made of an extension of the classical methods used to evaluate blocking probability. This method is applicable to multirate circuit and fast packet/ATM switching systems. The analytical methods are presented and compared with simulation results for Benes networks. Extensive simulation has been performed examining blocking in Benes networks. These simulations focus on ways to reduce bloc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair access of multi-priority traffic to distributed-queue dual-bus networks

    Publication Year: 1991, Page(s):889 - 900 vol.2
    Cited by:  Papers (19)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (852 KB)

    Bandwidth balancing is a procedure that gradually achieves a fair allocation of bandwidth among simultaneous file transfers on a distributed-queue dual-bus (DQDB) network. Bandwidth balancing was originally designed for traffic of a single priority level. Three ways are demonstrated to extend this procedure to multi-priority traffic View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed code assignments for CDMA packet radio networks

    Publication Year: 1991, Page(s):1500 - 1509 vol.3
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (836 KB)

    Two-phase algorithms are devised to assign and reassign spread-spectrum codes to transmitters, to receivers, and to pairs of stations in a large dynamic packet radio network (PRN) using code-division multiple access (CDMA). The algorithms minimize the time complexity in the first phase and minimize the number of control packets needed to be exchanged in the second phase. A new pairwise code-assign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing performance with impatient customers

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

    The problem of scheduling impatient customers in a non-preemptive G/GI/1 queue is considered. Every customer has a random deadline to the beginning of its service. Given the distribution of the customer deadlines (rather than their exact values), a scheduling policy decides the customer service order and also which customer(s) to reject. The objective is to find an optimal policy which maximizes t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of cyclic-priority input access method for a multicast switch

    Publication Year: 1991, Page(s):1189 - 1195 vol.3
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (428 KB)

    A study of the performance of a cyclic-priority input access mechanism for a multicast switch is carried out. The method is a derivative of the ring token reservation method which eliminates the unfairness of the ordinary ring token reservation. It has the further advantage of being simple and easy to implement. The primary performance measurements are the switch throughput and the packet delay. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effect of caching on routing-table lookup in multimedia environment

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

    An attempt is made to investigate the validity and effectiveness of caching for routing-table lookup in multimedia environments. Multimedia traffic, like voice, data and video, is characterized by the burstiness which is represented in terms of the coefficient of variation. The general expression obtained from an approximate analysis of the cache scheme proposed indicates that the burstiness of tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient time-slot assignment algorithms for SS/TDMA systems with variable-bandwidth beams

    Publication Year: 1991, Page(s):658 - 667 vol.2
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (852 KB)

    The authors present efficient sequential and parallel algorithms for computation of time-slot assignments in SS/TDMA (satellite-switched/time-division multiple-access) systems with variable-bandwidth beams. These algorithms are based on modeling the time-slot assignment (TSA) problem as a network-flow problem. If M (N) is the number of uplink (downlink) beams, L is the l... 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.
  • Routing in multi-domain networks

    Publication Year: 1991, Page(s):257 - 264 vol.1
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    The problem of management and control in a large and, for simplicity, homogeneous packet-switched network is investigated. In particular, routing is considered as an important function of network management. The network consists of several individually controlled domains interconnected via gateway links. Each domain is controlled by its own network control center, while the overall network perform... View full abstract»

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