Contrôle dynamique de flux dans un système d'attente avec panne

Haqiq, Abdelkrim; Mikou, Noufissa

doi:10.1051/ro:1999105

Cited by 3 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can prove that T J n satisfies the inequality (11) whenever J n verifies this inequality in the same way that we proved the inequality (10).…”

Section: Case Q 2 Rsupporting

confidence: 69%

“…Hajek's model includes as a special case optimal routing of arrivals between two parallel nodes (the problem considered by Farrel [5], Winston [28], Weber [27], and Ephremides et al [4]), but it does not include Davis's, Ghoneim's and Stidham's models and the one in the present paper. Haqiq and Mikou [10] studied a network consisting of two different parallel exponential servers with two types of packets, in which the first server is subject to intermittent breakdowns and it is possible to control routing of incoming packets of type one. Haqiq [11] has extended the latter problem by adding the rejection option and by limiting the capacity of the second queue.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal QoS control of interacting service stations

et al. 2002

Self Cite

View full text Add to dashboard Cite

We consider a system of three queues and two types of packets. Each packet arriving at this system finds in front of it a controller who either sends it in the first queue or rejects it according to a QoS criterion. When the packet finishes its service in the first queue, it is probabilistically routed to one of two other parallel queues. The objective is to minimize a QoS discounted cost over an infinite horizon. The cost function is composed of a waiting cost per packet in each queue and a rejection cost in the first queue. Subsequently, we generalize this problem by considering a system of (m + 1) queues and n types of packets. We show that an optimal policy is monotonic.

show abstract

“…We can prove that T J n satisfies the inequality (11) whenever J n verifies this inequality in the same way that we proved the inequality (10).…”

Section: Case Q 2 Rsupporting

confidence: 69%

Section: Introductionmentioning

confidence: 99%

Optimal QoS control of interacting service stations

et al. 2002

Self Cite

View full text Add to dashboard Cite

show abstract

“…In Haqiq et al (2008), the authors have just calculated and evaluated the performance parameters for the mechanism with control. Here we present a comparison between the first and second mechanisms.…”

Section: Numerical Resultsmentioning

confidence: 99%

Combined Queue Management and Scheduling Mechanism to Improve Intra-User Multi-Flow QoS in a Beyond 3,5G Network

Berqia

Hanini²,

Haqiq³

2012

International Journal of Mobile Computing and Multimedia Communications

View full text Add to dashboard Cite

Packet scheduling and buffer management are the two important functions adopted in networks design to ensure the Quality of Service (QoS) when different types of packets with different needs of quality share the same network resources. The Packet scheduling policy determines packet service priorities at the output link, it can reduce packet delay and delay jitter for high-priority traffic. The buffer management involves packet dropping and buffer allocation. The overall goal of such schemes proposed in High Speed Downlink Packet Access (HSDPA) is to take advantage of the channel variations between users and preferably schedule transmissions to a user when the channel conditions are advantageous; it does not take in consideration the characteristics of the flows composing the transmitted traffic to the user. This paper compares two queue management mechanisms with thresholds applied for packets transmitted to an end user in HSDPA network. Those mechanisms are used to manage access packets in the queue giving priority to the Real Time (RT) packets and avoiding the Non Real Time (NRT) packets loss. The authors show that the performance parameters of RT packets are similar in the two mechanisms, where as the second mechanism improves the performance parameters of the NRT packets.

show abstract