Delay Analysis of an<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="E1"><mml:mrow><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math>Priority Queueing System with Push-out Scheme

Lee, Yutae; Choi, Bong Dae; Kim, Bara; Sung, Dan Keun

doi:10.1155/2007/14504

Cited by 5 publications

(7 citation statements)

References 12 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e censored Markov chain H(K) has the same transition probability matrix as the original EMC because we observe all the levels l, 0 ≤ l ≤ K. Hence, we have (23) for k � K. Furthermore, from (22) we have where there is at least one row that strictly satisfies the last inequality because P k,k−1 , 1 ≤ k ≤ K, is a nonnegative matrix that has at least one positive element (see (A.2)).…”

Section: Proof Of Lemmamentioning

confidence: 99%

See 1 more Smart Citation

Finite-Buffer M/G/1 Queues with Time and Space Priorities

Kim

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Many communication systems have finite buffers and service delay-sensitive and loss-sensitive types of traffic simultaneously. To meet the diverse QoS requirements of these heterogeneous types of traffic, it is desirable to offer delay-sensitive traffic time priority over loss-sensitive traffic, and loss-sensitive traffic space priority over delay-sensitive traffic. To analyze the performance of such systems, we study a finite-buffer M/G/1 priority queueing model where nonpreemptive time priority is given to delay-sensitive traffic and push-out space priority is given to loss-sensitive traffic. Compared to the previous study on finite-buffer M/M/1 priority queues with time and space priority, where service times are identical and exponentially distributed for both types of traffic, in our model we assume that service times are different and are generally distributed for different types of traffic. As a result, our model is more suitable for the performance analysis of communication systems accommodating multiple types of traffic with different service-time distributions. For the proposed queueing model, we derive the queue-length distributions, loss probabilities, and mean waiting times of both types of traffic, as well as the push-out probability of delay-sensitive traffic. With numerical examples, we also explore how the performance measures are affected by system parameters such as the buffer size, and the arrival rates and mean service times of both types of traffic for different service-time distributions.

show abstract

Section: Proof Of Lemmamentioning

confidence: 99%

“…Mathematical Problems in Engineering [9,13,14,[20][21][22][23]. Compared to the PBS mechanism, the push-out mechanism has the following advantages: It is efficient in terms of buffer utilization, as any buffer vacancies are always available for arriving packets, regardless of their classes.…”

Section: Introductionmentioning

confidence: 99%

Finite-Buffer M/G/1 Queues with Time and Space Priorities

Kim

2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Several authors have studied push-out buffers in the absence of time priority. Cheng and Akyildiz [17] and Lee et al [18] consider a push-out buffer with Poisson arrival streams and general service time distributions, while Kapadia et al [19] analyze the multi-server push-out buffer.…”

Section: Related Workmentioning

confidence: 99%

Performance analysis of space–time priority queues

Carballo-Lozano

Ayesta

Fiems

2019

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…Then, the position of the packet is changed from ( , ) to ( − − − 1, + ). Finally, the state-transition equation of ( , ) is obtained as follows [25]:…”

Section: Fcfs-po Schedulingmentioning

confidence: 99%

“…Then, ≤ ( − ) for the packet to be served, and ( ) moves to position ( + −1) when the service ends. The state-transition equation of ( ) is as follows [25]:…”

Section: Fcfs-po-p Schedulingmentioning

confidence: 99%

Packet Scheduling for Multiple‐Switch Software‐Defined Networking in Edge Computing Environment

Xue

Kim

Youn

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Software-defined networking (SDN) decouples the control plane and data forwarding plane to overcome the limitations of traditional networking infrastructure. Among several communication protocols employed for SDN, OpenFlow is most widely used for the communication between the controller and switch. In this paper two packet scheduling schemes, FCFS-Pushout (FCFS-PO) and FCFS-Pushout-Priority (FCFS-PO-P), are proposed to effectively handle the overload issue of multiple-switch SDN targeting the edge computing environment. Analytical models on their operations are developed, and extensive experiment based on a testbed is carried out to evaluate the schemes. They reveal that both of them are better than the typical FCFS-Block (FCFS-BL) scheduling algorithm in terms of packet wait time. Furthermore, FCFS-PO-P is found to be more effective than FCFS-PO in the edge computing environment.

show abstract

Delay Analysis of anM/G/1/KPriority Queueing System with Push-out Scheme

Cited by 5 publications

References 12 publications

Finite-Buffer M/G/1 Queues with Time and Space Priorities

Finite-Buffer M/G/1 Queues with Time and Space Priorities

Performance analysis of space–time priority queues

Packet Scheduling for Multiple‐Switch Software‐Defined Networking in Edge Computing Environment

Contact Info

Product

Resources

About