By Topic

Selected Areas in Communications, IEEE Journal on

Issue 7 • Date Sept. 1995

Filter Results

Displaying Results 1 - 19 of 19
  • Fundamental design issues for the future Internet

    Publication Year: 1995 , Page(s): 1176 - 1188
    Cited by:  Papers (334)  |  Patents (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1544 KB)  

    The Internet has been a startling and dramatic success. Originally designed to link together a small group of researchers, the Internet is now used by many millions of people. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. We address some of the fundamental architectura... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network programming methods for loss networks

    Publication Year: 1995 , Page(s): 1189 - 1198
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (900 KB)  

    This paper describes how some of the insights available from the stochastic analysis of dynamic routing may be incorporated into the classical mathematical programming approach to the design of networks. In particular, we present the results of a number of numerical investigations into network architectures for circuit-switched communication networks. Our investigations use recent theoretical resu... View full abstract»

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

    Publication Year: 1995 , Page(s): 1229 - 1240
    Cited by:  Papers (26)  |  Patents (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (916 KB)  

    We address the problem of designing optimal buffer management policies in shared memory switches when packets already accepted in the switch can be dropped (pushed-out). Our goal is to maximize the overall throughput, or equivalently to minimize the overall loss probability in the system. For a system with two output ports, we prove that the optimal policy is of push-out with threshold type (POT).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for uplink power control in cellular radio systems

    Publication Year: 1995 , Page(s): 1341 - 1347
    Cited by:  Papers (1021)  |  Patents (16)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (584 KB)  

    In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations is fixed, (2) minimum power assignment where a user is iteratively assigned to the base station at ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal flow control of a stochastic fluid-flow system

    Publication Year: 1995 , Page(s): 1219 - 1228
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (760 KB)  

    This paper is concerned with the optimal flow control of an ATM switching element in a broadband-integrated services digital network. We model the switching element as a stochastic fluid-flow system with a finite buffer, a constant output rate, and Markov-modulated fluid input. There is a cost of holding fluid and a reward for admitting the fluid to the buffer. We study the optimal flow control po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection establishment in high-speed networks

    Publication Year: 1995 , Page(s): 1150 - 1161
    Cited by:  Papers (17)  |  Patents (10)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1232 KB)  

    The evolving view of connection establishment for connection-oriented services in high-speed networks such as ATM involves a contract negotiation process between a user agent and a network agent. The first stage consists of separate roles for the user and the network. The user agent must characterize the information streams that will be transmitted and the performance parameters that define the de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new degree of freedom in ATM network dimensioning: optimizing the logical configuration

    Publication Year: 1995 , Page(s): 1199 - 1206
    Cited by:  Papers (18)  |  Patents (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (696 KB)  

    A mathematical model is presented that provides a well-defined formulation of the logical configuration problem of ATM networks (the carriers of future B-ISDN) with the objective of maximizing the total expected network revenue, given the physical network parameters and the traffic requirements of each virtual subnetwork. A two-phase solution procedure is developed in which the decision variables ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pricing congestible network resources

    Publication Year: 1995 , Page(s): 1141 - 1149
    Cited by:  Papers (157)  |  Patents (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (764 KB)  

    We describe the basic economic theory of pricing a congestible resource such as an FTP server, a router, a Web site, etc. In particular, we examine the implications of “congestion pricing” as a way to encourage efficient use of network resources. We explore the implications of flat pricing and congestion pricing for capacity expansion in centrally planned, competitive, and monopolistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic control of handoffs in cellular networks

    Publication Year: 1995 , Page(s): 1348 - 1362
    Cited by:  Papers (12)  |  Patents (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1136 KB)  

    A dynamic programming formulation is used to obtain an optimal strategy for the handoff problem in cellular radio systems. The formulation includes the modeling of the underlying randomness in received signal strengths as well as the movements of the mobile. The cost function is designed such that there is a cost associated with switching and a reward for improving the quality of the call. The opt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new feedback congestion control policy for long propagation delays

    Publication Year: 1995 , Page(s): 1284 - 1295
    Cited by:  Papers (15)  |  Patents (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1076 KB)  

    This paper presents a new feedback congestion control mechanism for the flow control of the best-effort available bit rate (ABR) traffic in ATM networks. This new mechanism belongs to the class of feedback control schemes that ensure no data losses and operate based on simple `stop' and `start' signals. A novelty presented by this paper is a methodology which, for a given set of desired properties... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity

    Publication Year: 1995 , Page(s): 1332 - 1340
    Cited by:  Papers (218)  |  Patents (19)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (796 KB)  

    There is much current interest in spread spectrum wireless mobile communications and in particular the issue of spread spectrum wireless capacity. We characterize spread spectrum cellular capacity and provide a combined power control, cell-site selection algorithm that enables this capacity to be achieved. The algorithm adapts users' transmitter power levels and switches them between cell-sites, a... View full abstract»

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

    Publication Year: 1995 , Page(s): 1241 - 1251
    Cited by:  Papers (50)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1116 KB)  

    In noncooperative networks users make control decisions that optimize their individual performance measure. Focusing on routing, two methodologies for architecting noncooperative networks are devised, that improve the overall network performance. These methodologies are motivated by problem settings arising in the provisioning and the run time phases of the network. For either phase, Nash equilibr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of controlled multiplexing systems via numerical stochastic control methods

    Publication Year: 1995 , Page(s): 1207 - 1218
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1104 KB)  

    The paper demonstrates the usefulness of numerical methods of stochastic control theory for the design, analysis and control of multiplexing type systems and networks, as well as ATM type systems. The sources are of the Markov-modulated type, although the final results hold for other types (e.g. low-order AR schemes). Control problems arise when we wish to control cell loss due to buffer overflows... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the message and time complexity of protocols for reliable broadcasts/multicasts in networks with omission failures

    Publication Year: 1995 , Page(s): 1296 - 1308
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1240 KB)  

    This paper presents a fundamental study on the message and time complexity of reliable broadcast/multicast protocols in point-to-point networks subject to omission failures. We assume a weakly synchronous model in which there is a known upper bound on the delay in delivering a message from one process to another. A faulty process may omit sending or receiving messages; this characterizes a common ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Billing users and pricing for TCP

    Publication Year: 1995 , Page(s): 1162 - 1175
    Cited by:  Papers (24)  |  Patents (71)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (944 KB)  

    This paper presents a system for billing users for their TCP traffic. This is achieved by postponing the establishment of connections while the user is contacted, verifying in a secure way that they are prepared to pay. By presenting the user with cost and price information, the system can be used for cost recovery and to encourage efficient use of network resources. The system requires no changes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A protocol for random multiple access of packets with mixed priorities in wireless networks

    Publication Year: 1995 , Page(s): 1324 - 1331
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (588 KB)  

    Random multiple access (RMA) protocols comprise an important class for the accessing/signaling stage in multimedia ATM wireless networks. Within the RMA class, the ALOHA algorithm is most widely used at this point in time, while, as is well known, the latter algorithm becomes unstable, as the user population increases. In this paper, we consider the part-and-try algorithm, instead, for a system wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback-based flow control of B-ISDN/ATM networks

    Publication Year: 1995 , Page(s): 1252 - 1266
    Cited by:  Papers (12)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1184 KB)  

    We consider a system comprising of a single bottleneck switch/node that is fed by N independent Markov-modulated fluid sources. There is a fixed propagation delay incurred by the traffic between these sources and the switch. We assume that the switch sends periodic feedback in the form of a single congestion indicator bit. This feedback also incurs a fixed propagation delay in reaching the sources... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of bandwidth allocation policies on delay in unidirectional bus networks

    Publication Year: 1995 , Page(s): 1309 - 1323
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1224 KB)  

    We consider the problem of allocating bandwidth fairly to each node in a shared, unidirectional bus network. We focus on the pi persistent protocol, since these are open loop policies designed to operate well in high speed networks, which have a very large bandwidth-delay product and feedback in the upstream direction is not available in a timely manner. First, we introduce an improvem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive algorithms for feedback-based flow control in high-speed, wide-area ATM networks

    Publication Year: 1995 , Page(s): 1267 - 1283
    Cited by:  Papers (43)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1140 KB)  

    This paper gives a class of flow control algorithms for the adaptive allocation of bandwidths to virtual connections (VC) in high-speed, wide-area ATM networks. The feedback rate to the source from the network is parsimonious, with each feedback bit indicating whether the buffer at a distant switch is above or below a threshold. The service discipline at the switch is first-come-first-served. The ... View full abstract»

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

Aims & Scope

IEEE Journal on Selected Areas in Communications focuses on all telecommunications, including telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Muriel Médard
MIT