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 (23)  |  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
  • 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.
  • Performance analysis of slotted replication Aloha over fading communications channels

    Publication Year: 1991, Page(s):228 - 236 vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The average throughput, average delay, and the first exit time performances are determined for a slotted two-packet replication Aloha protocol in a fading communications channel environment using a two-state Gilbert (1960) channel error model with memory. Comparison to slotted Aloha without replication shows that a smaller total average delay can be achieved by using two-packet replication. Averag... 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.
  • Fair charging policies and minimum-expected-cost routing in internets with packet loss

    Publication Year: 1991, Page(s):279 - 288 vol.1
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    An economics-based definition of fair pricing is proposed, and fair, simple, and mathematically sound charging policies are derived that properly handle costs and risks in lossy internetworks. Also described are simple and efficient source-based algorithms (having both link-state and distance-vector versions) for computing the optimal routing tables with respect to the new charging measures. These... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective routing in integrated services networks: A game theory approach

    Publication Year: 1991, Page(s):1220 - 1227 vol.3
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    The multiobjective routing problem in multiple-class integrated services networks is presented. A multiserver two-class queuing model is introduced, where packets from the first class can be queued, while packets from the other class are blocked when the number of packets in the system exceeds some threshold. Therefore, the first class wants to minimize its average packet delay, while the other cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slotted ALOHA in high speed bidirectional bus networks

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

    The performance of the slotted ALOHA multiple access protocol in a high-speed bidirectional passive bus network, where transmissions are in the form of packets of constant length, is studied. Slotted ALOHA is generally considered to have better throughput performance than unslotted ALOHA, whose maximum throughput is known to be 1/(2e), independent of station configuration. It is shown that, with a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of protocols for collecting responses over a multiple-access channel

    Publication Year: 1991, Page(s):1490 - 1499 vol.3
    Cited by:  Papers (8)  |  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A generalization of the multiple access problem is considered where it is necessary to identify a subset of the ready users, not all. The problem is motivated by several response collection applications that arise in distributed computing and database systems. In these applications, a collector is interested in gathering a set of responses from a number of potential respondents. The collector and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correcting remote references to a server in distributed operating systems

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

    Protocol mechanisms are described to locate and correct stale references to a server. In a first round of correction, the protocols do not strive to correct the references atomically, i.e., clients can use the references before correction is completed. This is because locating all references may be difficult and cause unbounded delay since they may be deeply buried in the distributed computations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity database overhead for inter-domain policy routing

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

    Policy routing protocols incorporate policy related constraints into the route computation and packet forwarding functions for inter-administrative domain (AD) communication. However, this functionally exacerbates the already critical problem of routing information distribution and storage overhead in very large internets (e.g., 100000 ADs). The authors investigate the scalability of the inter-dom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SONET-a network management viewpoint

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

    SONET (synchronous optical network) ANSI T1 optical interface rates and formats specification defines feature sets and functionality for the next generation lightwave transmission systems to be used in the public telephone networks. The author emphasizes three benefits this new technology will provide to the network for future applications, i.e., optical midspan meet, flexible bandwidth for future... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed algorithms for computing shortest pairs of maximally disjoint paths in communication networks

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

    Distributed algorithms are presented for finding two maximally disjoint paths of minimum total length from each possible source node to a destination, including both node-disjoint and link-disjoint versions of the algorithm. A synchronous algorithm having communication complexity O(|E|log D+||V|D) and time complexity O(|V|W), ... 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.
  • A hybrid token/insertion ring LAN

    Publication Year: 1991, Page(s):211 - 220 vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    A novel, hybrid protocol LAN called TORNET2 is proposed, and its performance is evaluated. TORNET2 is a ring intended for high-speed applications in the 100 Mb/s range. Short-packet, high-priority traffic is handled by the register insertion technique. Combining this protocol with the early-release token protocol for handling low-priority asynchronous traffic is the novel aspect of TORNET2. The hy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal complexity for the simplest protocol

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

    The design issues of a multimedia transport protocol, TP5, which achieves the multiplexing of both real time and normal data flows at the transport layer are discussed. The use of a single transport connection to carry both data flows is proposed. Two schemes for the support of the synchronization of these data flows are presented. The protocol TP5 implementing the above mechanisms is described. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A close look at task assignment in distributed systems

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

    C. C. Shen and W. H. Tsai (IEEE Trans. Comput., vol.C-34, no.3, p.197-203 1985) proposed a graph matching algorithm for solving the static task assignment problem. It combines two important ideas: (1) graph homomorphism and (2) application of the A* algorithm. Task-dependent information is used as a heuristic to reduce the search effort in finding an optimal path to the goal node. An examination i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of trunk grouping in packet switch design

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

    A study is made of the performance of trunk grouping in packet switch system design, with emphasis on the analysis of maximum throughput, input queue delay and packet loss rate. The trunk grouping technique can be implemented on both sides of the switch. In principle, the output trunk grouping relieves traffic output contentions, while the input trunk grouping proposed prevents individual input li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic rate control mechanism for integrated networks

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

    To achieve better statistical gain for voice and video traffic and to relieve congestion in integrated networks, a dynamic rate control mechanism is proposed. This mechanism, using a variable rate coder, adjusts the source coding rate based on network feedback information. An analytical model is developed to evaluate the performance of the mechanism for voice traffic. The feedback delay for the so... 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.
  • A distributed congestion-prevention scheme for ATM switching fabrics based on buffered delta networks

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

    Existing packet combining schemes, implemented either by hardware or software, developed for hot-spot congestion-control in multiprocessors are not applicable for use in telecommunication systems. The authors propose a hot-spot prevention scheme which exploits the structural characteristics of buffered delta networks to regulate the traffic. This scheme prevents the tree saturation by controlling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority performance of banyan-based broadband-ISDN switches

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

    A fast packet switching module for use in B-ISDN switching architectures is described. The module is built around a self-routing banyan network which employs dilations and replications to enhance throughput. The differing requirements of delay and loss sensitivity for various traffic types are handled by assigning priorities to packets. A new result in the form of the throughput equation of lower ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of integrated multiplexer in the customer premise node of broadband integrated services network

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

    This multiplexer is assumed to have wideband (WB) and narrowband (NB) customers, where the arrival process for the former is modeled as a single birth-death Markovian chain and that of the latter is modeled as an independent Poisson. Each NB customer needs a single server for service while each WB customer needs more than one server; both of their service times are the same and constant. Higher ac... View full abstract»

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