A continuous model of multiple service, multiple resource communication networks

Communication networks that integrate multiple services using multiple resources are examined. A continuous model of a multiple service, multiple resource communication network is introduced. The optimal coordinate convex control policy for this model is characterized. Algorithms are discussed and an example is given to illustrate trade-offs.<<ETX>>

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

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

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

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

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

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

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

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

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

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

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

[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]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

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

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

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

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

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

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

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

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

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

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

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

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

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