Finite Queueing Modeling and Optimization: A Selected Review

Cruz, Frederico R. B.; Woensel, van T Tom

doi:10.1155/2014/374962

Cited by 22 publications

(12 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As aforementioned, three variables, , , and , are used in the FCFS scheduling algorithm. Similar to the previous research [13], and are empirically set to be 2 and 0.016, respectively. is set to be 0.1, 0.5, and 0.9 to check the performance with various conditions.…”

Section: Simulation Resultsmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Simulation Resultsmentioning

confidence: 99%

“…A secure channel is supported for the communication between the controller and switch. The OpenFlow switch supports the flow-based forwarding by keeping one or more flow tables [12,13].…”

Section: Sdn Sdn Was Originated From a Project Of Uc Berkeley And Stmentioning

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

show abstract

“…More precisely, they assume that the system admits a product form solution, even though it does not. Additionally, they usually apply some reconfigurations to the original queuing model, e.g., adding extra queuing nodes to handle systems with losses [20], [21] or eliminating the immediate feedback at every node by increasing its service time [11], [20]. The primary advantage of the approximation methods is their relative simplicity.…”

Section: A Queuing Networkmentioning

confidence: 99%

Performance Modeling of Softwarized Network Services Based on Queuing Theory With Experimental Validation

Prados-Garzon

Ameigeiras

Ramos-Muñoz

et al. 2021

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Network Functions Virtualization facilitates the automation of the scaling of softwarized network services (SNSs). However, the realization of such a scenario requires a way to determine the needed amount of resources so that the SNSs performance requisites are met for a given workload. This problem is known as resource dimensioning, and it can be efficiently tackled by performance modeling. In this vein, this paper describes an analytical model based on an open queuing network of G/G/m queues to evaluate the response time of SNSs. We validate our model experimentally for a virtualized Mobility Management Entity (vMME) with a three-tiered architecture running on a testbed that resembles a typical data center virtualization environment. We detail the description of our experimental setup and procedures. We solve our resulting queueing network by using the Queueing Networks Analyzer (QNA), Jackson's networks, and Mean Value Analysis methodologies, and compare them in terms of estimation error. Results show that, for medium and high workloads, the QNA method achieves less than half of error compared to the standard techniques. For low workloads, the three methods produce an error lower than 10%. Finally, we show the usefulness of the model for performing the dynamic provisioning of the vMME experimentally.Network Softwarization, NFV, performance modeling, queuing theory, queuing model, softwairzed network services, resource dimensioning, dynamic resource provisioning.

show abstract

“…In the context of the Internet of vehicles (IoV), Qin et al [18] improved the autopilot carfollowing model, and enhanced the stability of front and rear cars in the model by analyzing the stability domain of mixed traffic flow. Cruzlt and Woensel [19] explored deep into the finite queueing model, and enumerated the advantages of generalized expansion method in evaluating the finite queueing network.…”

Section: Introductionmentioning

confidence: 99%

A Vehicle Routing Problem Model With Multiple Fuzzy Windows Based on Time-Varying Traffic Flow

Zheng

2020

IEEE Access

View full text Add to dashboard Cite

In actual distribution process, the traffic flow varies with time, and each consumer has multiple fuzzy windows. To minimize the total distribution cost and mean consumer dissatisfaction, this paper sets up a vehicle routing problem (VRP) model with multiple fuzzy time windows, based on time-varying traffic flow. In addition, the Ito algorithm was improved based on time-varying traffic flow. The model and algorithm were verified through example simulation, in comparison with ant colony optimization (ACO). During the simulation, the improved Ito algorithm effectively reduced the distribution cost and consumer dissatisfaction, and outperformed the ACO in solving efficiency and solution quality. The results fully demonstrate the feasibility and effectiveness of the proposed algorithm. The research findings provide a desirable solution to VRPs with multiple fuzzy windows and time-varying traffic flow in the real world. INDEX TERMS Time-varying traffic flow, multiple fuzzy time windows, Ito algorithm, vehicle routing problem (VRP), consumer satisfaction.

show abstract

Finite Queueing Modeling and Optimization: A Selected Review

Cited by 22 publications

References 46 publications

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

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

Performance Modeling of Softwarized Network Services Based on Queuing Theory With Experimental Validation

A Vehicle Routing Problem Model With Multiple Fuzzy Windows Based on Time-Varying Traffic Flow

Contact Info

Product

Resources

About