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
  • Traffic analysis in large-scale high-speed integrated networks: validation of nodal decomposition approach

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

    The conditions under which nodal decomposition can be applied for networkwide, multimedia traffic analysis are determined. Through extensive simulation studies of individual departure source characteristics and intersource cross-correlation at the output side of a network node, the nodal decomposition approach is validated for large-scale high-speed, integrated networks. Both homogeneous and heter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized processor sharing approach to flow control in integrated services networks-the multiple node case

    Publication Year: 1993, Page(s):521 - 530 vol.2
    Cited by:  Papers (64)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing servers. When only a subset of the sessions are leaky bucket constrained succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology are given. However, these bounds are only shown to hol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of MMPP/D/1/K queues for aggregate ATM traffic models

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

    The performance of an asynchronous transfer mode (ATM) multiplexer is evaluated, with the aggregate arrivals modeled as a Markov-modulated Poisson process (MMPP). The analysis is based on two simplifying assumptions: the probability that the MMPP goes through multiple state transitions between two successive departures is negligible, and state transitions occur at departure points. The transition ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new performance measure for statistical multiplexing: perspective of the individual source

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

    The notion of perceptible degradation of quality of the received signal seen by an individual user is introduced. It is proposed that the design of high-speed networks that support real-time traffic be carried out on the basis of a new performance measure, which is defined as the expected number of perceptible degradations that a customer is likely to encounter per unit of time. By using fluid-flo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to voice admission control in multihop wireless networks

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

    Admission-control schemes for voice traffic in circuit-switched multihop radio networks are studied. The problem formulation is based on the methodology of multiple-service, multiple-resource (MSMR) modeling, and only those admission-control policies that yield a coordinate convex state space are considered. This restriction, in conjunction with reasonable modeling assumptions, results in a produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of message delay processes

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

    The authors study the message queuing delays in a node of a communication system, where a message consists of a block of consecutive packets. Two types of message generation process are distinguished. The message can be generated as a batch or it can be dispersed over time. The authors focus on the dispersed generation model. The main difficulty in the analysis is due to the correlation between th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service integration in CRMA: a simulative analysis

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

    A simulation-based analysis of the integration of VBR video and voice traffic in a cyclic-reservation multiple-access (CRMA) network is reported. The video sources are characterized via a trace of the output of a real codec. As VBR video applications can tolerate extremely low packet loss rates (<10-8), a conservative bandwidth allocation scheme that assigns high priority to the VBR ... 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.
  • Tracking mobile users in wireless communications networks

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

    Tracking strategies for mobile wireless networks are studied, assuming a cellular architecture where base stations interconnected by a wired network communicate with mobile units via wireless links. The cost of utilizing the wireless links for the actual tracking of mobile users is investigated. A tracking strategy in which a subset of all base stations is selected and designated as reporting cent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculating performance bounds in communication networks

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

    A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they resu... 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 (26)  |  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.
  • Real-time high percentile tracking of quasi-exponential delays

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

    In many applications certain parameters of a system should be set on the basis of some large percentiles of a delay random variable, for which the characteristics may not be known or may change slowly with time. Assuming that sample values of delays are available sequentially, the authors obtain a simple algorithm to track two key statistical characteristics of the delay. Any high percentile then ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case-based reasoning approach to the management of faults in communication networks

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

    Most fault resolution systems for communications networks represent fault resolution expertise using a rule-based reasoning (RBR) paradigm. Although the RBR paradigm is appropriate for problem-solving tasks that are confined and well-understood, its limitations are an inability to learn from experience, an inability to deal with novel problems, and the difficulty of updating the systems to keep up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture and design of connectionless data service for a public ATM network

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

    The backward compatibility dilemma introduced by the deployment of a high-speed, wide-area asynchronous transfer mode (ATM) network is examined. The problem is that emerging ATM network must be capable of transporting traffic sources such as digital voice and video, but many of the design choices that optimize ATM for these sources make the transport of traditional connectionless data traffic diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing efficient encoders and decoders for network data representations

    Publication Year: 1993, Page(s):1144 - 1153 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The task of encoding complex data structures for network transmission is more expensive is terms of processor time and memory usage than most other components of the protocol stack. This problem can be partially addressed by simplifying the network data encoding rules and streamlining their implementation. The authors examine the performance of four network data representation standards: ASN.1 Bas... 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 (6)  |  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.
  • A method for delay analysis of interacting queues in multiple access systems

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

    An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved togethe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is there life beyond linear topologies? A comparison of DQDB and the Manhattan street network

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

    The performance and reliability comparison of two networks that have been proposed for use as high-speed metropolitan area networks (MANs)-the Manhattan street network (MS Net) and the distributed-queue dual-bus (DQDB) network-are compared. Both networks use slotted access protocols and have the same number of links, transmitters, and receivers per node. It is shown that the MS Net provides a much... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling of window based flow control in a multihop packet radio LAN

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

    A hybrid model is used to evaluate the end-to-end performance of a multihop packet radio LAN, operating under a window based flow control mechanism. The model consists of radio data-link layer, transport layer, and application layer queuing representations. The radio data-link layer is modeled by using a simulator, written for a specific CSMA-type channel access algorithm. A multichain closed queu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing delays in rate controlled ATM networks

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

    The problem of finding the worst-case end-to-end delay and buffer occupancy bounds in asynchronous transfer mode (ATM) networks with rate-controlled, non-work-conserving servers is addressed. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy valu... 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.
  • Memory- and channel-sharing techniques for congestion control in ATM networks

    Publication Year: 1993, Page(s):266 - 273 vol.1
    Cited by:  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    The use of two resource-sharing techniques for congestion control in a backbone asynchronous transfer mode (ATM) network consisting of ATM cross-connects interconnected with high-speed optical links such as 2.4-Gb/s OC-48c fibers is studied. Memory sharing allows an optimal shared use of buffer space in an ATM switch fabric. Channel (or line) sharing, on the other hand, takes advantage of spare li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the link error monitoring algorithms in the Signaling System Number 7 protocol

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

    Link quality in the common channel signaling (CCS) network is monitored and reported by the Signaling System No.7 (SS7) protocol level 2 signaling link error monitoring procedures. The procedures include two algorithms: the signal unit error rate monitor (SUERM), which provides one of the criteria for taking the link out of service, and the alignment error rate monitor (AERM), which determines whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and implementation of a priority knockout switch

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

    A priority knockout switch (PKS) architecture using priority based congestion control mechanisms is presented for broadband ISDN (BISDN) networks. This architecture provides the capability of assigning qualities of service to connections through per cell or virtual circuit priority mechanisms. Performance studies that use an analytical model for uniform traffic and simulation models for uniform an... View full abstract»

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