Achievable QoS and scheduling policies for integrated services wireless networks

Capone, J.M.; Stavrakakis, Ioannis

doi:10.1016/0166-5316(96)00018-1

Cited by 14 publications

(23 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the special case of a homogeneous system, such as the wireless voice network described earlier, satisfying the system performance is sufficient to guarantee that the target QoS vector is achievable. This result has been established in [8].…”

Section: Common Delay Tolerancesupporting

confidence: 60%

“…It can also be shown that the conditions in Eqs. 5 and 6 are sufficient [8]. That is, the performance given by any vector in the region described by Eqs.…”

Section: Common Delay Tolerancementioning

confidence: 95%

“…In addition, it can be shown [8] that d* is a vertex of set D iff d* is a dropping rate vector resulting from an Ordered Head of Line (0-HoL) priority service policy n = (XI, n2, ..., n~) ;…”

Section: Common Delay Tolerancementioning

confidence: 99%

“…The authors claim that this may be fine in an environment where resources are abundant, such as ATM; however, in a wireless environment where resources are scarce, the efficiency of the scheme should be improved by considering probabilistic QoS guarantees. Probabilistic QoS guarantees are considered in [8,91 and in this article. For example, packets from a particular source (such as voice or video) may only need to meet their delay constraint 99 percent of the time, and can tolerate being dropped otherwise.…”

Section: Channel Access For Integrated Servicesmentioning

confidence: 99%

“…In [5,8,91, the scheduling policies are designed to meet (if achievable) the diverse QoS required by the set of VBR applications. In addition, a call admission policy is developed.…”

Section: Channel Access For Integrated Servicesmentioning

confidence: 99%

See 4 more Smart Citations

Determining the call admission region for real-time heterogeneous applications in wireless TDMA networks

Capone

Stavrakakis²

1998

IEEE Network

View full text Add to dashboard Cite

The call admission problem for a wireless packet-switched network supporting homogeneous applications -such as a cellular voice network -i s an old one and has been extensively investigated in the past. The focus of the present article is to investigate the call admission region for a TDMA (wireless) system supporting heterogeneous real-time VBR applications with distinct QoS re uirements and traffic and dropping probability; packets may be dropped due to delay violations or channel-induced errors. The call acceptance region is investigated in this article under the assumption that each user's per-frame resource (slot) requests are communicated to the scheduler (resource allocation authority). The call acceptance region is shaped by the QoS that can be delivered by the uplink scheduling policy. In the beginning of this article, some mechanisms employed to inform the scheduler of the users' requests along with some schedulin policies are discussed. While these reveal the entire region. In this article, an approach is outlined on how to precisely determine the call admission region (largest set of QoS points delivered under any scheduling policy) for a TDMA system. This approach is shown to lead to the precise description of the reduced call admission region in the presence of channel errors. In order to demonstrate the performance improvement provided by an error control scheme, a simple QoS-sensitive forward error control protocol operating over an erroneous channel is employed, leading to an enlargement of the calculated call admission region. Finally, it is shown that feasible scheduling policies exist which do deliver at least the minimum QoS requirement of the applications whose associated QoS vector falls within the determined call admission region.characteristics. The QoS is defined in terms of a maximum to 7 erable packet delay scheduling policies identify QoS points in t a e call admission region, they cannot n a wireless network many users communicate over a shared unreliable channel. Several network architectures have been designed to facilitate this communication, but typically only cater to one traffic type. These architectures include a medium access control (MAC) protocol to coordinate the sharing of the channel and possibly an error control scheme to combat the unreliability of the wireless link. Two popular time sharing approaches are carrier sense multiple access (CSMA) and time-division multiple access (TDMA). In CSMA, the user senses the channel and, if it is idle, transmits a packet (information unit) without any coordination with the other users. Collisions are possible, in which case retransmissions are scheduled after a random

show abstract

Section: Common Delay Tolerancesupporting

confidence: 60%

“…It can also be shown that the conditions in Eqs. 5 and 6 are sufficient [8]. That is, the performance given by any vector in the region described by Eqs.…”

Section: Common Delay Tolerancementioning

confidence: 95%

Section: Common Delay Tolerancementioning

confidence: 99%

Section: Channel Access For Integrated Servicesmentioning

confidence: 99%

“…In [5,8,91, the scheduling policies are designed to meet (if achievable) the diverse QoS required by the set of VBR applications. In addition, a call admission policy is developed.…”

Section: Channel Access For Integrated Servicesmentioning

confidence: 99%

See 3 more Smart Citations

Determining the call admission region for real-time heterogeneous applications in wireless TDMA networks

Capone

Stavrakakis²

1998

IEEE Network

View full text Add to dashboard Cite

show abstract

Achievable QoS in an Interference/Resource-Limited Shared Wireless Channel

Capone

Stavrakakis

1998

Performance of Information and Communication Systems

View full text Add to dashboard Cite

In this work, the region of achievable QoS-which is central to the development of a call admission control mechanismis precisely described for a system of heterogeneous VBR sources with real-time service constraints. The QoS for each application is defined in terms of a packet dropping probability. Packets may be dropped due to delay violations and channel induced errors. The shared transmission resources are defined to be the slots (packet transmission times) of a TDMA frame. The region of achievable QoS is precisely described for a interference/resource-limited network by considering the underlying TDMA-MAC structure and the physical channel. A simple DLC protocol that combats the effects of the wireless channel while satisfying the real-time requirements is proposed and its impact on the region of achievable QoS is evaluated. The results presented here clearly illustrate the negative impact of a poor channel and the positive impact of the employed DLC protocol on the achievable QoS.

show abstract

Optimal access control for integrated services wireless networks

Personè

Grassi

1998

Computer Communications

View full text Add to dashboard Cite

Achievable QoS and scheduling policies for integrated services wireless networks

Cited by 14 publications

References 11 publications

Determining the call admission region for real-time heterogeneous applications in wireless TDMA networks

Determining the call admission region for real-time heterogeneous applications in wireless TDMA networks

Achievable QoS in an Interference/Resource-Limited Shared Wireless Channel

Optimal access control for integrated services wireless networks

Contact Info

Product

Resources

About