INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

March 28 1993-April 1 1993

Filter Results

Displaying Results 1 - 25 of 167
  • IEEE INFOCOM ' 93. The Conference on Computer Communications Proceedings. Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future (Cat. No.93CH3264-9)

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Parallel communication

    Publication Year: 1993, Page(s):505 - 512 vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (701 KB)

    Advances in communication rates exceed the ability of a single source to fully utilize a gigabit WAN channel with existing deterministic protocols. A method called parallel communication, which reduces latency by managing indeterminism and increasing channel utilization, given a surplus bandwidth-delay product, is presented. It involves a nondeterministic state mechanism with a modified protocol i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel priority scheme for fiber-optic code division multiple access (CDMA) packet networks

    Publication Year: 1993, Page(s):1359 - 1366 vol.3
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A multilevel priority scheme for fiber-optic CDMA is proposed. Users are divided into groups with different transmission power levels. Since the inherent properties and signal processing of the conventional communication channels are different from those of the fiber-optic channels, new code sequences must be constructed for fiber-optic applications. Furthermore, fiber-optic systems can be modeled... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicasting in a linear lightwave network

    Publication Year: 1993, Page(s):1350 - 1358 vol.3
    Cited by:  Papers (12)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Dynamic routing algorithms are proposed for setting up multicast connections in a linear lightwave network (LLN). The problem of finding a physical path for the multicast connection so as to satisfy all the constraints in the LLN is shown to be NP-complete, and a heuristic approach is presented. An algorithm is presented that decomposes the LLN into edge disjoint trees with at least one spanning t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and optimization of transmission schedules for single-hop WDM networks

    Publication Year: 1993, Page(s):1342 - 1349 vol.3
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Single-hop lightwave networks with stations interconnected using wavelength-division multiplexing are considered. The stations are equipped with tunable transmitters and/or receivers. Coordination between the transmitting and receiving stations is achieved by assuming synchronous control and a predefined, frequency-time oriented schedule which specifies the slots and the wavelengths on which commu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and switching in a wavelength convertible optical network

    Publication Year: 1993, Page(s):578 - 585 vol.2
    Cited by:  Papers (17)  |  Patents (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    A wavelength-convertible switch architecture and routing algorithm for circuit-switched wavelength-division-multiplexing optical networks is studied. Wavelength converters are used to resolve wavelength conflicts and to reuse wavelengths. These converters are not dedicated to individual channels, but are shared by the channels of a node or those of an outbound link in the share-per-node or the sha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximate analysis of broadcasting in multichannel metropolitan area networks

    Publication Year: 1993, Page(s):293 - 302 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    The bidirectional Manhattan street network (BMSN) and the ShuffleNet (SN), four-connected topologies implementing the logical layout of so-called multichannel metropolitan area networks (MANs), are considered. An open issue in multichannel MANs, namely, broadcast service, is addressed. Two different strategies are proposed to deliver broadcast traffic in BMSN and SN, and they are compared on the b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple logical token-rings in a single high-speed ring

    Publication Year: 1993, Page(s):699 - 706 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A media access control protocol, called the multiple token protocol, for high-speed ring networks is described. Its purpose is to increase the throughput under a heavy load and to decrease the access delay under a light load of the token-ring protocol. The protocol maintains several logical token rings in the single physical ring. The number of logical rings can be changed dynamically by the ring ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing of complex stochastic tasks using stochastic majorization

    Publication Year: 1993, Page(s):1306 - 1313 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The authors consider the static load balancing problem of assigning several large tasks to a (smaller) system of homogeneous processors, where a task's structure is modeled as a branching process, and all tasks are assumed to have stochastically identical behavior. They show how the theory of majorization can be used to obtain a partial order among possible task assignment. The power of this appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interdeparture processes of traffic from ATM networks

    Publication Year: 1993, Page(s):1337 - 1341 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    Interdeparture processes in asynchronous transfer mode (ATM) networks are studied for both real-time traffic and non-real-time traffic. The cell arrival process is assumed to consist of several switched determined processes (SDPs) and a batch Bernoulli process. A priority queue and an ordinary queue are set for real-time traffic and non-real-time traffic, respectively, with the priority queue havi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a new bandwidth balancing mechanism under the presence of erasure nodes

    Publication Year: 1993, Page(s):1091 - 1098 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The no-slot-wasting bandwidth balancing (NSW BWB) recently proposed for dual-bus architectures provides throughput fairness and arbitrary bandwidth distribution without wasting channel slots. The performance of two variations of NSW BWB in the presence of erasure nodes and under one or multiple priority classes of traffic is studied by simulation. For both variations, the effect of the erasure mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing multipoint connections using virtual paths in an ATM network

    Publication Year: 1993, Page(s):95 - 105 vol.1
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The point-to-multipoint routing problem is studied for an asynchronous transfer mode (ATM) network that uses virtual paths (VPs). ATM networks with asymmetric and symmetric VPs are considered, and the performance factors studied are bandwidth and establishment and switching costs. A VP with intermediate exit, where a node that performs VP switching can copy the switched packets for the local desti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of parallel ATM connections for gigabit speed applications

    Publication Year: 1993, Page(s):1186 - 1193 vol.3
    Cited by:  Papers (10)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    A system which uses multiple asynchronous transfer mode (ATM) virtual circuits operating in parallel in order to control two WAN hosts at gigabit speeds is studied. Packets in parallel channels can bypass each other, so reordering of packets before delivery to the host is required. Performance parameters of this system, including ATM channel delay, packet loss, and resequencing delay, are analyzed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation for performance evaluation of stationary single server queues

    Publication Year: 1993, Page(s):835 - 842 vol.2
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    A method for approximating the probability distributions of stationary statistics in first-in, first-out (FIFO) single server queues is provided. The method is based on the Wiener-Hopf factorization technique and is applied to semi-Markov queues with the underlying state space of unlimited size. A particularly important case is a model for a statistical multiplexer where the net input process form... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive network routing method by electrical-circuit modeling

    Publication Year: 1993, Page(s):586 - 592 vol.2
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    A routing control method called potential routing is proposed for packet communication in computer networks. Potential routing models a computer network as an electrical circuit, and performs packet routing according to the potential differences between adjacent nodes. The node potentials are first given by Kirchhoff's law and are then dynamically adjusted according to the traffic situation. Poten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of one-buffer deflection routing in ultra-fast optical mesh networks

    Publication Year: 1993, Page(s):303 - 311 vol.1
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The steady-state behavior of regular two-connected multihop networks in homogeneous load under hot-potato and single-buffer deflection routing is analyzed for ultra-fast optical applications. The Manhattan street network and ShuffleNet are compared in terms of throughput, delay, and deflection probability both analytically and by simulation. It is analytically verified that single-buffer deflectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel searching techniques for routing table lookup

    Publication Year: 1993, Page(s):1400 - 1405 vol.3
    Cited by:  Papers (5)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    The routing table lookup function is described, and recent research is reviewed, focusing on multiprocessor implementations. An implementation of the PATRICIA (practical algorithm to retrieve information coded in alphanumeric) radix searching algorithm on a linear pipelined array of processors is proposed. The implementation is described in detail and then evaluated in terms of the technology requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of a dynamic priority mechanism for the pi-persistent protocol for metropolitan area networks

    Publication Year: 1993, Page(s):707 - 714 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The pi-persistent protocol, a probabilistic scheduling that is suitable for multiple-access communication applications requiring large bandwidth over very long distances, is considered. A dynamic control algorithm for the multipriority p i-persistent protocol that makes it possible to adapt to changing network conditions in a fully distributed manner is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On queues with inter-arrival times proportional to service times

    Publication Year: 1993, Page(s):237 - 244 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    A family of queuing systems in which the interarrival time I n+1 between customers n and n+1 depends on the service time Bn of customer n is considered. Specifically, cases where the dependency between In+1 and Bn is a proportionally relation and Bn is an exponentially dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic bandwidth allocation in high speed integrated service networks

    Publication Year: 1993, Page(s):1298 - 1305 vol.3
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    A threshold-based dynamic allocation policy, called DQT, in which the bandwidth allocated to each class of traffic is altered based on the queue occupancy at the end of a frame is studied. Two classes of traffic with different quality of service (QOS) requirements are considered, and it is shown that the performance of the proposed scheme is better than that of a static allocation scheme. The perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the queueing behavior of multiplexed leaky bucket regulated sources

    Publication Year: 1993, Page(s):672 - 679 vol.2
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The leaky bucket algorithm, which has been proposed as a monitor/enforcer in the rate-based management of bandwidth in high-performance, integrated packet communication networks, is considered. The effectiveness of the unbuffered leaky bucket algorithm in protecting the quality of service (QOS) experienced by connections passing through a common internodal link queue is studied. It is shown that e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of on-off source shaping for ATM multiplexing

    Publication Year: 1993, Page(s):1330 - 1336 vol.3
    Cited by:  Papers (8)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The multiplexing of shaped on-off sources on an asynchronous transfer mode (ATM) link is addressed. In particular, an N-level shaper is analyzed. It modulates the source output bit rate on the basis of the buffer occupancy level. A very accurate analytical model describing its behavior is provided. Such a model allows an accurate description of the shaper output flow characteristics. A si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polling system optimization through dynamic routing policies

    Publication Year: 1993, Page(s):194 - 200 vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Pseudocyclic algorithms that can prioritize the various stations by dynamically changing their service order but maintain fairness by visiting each station exactly once in a cycle re considered. The waiting time performance of systems operated under cycle-time guided algorithms in semi-dynamic polling models is studied. In fully symmetric systems the waiting times of all pseudocyclic policies are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Occupancy distribution of a DQDB station based on a queueing system with Markov-structured service requirements

    Publication Year: 1993, Page(s):1083 - 1090 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The queue occupancy distribution of the distributed queue-dual-bus (DQDB) station is derived through the formulation and exact analysis of a queuing model with the following characteristic: the packet service time requirements depends on the state of an underlying Markov-structured process at the time when the packet is forwarded to the server (head of the queue). Numerical results are presented a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to protocol test sequence generation

    Publication Year: 1993, Page(s):106 - 114 vol.1
    Cited by:  Papers (34)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The authors present an approach that combines control flow and data flow analysis techniques to generate unified test sequences (UTSs) for testing protocols modeled as an extended finite-state machine (EFSM). The UTS has the same fault detection capability as the characterizing sequence (UIO, DS, or W) methods for the control part, and at the same time covers all paths that connect variable defini... View full abstract»

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