End-to-End Bandwidth Reservation in IEEE 802.16 Mesh Networks

Cicconetti, Claudio; Gardellin, Vanessa; Lenzini, Luciano; Mingozzi, Enzo; Erta, A.

doi:10.1109/mobhoc.2007.4428719

Cited by 12 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…} l∈L in the previous iteration, we decompose the non-separable terms in the Lagrangian (8), which include r p k , across links on path p. Each link l of path p receives a portion of…”

Section: Distributed Multi-path Routing In the Backhaulmentioning

confidence: 99%

Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands

Reyhanian

Farmanbar

Luo

2020

2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

Resource reservation is an essential step to enable wireless data networks to support a wide range of user demands. In this paper, we consider the problem of joint resource reservation in the backhaul and Radio Access Network (RAN) based on the statistics of user demands and channel states, and also network availability. The goal is to maximize the sum of expected traffic flow rates, subject to link and access point budget constraints, while minimizing the expected outage of downlinks. The formulated problem turns out to be non-convex and difficult to solve to global optimality. We propose an efficient Block Coordinate Descent (BCD) algorithm to approximately solve the problem. The proposed BCD algorithm optimizes the link capacity reservation in the backhaul using a novel multipath routing algorithm that decomposes the problem down to link-level and parallelizes the computation across backhaul links, while the reservation of transmission resources in RAN is carried out via a novel scalable and distributed algorithm based on Block Successive Upper-bound Minimization (BSUM). We prove that the proposed BCD algorithm converges to a Karush-Kuhn-Tucker (KKT) solution. Simulation results verify the efficiency and the efficacy of our BCD approach against two heuristic algorithms.

show abstract

“…} l∈L in the previous iteration, we decompose the non-separable terms in the Lagrangian (8), which include r p k , across links on path p. Each link l of path p receives a portion of…”

Section: Distributed Multi-path Routing In the Backhaulmentioning

confidence: 99%

Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands

Reyhanian

Farmanbar

Luo

2020

2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

View full text Add to dashboard Cite

show abstract

“…WiMAX offers a variety of applications each with distinct traffic patterns and QoS requirements which must be fulfilled to get high user satisfaction. The QoS is a term that refers to the "collective effect of service," as perceived by the user or more narrowly it refers to meeting certain requirements such as throughput, packet error rate, delay, and jitter associated with a given application [10].…”

Section: Wimax Technologymentioning

confidence: 99%

The quality aspects of VoIP traffic over WiMAX

Randhawa

Sharma

Shafali

et al. 2015

2015 International Conference on Circuits, Power and Computing Technologies [ICCPCT-2015]

View full text Add to dashboard Cite

With the introduction of different wireless communication technologies, the demand of users for real time services like voice along with data called VoIP is increasing tremendously. In order to provide high quality services, the new technologies like WiMAX have to consider all the quality parameters attached with a service. Thus, the paper discusses the WiMAX support to such services along with all the possible features of VoIP, its quality parameters like delay, jitter, throughput, etc. and emphasis on what work has been done in this perspective so as to improve the quality of the VoIP traffic by highlighting the various aspects, methodology and limitations of previous work in this field. It has been shown that there still remain some issues and considerations, which could be taken into account so as to have high quality VoIP traffics. Access Service Networks (ASN):It comprises of number of transceivers called as base stations BS and the SSs. The communication is possible through the electromagnetic waves known as radio frequencies, on which the information is carried, the BS are used for this purpose. The subscriber stations are the devices through which the user access the service, which could be a mobile phone, laptop, dongles etc. Connectivity Service Network (CSN):It is the core network which is the fundamental wireless communication providing network or the standard network 2G, where all

show abstract

“…Also the scenario used to validate the proposed CAC algorithm is very simple, the maximum path length in scenario is two hop. In [7] the authors propose an end-to-end bandwidth reservation scheme with a CAC algorithm referred only to VoIP traffic. In [8] there is the proposal of a simple CAC algorithm.…”

Section: Related Workmentioning

confidence: 99%

A new call admission control algorithm for IEEE 802.16 distributed mesh networks

Rango

Malfitano

Marano

2009

2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

The mesh distributed mode supported by IEEE 802.16 protocol, with the capability to establish direct links between SSs (Subscriber Station) and with the wide coverage area and the promised bit rate, allows to create interesting scenarios. The protocol defines guidelines to realize request/grant process, but it does not proposes a distributed Call Admission Control (CAC) algorithm. This process is essential to guarantee QoS constraints to admitted connections. In this paper, we present GCAD-CAC (Greedy Choice with bandwidth Availabilities aware Defragmentation): a new call admission control algorithm to guarantee the respect of data flows delay constraints defined by three different traffic classes. In order to reach good results, a Greedy algorithm is used: all the new requests are accepted, but when a higher priority request is received, a lower priority admitted request is preempted. The preemption can leave in data subframe some little gaps not sufficient to new connection admission; these gaps can be collected by GCAD algorithm by activating a bandwidth availabilities defragmentation process. The algorithm quality is proved by a comparison with other two algorithms found in the literature.

show abstract

End-to-End Bandwidth Reservation in IEEE 802.16 Mesh Networks

Cited by 12 publications

References 13 publications

Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands

Resource Reservation in Backhaul and Radio Access Network with Uncertain User Demands

The quality aspects of VoIP traffic over WiMAX

A new call admission control algorithm for IEEE 802.16 distributed mesh networks

Contact Info

Product

Resources

About