By Topic

INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE

3-7 June 1990

Filter Results

Displaying Results 1 - 25 of 159
  • Proceedings IEEE INFOCOM '90. The Conference on Computer Communications. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration (Cat. No.90CH2826-5)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (326 KB)
    Freely Available from IEEE
  • Specifying a switch system using IC

    Publication Year: 1990, Page(s):296 - 304 vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    A simple switch system model is discussed, and ways are described in which various facets of the model can be specified using the IC model of parallel computation and the parallel language L.0 based on this model. Mechanisms aimed at providing component protection and resource management are modeled and specified. Although the specification of a single-switch system handling two-party plain old te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dual-ring LAN for integrated voice/video/data services

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

    A media access control (MAC) protocol for integrated services on a dual-ring high-speed LAN is proposed. The protocol supports real-time synchronous voice and video services and multilevel priority asynchronous data traffic types using a packet-switched operation. The most important service requirement for packetized real-time traffic is guaranteed periodic access to the network with a small delay... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for capacity expansion of local access networks

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

    An investigation to determine the minimum cost capacity expansion plan for the outside plant network to meet projected demand over a given planning horizon is presented. It is shown how the problem can be modeled as an integer programming problems; however, the size of the problem for a typical network precludes the use of a general-purpose integer programming code. A decomposition approach that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing in TAC-a triangularly-arranged network

    Publication Year: 1990, Page(s):481 - 486 vol.2
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    An investigation is conducted of a metropolitan area network that is an extension to the Manhattan street network (MSN) and features a three-connected, regular mesh topology. The design of a triangularly arranged connection (TAC) node is discussed, and the basic layout of the network is examined. The underlying routing approach of the network is explored and explained through a routing example. It... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of symmetric nonexhaustive polling with multiple servers

    Publication Year: 1990, Page(s):284 - 295 vol.1
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    An analysis of polling schemes with multiple servers is presented where the service discipline at each station is assumed to be of the nonexhaustive (limited) type, i.e. no more than one customer can be removed from a station per visit of a server. The times spent by servers to walk from station to station are assumed to be nonzero and are modeled by independent, identically distributed random var... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth assignment and virtual call blocking in ATM networks

    Publication Year: 1990, Page(s):881 - 888 vol.3
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The suggested class-related rule (CRR) was tested for mixes of two and three different bursty service classes. Performance was evaluated at the ATM cell level in terms of effective assigned bandwidth with respect to the peak bandwidth allocation. The gains obtained using the CRR are significant for the various bursty classes investigated with burstiness values b⩾5. It was found that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CSMA/CD/TDMA: a dynamic combination for voice and data integration

    Publication Year: 1990, Page(s):842 - 849 vol.3
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    A hybrid decentralized packet switching protocol for integrated real-time voice and data services on a bus topology local area network is presented. The bus has two states. State transitions depend on the existence of active voice users. Voice follows a modified version of time-division multiple-access (TDMA), whereas carrier-sense multiple-access with collision detection (CSMA/CD) is adopted for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Service architecture, prototype description, and network implications of a personalized information grazing service

    Publication Year: 1990, Page(s):1046 - 1053 vol.3
    Cited by:  Papers (4)  |  Patents (94)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A passive information grazing system (PIGS) is presented which is a prototype information delivery and filtering system for casual users. In PIGS, information articles in multimedia form are electronically transmitted to users over a prototype broadband network. To assist users in managing the potential flood of articles, PIGS selects information for individual users based on their personalized in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum free circuit routing in circuit-switched networks

    Publication Year: 1990, Page(s):934 - 937 vol.3
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    An analysis is made of an alternate-path routing rule called maximum free circuit routing (MFCR). In the use of MFCR, a call is routed to the alternate path that has the maximum number of free circuits when the direct path is blocked. Analytical results show that in conjunction with trunk reservation, this routing rule can offer a stable throughput at high traffic conditions and can increase the c... View full abstract»

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

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

    The authors generalize known results for nonblocking distribution networks (also known as generalized connection networks) to the multirate environment, where different user connections share a switch's internal data paths in arbitrary functions of the total capacity. In particular, they derive conditions under which networks due to Y.P. Ofman (1965) and C.D. Thompson (1978), N. Pippenger (1973), ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incorporating survivability considerations directly into the network design process

    Publication Year: 1990, Page(s):215 - 220 vol.1
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A procedure for designing survivable, distributed communications networks is described. The approach uses a version of the cut-saturation algorithm modified to include considerations for survivability while adding and deleting link resources to meet specified throughput goals. This approach improves on the original design process, which made decisions on which link should be added or deleted based... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the fairness of distributed-queue-dual-bus networks

    Publication Year: 1990, Page(s):175 - 184 vol.1
    Cited by:  Papers (96)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The fairness problems suffered by distributed-queue-dual-bus (DQDB) networks that span metropolitan areas are examined in detail. The problems arise because the network control information is subject to propagation delays that are much longer than the transmission time of a data segment. A rate control procedure is proposed that requires only a minor modification of the current DQDB protocol. In o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The advantage of dynamic tuning in distributed asymmetric systems

    Publication Year: 1990, Page(s):811 - 817 vol.3
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    An analytical performance modeling approach is presented for load sharing policies that schedule jobs based on a global system state. The main contributions of this work are: the derivation of analytical bounds to compute the average delay in large asymmetric systems under dynamic load sharing control, when job routing is based on the global system state; the experimental derivation of parameters ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of shuffle-like switching networks with deflection

    Publication Year: 1990, Page(s):473 - 480 vol.2
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Four packet-switched networks using shuffle-exchange interconnections and deflection routing are analyzed. The first two are well-known networks based solely on shuffle interconnections, and the other two are variations in which the negative effects of deflection are reduced. Approximate state equations are given under a uniform traffic assumption. The equations predict the distribution of packet ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A single-server queue with vacations and non-gated time-limited service

    Publication Year: 1990, Page(s):277 - 283 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    An M/G/1 queue with server vacations and nongated time-limited service is analyzed. A functional equation which characterizes the system behavior is derived. The equation is solved by a numerical technique that approximates the unknown function by a weighted sum of Laguerre functions with unknown coefficients. The functional equation is transformed into a set of linear equations from which the coe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of average performance of (σ,ρ) regulators

    Publication Year: 1990, Page(s):874 - 880 vol.3
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    A study is made of the average delay and the blocking probability of a regulator with a finite buffer size fed with Poisson and batch Poisson streams. The blocking probability depends only on σ and B through σ+B where B is the buffer size and σ is expressed as an integer multiple of the packet size. The provision of regulator buffers allows flexibility ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voice packet loss: destination vs. internodal links

    Publication Year: 1990, Page(s):956 - 962 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    An investigation is made of voice packet loss behavior at both the destination and internodal links in a packet switched network. The fractional loss and blocking time periods for both are derived using a bivariate Markov model. The numerical results show that blocking due to the delay constraint at the destination can result in long periods of consecutive packet loss, which seriously degrade voic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Demand paging protocol for sharing a number space among communicating entities

    Publication Year: 1990, Page(s):834 - 841 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The demand paging protocol (DPP) for dynamic sharing of a number space among a group of communicating entities is described. DPP is a decentralized, multipoint protocol for local sharing. Some possible applications for DPP are presented. DPP is evaluated in terms of aspects of other protocols that perform similar functions. DPP is found to be fairer and likely to incur less overhead, especially gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implications of new network services on BISDN capabilities

    Publication Year: 1990, Page(s):1038 - 1045 vol.3
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    A discussion is presented of three categories of emerging services that are expected to be supported by the BISDN: switched multimegabit data service (SMDS), video distribution services, and multimedia services. Motivation and definition of SMDS, telecommunications network-provided video services, and multimedia applications are covered. The transport, switching, signaling, and control requirement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DQDB-an access delay analysis

    Publication Year: 1990, Page(s):630 - 635 vol.2
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The distributed queue dual bus is a protocol being considered by the IEEE 802.6 Working Committee for adoption as a metropolitan area network standard. Its primary function is to interconnect LANs over a high-speed physical medium (optical networks) operating at over 100 Mb/s and to support integrated traffic. Although DQDB is a totally distributed and contention-free protocol with throughput very... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Markov-modulated flow model for the output queues of a packet switch

    Publication Year: 1990, Page(s):719 - 727 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    A study is made of the output queues of an M×N packet switch using a Markov-modulated flow model. The switching element is a central server which sequentially routes packets from the inputs to the outputs. The authors focus on systems where the server speed is such that the bulk of the queueing takes place in the output queues. For such systems, accurate sizing of the outp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal control approach to decentralized dynamic virtual circuit routing in computer networks

    Publication Year: 1990, Page(s):926 - 933 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The problem of virtual circuit routing in data communication networks under nonstationary conditions is considered. A state variable modeling approach is adopted to describe the dynamic behavior of the possible paths for the virtual circuit through the network. The state model is developed by representing each link in a path as a set of nonlinear differential equations describing the dynamics of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waiting time distributions for token-passing systems with limited-one service via discrete Fourier transforms

    Publication Year: 1990, Page(s):1111 - 1118 vol.3
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    An interactive numerical solution to the waiting time distributions for asymmetric token-passing systems (of more than two queues) with a limited-one service policy is proposed. Customer service times and changeover times (incurred by the server to switch from one queue to another) have general distributions. A set of four embedded Markov chains is obtained by observing the system state at the ins... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of an output buffer management scheme in a switching system for multimedia communications

    Publication Year: 1990, Page(s):1226 - 1233 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A major problem is how to determine buffer capacity, and how to synthesize a service quality control scheme for both delay and loss probability so as to satisfy multiple grades of service requirements. This is because in multimedia communications systems, each medium may have its own grade of service requirements, and these requirements may differ greatly from medium to medium. A synthesis method ... View full abstract»

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