Staff View
Dynamic QoS Provisioning in Wireless Data Networks

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
10 p.
Note (type = special display note)
Technical report DCS-TR-434
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Dynamic QoS Provisioning in Wireless Data Networks
Abstract (type = abstract)
Providing quality of service(QoS) guarantees in mobile data networks is an inherently challenging task. Mobility of users imposes a spatial demand on resources resulting in overloaded regions that are entirely dependent on mobility pattern of users, that is often unpredictable. Prior and ongoing work in this area of QoS relies on call admission control (CAC), or careful resource allocation based on mobility prediction. The latter approach is not scalable, as it requires constant monitoring of the mobility of individual users and per-user state. Furthermore, many of the CAC schemes assume random or uniform mobility patterns, and in most cased are based on local decisions. The challenge is to design a scalable scheme that can provide QoS under distinct mobility patterns.

In contrast to the standard notion of QoS which is based on the handoff dropping probability, another important notion of QoS is based on disallowing handoff drops but minimizing the cell congestion probability that may occur in a given cell. In this paper, we explore this notion of QoS by proposing a dynamic CAC scheme that uses an dynamically estimated mobility pattern and distribution of users in different cells to reach an admission decision with the objective of minimizing cell congestion probability. This scheme does not maintain per user state, and can be implemented in a distributed fashion. From simulation results, we show that across different mobility patterns, the proposed scheme performs better than existing schemes in terms of achieved QoS while providing the minimum level of overall target utilization.
Name (type = personal)
NamePart (type = family)
Ganguly
NamePart (type = given)
Samrat
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Niculescu
NamePart (type = given)
Dragos
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Vickers
NamePart (type = given)
Brett
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
2001-04
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T31G0QWK
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:29:57
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:29:57
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2020