Skip to content
Back to outputs

A QoS real time bandwidth redistribution transmission algorithm in WiMAX

Research output: Contribution to conferencePaperpeer-review

Standard

A QoS real time bandwidth redistribution transmission algorithm in WiMAX. / Peart, Amanda; Adda, Mo; Goodman, A.

2011. Paper presented at 7th Annual International Conference on Computer Science and Information Systems, Athens, Greece.

Research output: Contribution to conferencePaperpeer-review

Harvard

Peart, A, Adda, M & Goodman, A 2011, 'A QoS real time bandwidth redistribution transmission algorithm in WiMAX', Paper presented at 7th Annual International Conference on Computer Science and Information Systems, Athens, Greece, 13/06/11 - 16/06/11.

APA

Peart, A., Adda, M., & Goodman, A. (2011). A QoS real time bandwidth redistribution transmission algorithm in WiMAX. Paper presented at 7th Annual International Conference on Computer Science and Information Systems, Athens, Greece.

Vancouver

Peart A, Adda M, Goodman A. A QoS real time bandwidth redistribution transmission algorithm in WiMAX. 2011. Paper presented at 7th Annual International Conference on Computer Science and Information Systems, Athens, Greece.

Author

Peart, Amanda ; Adda, Mo ; Goodman, A. / A QoS real time bandwidth redistribution transmission algorithm in WiMAX. Paper presented at 7th Annual International Conference on Computer Science and Information Systems, Athens, Greece.

Bibtex

@conference{92a249d44d2f41db9ca24e0ac64ba864,
title = "A QoS real time bandwidth redistribution transmission algorithm in WiMAX",
abstract = "WiMAX connectivity uses two components, a Base Station (BS), where the WiMAX signals are broadcast and a Subscriber Station (SS) which is a device, or a group of devices that receives the signals. The SS will request bandwidth in the uplink (UL) from the BS, and the BS will allocate the bandwidth accordingly. As WiMAX can achieve a range of 30 miles with a throughput of 72 Mbps with LOS and 4 miles with NLOS, promoting mobility but maintain effective QoS is difficult. QoS is challenging to achieve due to unpredictable channel conditions such as signal fading and frequency interference. Different types of traffic will require different services from a network, including differing priority status; bandwidth levels and latency tolerances For example, electronic mail is insensitive to delay, but loss of data is its priority, compared to video, which is delay sensitive but data loss insensitive within a certain tolerance. Applications such as interactive graphics are sensitive to both delay and data loss. This paper proposes a QoS bandwidth allocation algorithm that would sample what has been transmitted so far on a periodic basis and compare to the total amount of bandwidth that SS has allocated to it. If there is a significant difference, the bandwidth allocation can be cut down allowing that bandwidth to be relocated to another SS. This would ensure that the bandwidth is directed to the transmissions that actually require it rather on the assumption of bandwidth requirement based on the classification of data being transmitted.",
author = "Amanda Peart and Mo Adda and A. Goodman",
year = "2011",
language = "English",
note = "7th Annual International Conference on Computer Science and Information Systems ; Conference date: 13-06-2011 Through 16-06-2011",

}

RIS

TY - CONF

T1 - A QoS real time bandwidth redistribution transmission algorithm in WiMAX

AU - Peart, Amanda

AU - Adda, Mo

AU - Goodman, A.

PY - 2011

Y1 - 2011

N2 - WiMAX connectivity uses two components, a Base Station (BS), where the WiMAX signals are broadcast and a Subscriber Station (SS) which is a device, or a group of devices that receives the signals. The SS will request bandwidth in the uplink (UL) from the BS, and the BS will allocate the bandwidth accordingly. As WiMAX can achieve a range of 30 miles with a throughput of 72 Mbps with LOS and 4 miles with NLOS, promoting mobility but maintain effective QoS is difficult. QoS is challenging to achieve due to unpredictable channel conditions such as signal fading and frequency interference. Different types of traffic will require different services from a network, including differing priority status; bandwidth levels and latency tolerances For example, electronic mail is insensitive to delay, but loss of data is its priority, compared to video, which is delay sensitive but data loss insensitive within a certain tolerance. Applications such as interactive graphics are sensitive to both delay and data loss. This paper proposes a QoS bandwidth allocation algorithm that would sample what has been transmitted so far on a periodic basis and compare to the total amount of bandwidth that SS has allocated to it. If there is a significant difference, the bandwidth allocation can be cut down allowing that bandwidth to be relocated to another SS. This would ensure that the bandwidth is directed to the transmissions that actually require it rather on the assumption of bandwidth requirement based on the classification of data being transmitted.

AB - WiMAX connectivity uses two components, a Base Station (BS), where the WiMAX signals are broadcast and a Subscriber Station (SS) which is a device, or a group of devices that receives the signals. The SS will request bandwidth in the uplink (UL) from the BS, and the BS will allocate the bandwidth accordingly. As WiMAX can achieve a range of 30 miles with a throughput of 72 Mbps with LOS and 4 miles with NLOS, promoting mobility but maintain effective QoS is difficult. QoS is challenging to achieve due to unpredictable channel conditions such as signal fading and frequency interference. Different types of traffic will require different services from a network, including differing priority status; bandwidth levels and latency tolerances For example, electronic mail is insensitive to delay, but loss of data is its priority, compared to video, which is delay sensitive but data loss insensitive within a certain tolerance. Applications such as interactive graphics are sensitive to both delay and data loss. This paper proposes a QoS bandwidth allocation algorithm that would sample what has been transmitted so far on a periodic basis and compare to the total amount of bandwidth that SS has allocated to it. If there is a significant difference, the bandwidth allocation can be cut down allowing that bandwidth to be relocated to another SS. This would ensure that the bandwidth is directed to the transmissions that actually require it rather on the assumption of bandwidth requirement based on the classification of data being transmitted.

M3 - Paper

T2 - 7th Annual International Conference on Computer Science and Information Systems

Y2 - 13 June 2011 through 16 June 2011

ER -

ID: 144955