Control of multiple service, multiple resource communication networks

The authors focus upon communication networks that integrate multiple services using multiple resources. In particular, the authors address the decision of whether to accept or deny service requests in such a system. A conjecture for the optimal policy for a related system introduced by G.J. Foschini and B. Gopinath (1983) is proved, and the optimal coordinate convex policy for a multiple service, multiple resource system is characterized.<<ETX>>

[1]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[2]  J. Aein.  A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model , 1978, IEEE Trans. Commun..

[3]  S. B. Weinstein.  Telecommunications in the coming decades , 1987, IEEE Spectrum.

[4]  G. J. Foschini,et al.  Sharing Memory Optimally , 1983, IEEE Trans. Commun..

[5]  Oscar Nierstrasz,et al.  Integrated Office Systems , 1989, Object-Oriented Concepts, Databases, and Applications.

[6]  F. Kelly,et al.  Networks of queues , 1976, Advances in Applied Probability.

[7]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[8]  Simon S. Lam,et al.  Queuing Networks with Population Size Constraints , 1977, IBM J. Res. Dev..

[9]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[10]  S. Zachary.  Control of Stochastic Loss Networks, with Applications , 1988 .

[11]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[12]  Richard R. Muntz,et al.  Simple Relationships Among Moments of Queue Lengths in Product Form Queueing Networks , 1988, IEEE Trans. Computers.

[13]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[14]  D. Mitra.  Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.

[15]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[16]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[17]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[18]  Lixia Zhang,et al.  Designing a new architecture for packet switching communication networks , 1987, IEEE Communications Magazine.

[19]  Jorma T. Virtamo.  Reciprocity of blocking probabilities in multiservice loss systems , 1988, IEEE Trans. Commun..

[20]  H. Watanabe.  Integrated office systems: 1995 and beyond , 1987, IEEE Communications Magazine.

[21]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[22]  David D. Yao,et al.  Monotonicity properties for the stochastic knapsack , 1990, IEEE Trans. Inf. Theory.

[23]  Mischa Schwartz,et al.  Circuit Access Control Strategies in Integrated Digital Networks , 1984, INFOCOM.

[24]  Frank Kelly,et al.  Networks of queues with customers of different types , 1975, Journal of Applied Probability.

[25]  Philippe Nain,et al.  Qualitative properties of the Erlang blocking model with heterogeneous user requirements , 1990, Queueing Syst. Theory Appl..

[26]  Keith W. Ross,et al.  Optimal circuit access policies in an ISDN environment: a Markov decision approach , 1989, IEEE Trans. Commun..

[27]  Lester F. Ludwig.  A threaded/flow approach to reconfigurable distributed systems and service primitives architectures , 1987, Computer Communication Review.

[28]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[29]  Pravin Varaiya,et al.  Throughput in multiple service, multiple resource communication networks , 1991, IEEE Trans. Commun..