Weighted Priority Queuing: A New Scheduling Strategy for Web Services

Hammami, Randa; Kacem, Yossra. Hadj; Souissi, Senda.; Bellâaj, Hatem; Kacem, Ahmed Hadj

doi:10.5815/ijitcs.2017.02.02

Cited by 6 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Q HP , Q MP and Q LP are the queues with the high, medium and low priority value, respectively. In order to guaranty fairly sharing of bandwidth between different classes of priorities and preventing starvation of a particular class, an adaptive Weighted Fair Queuing (WFQ) approach is utilized [25]. The total block diagram of the queue management unit is depicted in Fig.…”

Section: New Adaptive Priority Based Traffic and Queue Managementmentioning

confidence: 99%

A New Adaptive Prioritization and Fail-Over Mechanism for Ring Network Adapter

2020

View full text Add to dashboard Cite

This paper presents a new adaptive prioritization and fail-over mechanism for ring network adapters (RNA). Owing to the use of a shared medium in the structure of ring networks, management of network resources is very important and cannot completely be fulfilled by fixed priority strategies. An adaptive prioritization mechanism for efficient utilization of network resources is proposed in this paper. Hop-Count and the distance between source and destination are the key parameters that are included in the priority assignment procedure. Unlike the conventional ones, the arrived traffic is not put blindly into the queues thanks to the awareness of stations form status of each other. The newly introduced fail-over mechanism is based on the Power over Ethernet concept. Each station monitors the heartbeat of its neighbors and tries to keep them alive by providing their minimum required electrical power whenever a fault occurs. By doing so, not only single failure but also any successive double failure scenarios cannot disrupt data path continuity. Several simulations are carried out to assess the behavior and performance of the proposed methods in OPNET Modeler. Moreover, a high-speed USB test board is designed using Xilinx-Spartan6-lx9 FPGA to experimentally verify the performance of the proposed mechanisms. INDEX TERMS Ring network, weighted fair queuing, node failure, fail-over mechanism, power over Ethernet.

show abstract

Section: New Adaptive Priority Based Traffic and Queue Managementmentioning

confidence: 99%

A New Adaptive Prioritization and Fail-Over Mechanism for Ring Network Adapter

2020

View full text Add to dashboard Cite

show abstract

“…In other words, QoS measures the level of user satisfaction and network performance, so it refers to a set of measures to tune or quantify the performance of applications, systems and networks [1]. The provision of QoS guaranteed services is necessary to meet user requirements [2]. Quantitative assessment of application performance is required for QoS metrics.…”

Section: Introductionmentioning

confidence: 99%

Choosing the best quality of service algorithm using OPNET simulation

Eltaib

Alshammari

Boukrara

et al. 2022

IJECE

View full text Add to dashboard Cite

The concept of quality of service (QoS) is a new computer technology. Previously, there was a slow internet connection to access the sites and it was slow to send information. But now, it requires speeding up the traffic and increasing the efficiency for audio and video. In this study, we discuss the concepts of QoS provided over the network to achieve these goals. This study aims to compare six algorithms to control the QoS, then, the best algorithm will be selected to improve the traffic. These algorithms are named first in first out (FIFO), priority queuing (PQ), custom queuing (CQ), CQ with low latency queuing (LLQ), weighted fair queuing (WFQ), WFQ with low latency queuing (LLQ), so the behavior of these algorithms can be measured. The results obtained by comparing between them using OPNETsimulation show that the best algorithm is the priority queuing algorithm, followed by CQ, then CQ with LLQ, then WFQ, then WFQ with LLQ and finally FIFO. All these results are plotted in the form of graphs to show the paths of these algorithms for the single state with an operation time of 5 minutes for each algorithm.

show abstract

“…In this approach, Quality of Service (QoS) becomes a significant factor for selecting effective services among the different available web services [4]. That is why, QoS is the most important differentiating point for a set of web services which provides similar types of functions [5].…”

Section: Introductionmentioning

confidence: 99%

Subset Matching based Selection and Ranking (SMSR) of Web Services

Rahman¹,

Hossain²,

ahman³

et al. 2019

IJITCS

View full text Add to dashboard Cite

Web service is a software application, which is accessible using platform independent and language neutral web protocols. However, selecting the most relevant services became one of the vital challenges. Quality of services plays very important role in web service selection, as it determines the quality and usability of a service, including its non-functional properties such as scalability, accessibility, integrity, efficiency, etc. When agent application send request with a set of quality attributes, it becomes challenging to find out the best service for satisfying maximum quality requirements. Among the existing approaches, the single value decomposition technique is popular one; however, it suffers for computational complexity. To overcome this limitation, this paper proposed a subset matching based web service selection and ranking by considering the quality of service attributes. This proposed method creates a quality-web matrix to store available web services and associated quality of service attributes. Then, matrix subsets are created using web service repository and requested quality attributes. Finally, web services are efficiently selected and ranked based on calculated weights of corresponding web services to reduce composition time. Experimental results showed that proposed method performs more efficient and scalable than existing several techniques such as single value decomposition.

show abstract

Weighted Priority Queuing: A New Scheduling Strategy for Web Services

Cited by 6 publications

References 10 publications

A New Adaptive Prioritization and Fail-Over Mechanism for Ring Network Adapter

A New Adaptive Prioritization and Fail-Over Mechanism for Ring Network Adapter

Choosing the best quality of service algorithm using OPNET simulation

Subset Matching based Selection and Ranking (SMSR) of Web Services

Contact Info

Product

Resources

About