Scheduled System Maintenance
On Wednesday, July 26, IEEE Xplore will undergo scheduled maintenance from 1:00-3:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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
  • Timing and dispersion in WDM optical star networks

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

    Different physical aspects that should be taken into consideration when transmitting packets in a slotted star network using wavelength-division multiplexing (WDM) are discussed. It is shown that, due to the effect of the dispersion, some padding is necessary as well as a limit on the size of the network. A method for synchronizing the transmission of slots on the different wavelengths is presente... 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 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.
  • Blocking evaluation for networks with reward maximization routing

    Publication Year: 1993, Page(s):593 - 601 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A model for node-to-node blocking probability evaluation in loss networks with state-dependent routing minimizing the reward from carried calls is synthesized. The model is based on the link independence assumption and results in an extended set of fixed point equations solved by repeated substitutions. The policy maximizing the reward from the network and the network performance under this policy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isochronets: a high-speed network switching architecture

    Publication Year: 1993, Page(s):740 - 747 vol.2
    Cited by:  Papers (7)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    An overview is given of a switching architecture for high-speed networks called Isochronets, which time-divide network bandwidth among routing trees. Traffic moves down a routing tree to the root during its time band. Network functions such as routing and flow control are entirely governed by band timers and require no processing of frame header bits. Frame motions need not be delayed for switch p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal routing with packet fragmentation in computer networks

    Publication Year: 1993, Page(s):602 - 609 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    The combined fragmentation-and-routing problem is addressed. Several possible fragmentation machines are discussed, and their equivalence is indicated. This allows the formulation of a comprehensive yet tractable flow model, whose performance measure is total delay. An analysis of this model leads to necessary and sufficient optimality conditions for the fragmentation-and-routing problem. The opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Translation of QoS parameters into ATM performance parameters in B-ISDN

    Publication Year: 1993, Page(s):748 - 755 vol.2
    Cited by:  Papers (13)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The quality of service (QoS) concept for broadband ISDN (B-ISN) is studied. The QoS parameters in the asynchronous transfer mode (ATM) layer and the AAL (ATM adaptation layer) are defined. The focus is on the translation of QoS parameters between layers, particularly from the AAL to the ATM layer, because the AAL must be designed to be service dependent and specific. The QoS parameters at the ATM ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dispersity routing on ATM networks

    Publication Year: 1993, Page(s):347 - 357 vol.1
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (908 KB)

    Dispersity routing is defined. It is combined with random access and fast circuit set-up and tear-down to put bursty data on an asynchronous transfer mode (ATM) network. This approach makes the storage in the network independent of the message length. This approach is evaluated assuming that the propagation delay may be more than the message transmission time. It is shown that the efficiency impro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability of a class of dynamic routing protocols (IGRP)

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

    An exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm, is performed. The distance metric is a weighted sum of traffic-sensitive and traffic-insensitive delay components. The optimality and stability of the protocol is related to the ratio of the weights. In particular, it is shown that if the traffic-sensitive component is not given enough weight, then star... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and formal specification of the personal communication service

    Publication Year: 1993, Page(s):756 - 765 vol.2
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    A model and a formal specification of the personal communication service obtained by the application of an object-oriented system design methodology is presented and described using the executable object-oriented specification language Mondel. The goal of developing a specification of PCS is primarily to introduce some structure and formalism in its description, which has so far been done informal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end priority cell discarding analysis for ATM networks

    Publication Year: 1993, Page(s):1178 - 1185 vol.3
    Cited by:  Papers (6)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The end-to-end cell discarding behavior of asynchronous transfer mode (ATM) telecommunication networks is considered. Cell discarding is performed in priority fashion by a nested threshold mechanism. Extensions to a previous single-queue analysis that allow the calculations of end-to-end discarding probabilities for each priority are presented. A computer tool based on this analysis, called DANTE ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of shared-buffered banyan networks under arbitrary traffic patterns

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

    The performance of multistage banyan networks with a shared buffer in each switching element is studied. Two different internal protocols are considered for the transfer of packets from stage to stage based on the presence or absence of interstage backpressure signals to signal the occurrence of buffer saturation conditions. As far as the offered traffic is concerned, two kinds of traffic patterns... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple flow control mechanism in ATM network with end to end transport

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

    A simple flow control mechanism, called RCT (rate control for end-to-end transport), is proposed for end-to-end transport in an asynchronous transfer mode (ATM) network. It reacts to instantaneous internal congestion as determined by the measured overload period. Transmission rate is adjusted by means of an adaptive window flow control mechanism that uses multiplicative decrease and linear increas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effectiveness of dynamic bandwidth management mechanisms in ATM networks

    Publication Year: 1993, Page(s):358 - 367 vol.1
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The leaky bucket, a credit management system that allows cells to enter the network only if sufficient credit is available, is considered. Motivation for an in-depth study of dynamic control algorithms, to avoid congestion in high-speed networks under time varying traffic statistics, is provided. The need for real-time traffic measurements and dynamic control actions for long-lived connections is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irregular torus networks: deadlock avoidance and throughput analysis

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

    The irregular torus, a class of topologies proposed for metropolitan area networks, is torus-like, and thus more reliable than the bus and ring topologies. There is a routing algorithm for the topologies which is space and time efficient so that it is suitable for high-speed implementations. In addition, it is robust to topology perturbations due to network growth and node/link failure. A buffer m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Priority statistical multiplexing of mixed VBR video and CBR traffic in B-ISDN/ATM with a threshold algorithm

    Publication Year: 1993, Page(s):910 - 918 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    The authors analyze a threshold priority access statistical multiplexing technique with a Markov modulated fluid source model for variable-bit-rate (VBR) video traffic, and an exact constant-bit-rate (CBR) model. Exact expressions for loss probabilities and delay are obtained. Based on these quality-of-service parameters, buffer size requirements of the statistical multiplexer are obtained, and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a fast virtual channel establishment method for ATM networks

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

    A description is given of NoW, a method for virtual channel connection (VCC) establishment in asynchronous transfer mode (ATM) networks in which a source sends the VCC establishment request message on the channel it wishes to establish (i.e. no signaling channel is used) and can then immediately send data over the channel. A key point of departure from other methods is that some identifiers for vi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency model and its application to formal protocol specifications

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

    A concurrency model is presented, and concurrent events, concurrency blocks, global states, concurrency measures, communication deadlocks, and data races are defined based on the model. The model allows high-level abstractions to be used for understanding concurrent behaviors. Using the concept of concurrency blocks, it is shown how to compute concurrency measures efficiently. The results are appl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of a CBR connection over a channel with known bounded delay variation

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

    The authors examine how to provide constant bit rate (CBR) service over a channel that can be characterized by a constant transmission delay plus a variable cell access delay. To compensate for the variability in the access delay, buffers are used at the source and the destination ends of the connection. Whenever buffers overflow or underflow the continuity of data flow over the connection breaks ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelength-based cell switching in ATM multihop optical networks

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

    An optical multihop network architecture that uses wavelength-based cell-switching and that consists of optically separated passive star couplers interconnected by 2×2 electronic asynchronous transfer mode (ATM) switches (network interface units) is presented. A fixed assignment TDMA-WDMA scheme provides a means for sharing the passive star couplers' bandwidth without cell collisions. Adapti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

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

    A prime instrument for controlling congestion in high-speed broadband ISDN (BISDN) networks is admission control, which limits call and guarantees a grade of service determined by delay and loss probability in the multiplexer. It is shown, for general Markovian traffic sources, that it is possible to assign a notational effective bandwidth to each source which is an explicitly identified, simply c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-Gbit/s optical LAN utilizing a passive WDM star: towards an experimental prototype

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

    The goals and basic node configuration of STARNET, an optical broadband local area network based on a physical passive star topology, are presented. Over a single physical network, STARNET offers all users both a moderate-speed packet network and a high-speed WDM circuit interconnect. Several topological and protocol solutions based on these two data transport facilities are available to the users... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fundamental limits of input rate control in high speed network

    Publication Year: 1993, Page(s):662 - 671 vol.2
    Cited by:  Papers (11)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The fundamental limits of input rate control by specific analysis in the frequency domain are explored. Both deterministic and stochastic analyses are developed. The simple deterministic analysis helps provide knowledge about the performance tradeoff for input rate control in a high-speed network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FECCA-a new access algorithm for an ATM ring network with destination removal

    Publication Year: 1993, Page(s):368 - 375 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The authors propose and study a protocol for asynchronous transfer mode (ATM) networks, called the fair and efficient cyclic control algorithm (FECCA), which combines the advantages of both global and local fairness schemes, to achieve a fair access mechanism while yielding high network throughput levels for a full-duplex ring network with spatial reuse. In addition, through the use of queuing mod... View full abstract»

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