Optimal trunk reservation for a group with multislot traffic streams

Oda, Toshikane; Watanabe, Yu

doi:10.1109/26.57515

Cited by 34 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In connection access control, efficiency is often defined in terms of a weighted sum of admitted connections of the traffic classes, or equivalently as a weighted sum of blocking probabilities of traffic classes (see, e.g., [16]- [18]). In contrast, fairness is often defined either as admitting all connections subject to performance constraints or as equalizing blocking probabilities of the traffic classes (see, e.g., [19]- [21]). Efficiency and fairness are often viewed as a tradeoff, and hence some approaches try to balance the two goals (see, e.g., [22]).…”

Section: A Joint Cac and Ra Optimization Problemmentioning

confidence: 99%

A Novel Coordinated Connection Access Control and Resource Allocation Framework for 4G Wireless Networks

Yang

Jordan

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-In the academic literature on cellular network design, resource allocation algorithms often attempt to maximize total utility or throughput over a short time period, and connection access control often admits arrivals if and only if there are sufficient resources. In this paper, we investigate how connection access control and resource allocation can be coordinated to jointly achieve maximum total utility. We propose a decomposition in which resource allocation maximizes long-term average utility for each system state, and connection access control maximizes long-term average utility over all system states. We discuss the resulting interface and give examples of algorithms that satisfy this decomposition and interface. Simulation results illustrate that the optimal connection access control policy may block applications with relatively low average utility per unit rate even when capacity is available, and that coordinated connection access control and resource allocation can outperform uncoordinated approaches.

show abstract

Section: A Joint Cac and Ra Optimization Problemmentioning

confidence: 99%

A Novel Coordinated Connection Access Control and Resource Allocation Framework for 4G Wireless Networks

Yang

Jordan

2015

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Note that and . In the th iteration, from (16), we have (17) i.e., is increasing (nondecreasing) throughout the algorithm.…”

Section: Theorem 33mentioning

confidence: 99%

Optimal and Structured Call Admission-Control Policies for Resource-Sharing Systems

2006

IEEE Trans. Commun.

View full text Add to dashboard Cite

Many communication and networking systems can be modeled as resource-sharing systems with multiple classes of calls. Call admission control (CAC) is an essential component of such systems. Markov decision process (MDP) tools can be applied to analyze and compute the optimal CAC policy that optimizes certain performance metrics of the system. But for most practical systems, it is prohibitively difficult to compute the optimal CAC policy using any MDP algorithm because of the "curse of dimensionality." We are, therefore, motivated to consider two families of structured CAC policies: reservation and threshold policies. These policies are easy to implement and have good performance in practice. However, since the number of structured policies grows exponentially with the number of call classes and the capacity of the system, finding the optimal structured policy is a complex unsolved problem. In this paper, we develop fast and efficient search algorithms to determine the parameters of the structured policies. We prove the convergence of the algorithms. Through extensive numerical experiments, we show that the search algorithms converge quickly and work for systems with large capacity and many call classes. In addition, the returned structured policies have optimal or near-optimal performance, and outperform those structured policies with parameters chosen based on simple heuristics.

show abstract

“…Based on these assumptions, we can address the problem by using the Markov Decision Process (MDP) model [3,8]. As the state of network is represented by a vector x and the state space E. The access policy will be equivalent to an admission subset E A ∈ , and under this policy, an arrival is accepted when the state is x if and…”

Section: Network Modelmentioning

confidence: 99%

A Cooperative Game Theory Approach to Resource Allocation in Wireless ATM Networks

Chang

Subramanian

2000

Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks

View full text Add to dashboard Cite

Abstract. In the emerging wireless ATM networks, resource allocation with handoff consideration plays an important role in the quality of service (QoS) guarantee for multiple traffic sources. As efficiency is an important performance issue which is most widely used, the concept of fairness should also be considered. In this paper we investigate a fair and efficient resource allocation scheme for two types of traffics contending for the shared network resource. Based on the cooperative game theory, we model the fair and efficient allocation problem as a typical bargaining and arbitration problem, while the issues of efficiency and fairness are considered simultaneously by using the axiom approach. By modeling the corresponding queuing system as a Markov chain and using the Markov decision process (MDP) analysis, we convert the solution of optimal allocation policies into a typical linear programming problem for which the well-known simplex type algorithms can be easily implemented. Simulation results are also provided.

show abstract

Optimal trunk reservation for a group with multislot traffic streams

Cited by 34 publications

References 0 publications

A Novel Coordinated Connection Access Control and Resource Allocation Framework for 4G Wireless Networks

A Novel Coordinated Connection Access Control and Resource Allocation Framework for 4G Wireless Networks

Optimal and Structured Call Admission-Control Policies for Resource-Sharing Systems

A Cooperative Game Theory Approach to Resource Allocation in Wireless ATM Networks

Contact Info

Product

Resources

About