Our focus in this work is on connection access control in networks supporting multiple types of services. The approach taken is fundamental and generic.
In the first set of papers, we consider connection-oriented services that require different amounts of network resources, e.g. integrated services in a circuit-switched or reservation-based network. We first characterize the combination of service loads that can be supported by a set of network resources, and the relationships between the load and resource requirements of each service class and the network revenue that can be obtained from these loads. We then characterize the connection access control policy that maximizes network revenue. Finally, we derive numerical techniques to increase the size of the networks for which optimal connection access control policies can be determined.
The second set of papers considers applications that require sequential use of network resources. The results characterize the connection access control policy that maximizes network revenue.
Portions of this work were supported by NSF. Any opinions, findings, conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation or IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. One print or electronic copy may be made for personal use only. Permission must be obtained from the copyright holder for systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in these papers for a fee or for commercial purposes, modification of the content of these papers, reprinting or republishing of this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, and to reuse any copyrighted component of this work in other works.
|UCI CS Networked Systems