Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks

Chang, Ben-Jye; Chen, Yanling

doi:10.1016/j.comcom.2008.02.015

Cited by 16 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The COL cost function has been studied in [14,15] for defining the competitive on-line access cost in terms of the residual bandwidth of nodes. The characteristic of the COL cost function is increased exponentially as the residual bandwidth decreases, rather than a linear function.…”

Section: Fig 5 Different Amc Coding Rates Under Various Snrsmentioning

confidence: 99%

Adaptive Cost-Based with Max–Min AMC Routing Algorithm for Increasing Utilization and Reducing Blocking in IEEE 802.16j WiMAX Networks

Liang

Chang

et al. 2010

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

Based on the IEEE 802.16e standard, WiMAX has proposed a relay-based mechanism, namely IEEE 802.16j, to extend the service area of the Multihop Relay Base Stations (MR-BSs) and to improve the Received Signal Strength quality. IEEE 802.16j thus can achieve two significant advantages: extending the WiMAX service area with a low-cost solution and compatible with the existing WiMAX specifications. The Relay Station (RS) can be classified into three types: Fixed RS, Nomadic RS and Mobile RS according to diverse features of mobility and relaying range. A multihop-relay WiMAX network including various types of RSs exhibits a critical routing issue, i.e., how to determine an efficient relay-based routing path between a Mobile Station (MS) and a MR-BS. This paper thus proposes an IEEE 802.16j-conformed relay-based adaptive competitive on-line routing approach that focuses on the Non-Transparent Relay-Station (NT-RS) mode, where the path with the least cost and the highest AMC coding rate will be selected in terms of the link bandwidth, path length and channel conditions. Numerical results indicate that the proposed routing approach

show abstract

Section: Fig 5 Different Amc Coding Rates Under Various Snrsmentioning

confidence: 99%

Adaptive Cost-Based with Max–Min AMC Routing Algorithm for Increasing Utilization and Reducing Blocking in IEEE 802.16j WiMAX Networks

Liang

Chang

et al. 2010

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

show abstract

“…The Starvation problem of low priority service flows was addressed in [8,9], and scheduling algorithms are proposed to provide fairness among connections. Various admission control schemes are proposed [12][13][14] to increase the bandwidth utilization or reduce the average delay of real-time traffic. Traffic shaping mechanisms which can increase fairness and channel utilization are proposed in [4] and [11], respectively.…”

Section: Related Workmentioning

confidence: 99%

“…Traffic shaping mechanisms which can increase fairness and channel utilization are proposed in [4] and [11], respectively. Various admission control schemes are proposed [12][13][14] to increase the bandwidth utilization or reduce the average delay of real-time traffic. Furthermore, integrating the dynamic of bandwidth allocation with admission control can further improve the serving capacity.…”

Section: Related Workmentioning

confidence: 99%

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Kao¹,

Chuang²

2011

Int J Communication

View full text Add to dashboard Cite

Among the scheduling services, rtPS (real-time polling service) is designated for real-time applications. Among three packet delay intervals, performance effect on polling interval has been widely studied, but less on the intervals of scheduling and delivery. To evaluate the performance of delay-sensitive rtPS applications, instead of using continuous queueing model, a discrete-time GI-G-1 model, which considers intervals of polling, scheduling, and delivery, is proposed. By taking VoIP as a typical rtPS application, the transmission latency under different QoS settings, polling probability, and traffic load are presented. The latency is also compared among various codec schemes. The results indicate that when the codec rate is either fulfilled or dissatisfied by the promised bandwidth of service levels, the performance is highly dependent upon the polling probability, no matter what the traffic condition is. However, if the codec rate is in between the promised bandwidth of various service levels, the polling probability is a dominant factor in light traffic environment, while the settings on QoS parameters will strongly determine the performance in heavy traffic situation. In addition to the verification using simulation, the bandwidth utilization derived from the GI-G-1 model can be applied to improve the serving capacity of base stations. Copyright (c) 2011 John Wiley & Sons, Ltd

show abstract

“…Authors of [5][6] have proposed adaptive hierarchical polling approach with cost-based CAC and Markov decision process based CAC respectively for increasing utilization of access channel and network reward and reducing polling delay. H Wang et.al [7] proposed a CAC algorithm which provides the highest priority for UGS flows and maximizes the bandwidth utilization by bandwidth borrowing and degradation.…”

Section: Related Workmentioning

confidence: 99%

Performance Evaluation of Connection Admission Control for IEEE 802.16 Networks

Subramanya¹

2011

IJCA

View full text Add to dashboard Cite

Quality of Service (QoS) provisioning to the various kinds of network traffic is one of the major design criteria of IEEE 802.16 WiMAX standard. The MAC and physical layers of 802.16 standards are designed to support different types of real time application by providing QoS. Scheduling, Connection Admission Control (CAC) and traffic policing are the major issues to ensure QoS. In standard, scheduling and admission control are kept as open issues. Admission control is the ability of a network to control admission of new traffic based on the availability of resources. As per the specification the CAC considers minimum reserved rate of a connection as an admission criterion, in which the system can admit more connections, but packets of admitted connection may encounter large delays. In this paper average data rate (avg-rate CAC) and maximum sustained rate (max-rate CAC) of the connections are considered as admission criteria in CAC, along with minimum reserved rate (min-rate CAC). The performance of the WiMAX network is evaluated and compared for min-rate, avg-rate and max-rate CAC by considering the performance metrics such as number of connections admitted, throughput and delay using QualNet simulation tool.

show abstract

Adaptive hierarchical polling and Markov decision process based CAC for increasing network reward and reducing average delay in IEEE 802.16 WiMAX networks

Cited by 16 publications

References 20 publications

Adaptive Cost-Based with Max–Min AMC Routing Algorithm for Increasing Utilization and Reducing Blocking in IEEE 802.16j WiMAX Networks

Adaptive Cost-Based with Max–Min AMC Routing Algorithm for Increasing Utilization and Reducing Blocking in IEEE 802.16j WiMAX Networks

Using GI‐G‐1 queuing model for rtPS performance evaluation in 802.16 networks

Performance Evaluation of Connection Admission Control for IEEE 802.16 Networks

Contact Info

Product

Resources

About