Scheduling and buffer management for soft-real-time VBR traffic in packet-switched networks

Philp, I.R.; Nahrstedt, Klara; Liu, J.W.S.

doi:10.1109/lcn.1996.558142

Cited by 10 publications

(9 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some applications in real time possess limits of the delay that must be guaranteed, but these bounds can be slightly exceeded. In this categories many application can also tolerate a small amount of packet loss [17]. The second category, it's data traffic which has no delay requirements but short average delay is desired.…”

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Traffic Multiservice Based Performance Analysis of OLSR and AODV Protocols for Mobile Ad Hoc Networks

Fakhri¹,

Amnai²,

Abouchabaka³

2011

IJACT

View full text Add to dashboard Cite

Mobile Ad-Hoc network is a collection of mobile nodes in communication without using infrastructure. As the real-time applications used in today's wireless network grow, we need some schemes to provide more suitable service for them. We know that most of actual schemes do not perform well on traffic which is not strictly CBR. Therefore, in this paper we have studied the impact of real-time VBR (MPEG-4) traffic on the performances (End-to-End Delay, Throughput and Packet Delivery ratio) of routing protocols Optimized Link State Routing (OLSR) and On-Demand Distance Vector (AODV). The analysis has been done with the most used mobility model Random Way Point and the Mobgen Steady State. We discover that Mobgen Steady State have huge impact on performances, and can lead to less end-to-end delay than the one achievable under Random Way Point in both types reactive and proactive routing protocols considered.

show abstract

Section: Problem Formulationmentioning

confidence: 99%

“…We have used the VBR traffic that closely matches the statistical characteristics of a real trace of video frames generated by an MPEG-4 encoder [17]. Two parameters were used to control the traffic stream.…”

Section: Problem Formulationmentioning

confidence: 99%

Traffic Multiservice Based Performance Analysis of OLSR and AODV Protocols for Mobile Ad Hoc Networks

Fakhri¹,

Amnai²,

Abouchabaka³

2011

IJACT

View full text Add to dashboard Cite

show abstract

“…2 We shall assume that the real-time packets arriving at the downlink queue have the same transmission deadline as the corresponding uplink real-time packets (i.e., D V,MAX for voice and D VD,MAX for video). The packets in the real-time downlink queue are served according to the EDF criterion [9]. The AP orders the queued packets in ascending order of TTL values.…”

Section: The D-tdd Samentioning

confidence: 99%

An efficient demand-assign medium access control protocol for high-speed wireless networks

Fantacci

Mennuti

Pecorella

2005

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

With the convergence of mobile and fixed communication networks, mobile users are increasingly demanding applications offering the same quality of service (QoS) as provided by wired access. High-speed time division duplex access mode is typical of high-speed mobile communication systems in order to simultaneously handle real-time, interactive, and best effort traffic classes. This paper proposes a medium access control (MAC) protocol that makes efficient use of radio resources for access. The proposed protocol, named dynamic-time division duplexing (D-TDD), is based on a multiple-access TDD air interface capable of supporting uplink and downlink traffic asymmetries. Validation of the D-TDD good performance was achieved by comparison with an ideal scheme and a different MAC protocol recently proposed in the literature on this subject.Index Terms-Demand-assignment schemes, high-speed wireless networks, medium access control (MAC) protocols.

show abstract

“…The EDF is the best algorithm in the sense of throughput maximization if a call can stop on other ongoing call [8]. It corresponds to the FIFO scheduler when all the calls have the same deadline [9].…”

Section: Priority Based Admission Control (Pbac)mentioning

confidence: 99%

A priority based admission control strategy for WCDMA systems

Fantacci

Mennuti

Tarchi

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

Future wireless systems need higher support in terms of QoS support. In particular when several connections with different QoS attributes are allowed a prioritization system has to be foreseen. In the UMTS and other systems that exploit the WCDMA approach the problem of mitigating the Multiple Access Interference arises, too. The Admission Control algorithms have been introduced in the literature in order to prevent any congestion status in the network. In this paper an Admission Control algorithm that works by exploiting the current interference level is presented; moreover each type of traffic is managed in order to respect its QoS in terms of priority.

show abstract

Scheduling and buffer management for soft-real-time VBR traffic in packet-switched networks

Cited by 10 publications

References 19 publications

Traffic Multiservice Based Performance Analysis of OLSR and AODV Protocols for Mobile Ad Hoc Networks

Traffic Multiservice Based Performance Analysis of OLSR and AODV Protocols for Mobile Ad Hoc Networks

An efficient demand-assign medium access control protocol for high-speed wireless networks

A priority based admission control strategy for WCDMA systems

Contact Info

Product

Resources

About