Relevant bibliographies by topics / Weighted round robin technique

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Weighted round robin technique'

Author: Grafiati
Published: 5 June 2025
Last updated: 15 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Weighted round robin technique.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Weighted round robin technique"

1

Priya, S. Sree, and Dr T. Rajendran. "Enhanced Weighted Round Robin: A New Paradigm in Cloud Load Balancing." Indian Journal Of Science And Technology 18, no. 15 (2025): 1220–28. https://doi.org/10.17485/ijst/v18i15.3976.

Full text
Abstract:
Objectives: The aim of this study is to suggest and recommend a load balancing algorithm based on enhanced weighted round robin (EWRR) technique to distribute incoming tasks or requests among various servers or resources in a cloud computing architecture. Methods: The study is accomplished by designing the enhanced weighted round robin (EWRR) load balancing and implemented in Cloud infrastructure by varying the number of jobs and virtual machines and evaluating the efficiency of the model. The experiments are simulated using CloudSim an open source tool and the effectiveness with regard to response time, idle time, task migration and delayed tasks are recorded. Findings: The obtained results are compared with round robin (RR) and weighted round robin (WRR) techniques and with the other state of art methods in the literature. The proposed EWRR performs better than all other approaches, such as Pragmatic Load Balancing (PLB) (28 ms) and Reinforcement Learning and Proficient Hybrid Lyrebird Falcon Optimization (RL-HFLO) (30 ms), with the shortest reaction time of 20 ms. Further, in comparison to greater values like 150 units in Round Robin and 120 units in K-means with RR, it reduces cumulative idle time to 75 units. Among all the methods examined, EWRR further reduces the number of delayed tasks to a mere 5. Even though EWRR involves 3 task migrations, which is slightly more than others, it results in better overall efficiency and utilization of resources. Novelty: The suggested EWRR model can be utilized as load balancing in cloud infrastructure in the varied cloud environments in a predictive way and enable the cloud service providers to make informed decisions. Dynamic parameters used by EWRR include each virtual machine's processing power, the quantity of incoming jobs, the duration of each job, and the VM's current burden (in real time). All of these EWRR settings produce intelligent scheduling that takes workload into account by preventing the blind assignment of jobs in RR and LC. Keywords: Load Balancing, Weighted Round Robin, Enhanced Weighted Round Robin, Cloud Computing, Performance Evaluation
APA, Harvard, Vancouver, ISO, and other styles
2

S., Sree Priya, and T. Rajendran Dr. "Enhanced Weighted Round Robin: A New Paradigm in Cloud Load Balancing." Indian Journal of Science and Technology 18, no. 15 (2025): 1220–28. https://doi.org/10.17485/IJST/v18i15.3976.

Full text
Abstract:
Abstract <strong>Objectives:</strong>&nbsp;The aim of this study is to suggest and recommend a load balancing algorithm based on enhanced weighted round robin (EWRR) technique to distribute incoming tasks or requests among various servers or resources in a cloud computing architecture.&nbsp;<strong>Methods:</strong>&nbsp;The study is accomplished by designing the enhanced weighted round robin (EWRR) load balancing and implemented in Cloud infrastructure by varying the number of jobs and virtual machines and evaluating the efficiency of the model. The experiments are simulated using CloudSim an open source tool and the effectiveness with regard to response time, idle time, task migration and delayed tasks are recorded.&nbsp;<strong>Findings:</strong>&nbsp;The obtained results are compared with round robin (RR) and weighted round robin (WRR) techniques and with the other state of art methods in the literature. The proposed EWRR performs better than all other approaches, such as Pragmatic Load Balancing (PLB) (28 ms) and Reinforcement Learning and Proficient Hybrid Lyrebird Falcon Optimization (RL-HFLO) (30 ms), with the shortest reaction time of 20 ms. Further, in comparison to greater values like 150 units in Round Robin and 120 units in K-means with RR, it reduces cumulative idle time to 75 units. Among all the methods examined, EWRR further reduces the number of delayed tasks to a mere 5. Even though EWRR involves 3 task migrations, which is slightly more than others, it results in better overall efficiency and utilization of resources.&nbsp;<strong>Novelty:</strong>&nbsp;The suggested EWRR model can be utilized as load balancing in cloud infrastructure in the varied cloud environments in a predictive way and enable the cloud service providers to make informed decisions. Dynamic parameters used by EWRR include each virtual machine's processing power, the quantity of incoming jobs, the duration of each job, and the VM's current burden (in real time). All of these EWRR settings produce intelligent scheduling that takes workload into account by preventing the blind assignment of jobs in RR and LC. <strong>Keywords:</strong> Load Balancing, Weighted Round Robin, Enhanced Weighted Round Robin, Cloud Computing, Performance Evaluation
APA, Harvard, Vancouver, ISO, and other styles
3

Adebiyi, Marion Olubunmi, Egbe Egbe Adeka, Florence A. Oladeji, Roseline Oluwaseun Ogundokun, Micheal Olaolu Arowolo, and Ayodele Ariyo Adebiyi. "Evaluation of load balancing algorithms on overlapping wireless accesspoints." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 895–902. https://doi.org/10.11591/ijeecs.v21.i2.pp895-902.

Full text
Abstract:
Wireless networks came into the computing world replacing the costlier and more complex wired method of connecting numerous equipment in the same or different location via the use of cables. It provides the user devices a connection to one another and the greater internet via connections to access points. Generally, 802.11 access point products follow a default strongest signal first approach in selecting user devices or nodes to connect to the access point or overlapping access points. This standard does not make provisions for even distribution of load and hence the quality of service and the throughput in areas of congestion would be reduced. This article brings forward two algorithms used in load balancing and they include round-robin technique and the weighted round-robin technique to be used in the simulation of the distribution of the load amongst the access points with the results collated and compared to clearly show which algorithm is best suited to be used as a standard for access point load distribution.
APA, Harvard, Vancouver, ISO, and other styles
4

OUNI, RIDHA, JAMILA BHAR, and KHOLDOUN TORKI. "A NEW SCHEDULING PROTOCOL DESIGN BASED ON DEFICIT WEIGHTED ROUND ROBIN FOR QoS SUPPORT IN IP NETWORKS." Journal of Circuits, Systems and Computers 22, no. 03 (2013): 1350012. http://dx.doi.org/10.1142/s0218126613500126.

Full text
Abstract:
We present a study of the effects of active queue management (AQM) on the average queue size in routers. In this work, three prominent AQM schemes are considered: packet classification, checking service level agreements (SLA) and queue scheduling. This paper presents several adaptive resource sharing models that use a revenue criterion to allocate bandwidth in an optimal way. The models ensure QoS requirements of data flows and, at the same time, maximize the total revenue by adjusting parameters of the underlying schedulers. Deficit round robin (DRR) and deficit weighted round robin (DWRR) scheduling techniques have shown their ability in providing fair and weighted sharing of network resources for network devices. However, they are unable to use the total allocated network bandwidth even in burst traffic. In this paper, we propose a negative-deficit weighted round robin (N-DWRR) technique as a new packet scheduling discipline to improve the bandwidth utilization rate without increasing the total latency. A fully hardware packet scheduler has been implemented and verified as part of an intellectual property core. This is motivated by the fact that the design and analysis of hardware/software architectures for such techniques requires new models and methods, which do not fall under the domain of traditional embedded-systems design.
APA, Harvard, Vancouver, ISO, and other styles
5

Ibarra-Delgado, Salvador, Remberto Sandoval-Arechiga, José Ricardo Gómez-Rodríguez, Manuel Ortíz-López, and María Brox. "A Bandwidth Control Arbitration for SoC Interconnections Performing Applications with Task Dependencies." Micromachines 11, no. 12 (2020): 1063. http://dx.doi.org/10.3390/mi11121063.

Full text
Abstract:
Current System-on-Chips (SoCs) execute applications with task dependency that compete for shared resources such as buses, memories, and accelerators. In such a structure, the arbitration policy becomes a critical part of the system to guarantee access and bandwidth suitable for the competing applications. Some strategies proposed in the literature to cope with these issues are Round-Robin, Weighted Round-Robin, Lottery, Time Division Access Multiplexing (TDMA), and combinations. However, a fine-grained bandwidth control arbitration policy is missing from the literature. We propose an innovative arbitration policy based on opportunistic access and a supervised utilization of the bus in terms of transmitted flits (transmission units) that settle the access and fine-grained control. In our proposal, every competing element has a budget. Opportunistic access grants the bus to request even if the component has spent all its flits. Supervised debt accounts a record for every transmitted flit when it has no flits to spend. Our proposal applies to interconnection systems such as buses, switches, and routers. The presented approach achieves deadlock-free behavior even with task dependency applications in the scenarios analyzed through cycle-accurate simulation models. The synergy between opportunistic and supervised debt techniques outperforms Lottery, TDMA, and Weighted Round-Robin in terms of bandwidth control in the experimental studies performed.
APA, Harvard, Vancouver, ISO, and other styles
6

Adebiyi, Marion Olubunmi, Egbe Egbe Adeka, Florence A. Oladeji, Roseline Oluwaseun Ogundokun, Micheal Olaolu Arowolo, and Ayodele Ariyo Adebiyi. "Evaluation of load balancing algorithms on overlappiing wireless accesspoints." Indonesian Journal of Electrical Engineering and Computer Science 21, no. 2 (2021): 895. http://dx.doi.org/10.11591/ijeecs.v21.i2.pp895-902.

Full text
Abstract:
&lt;span&gt;Wireless networks came into the computing world replacing the costlier and more complex wired method of connecting numerous equipment in the same or different location via the use of cables. It provides the user devices a connection to one another and the greater internet via connections to access points. Generally, 802.11 access point products follow a default strongest signal first approach in selecting user devices or nodes to connect to the access point or overlapping access points. This standard does not make provisions for even distribution of load and hence the quality of service and the throughput in areas of congestion would be reduced. This article brings forward two algorithms used in load balancing and they include round-robin technique and the weighted round-robin technique to be used in the simulation of the distribution of the load amongst the access points with the results collated and compared to clearly show which algorithm is best suited to be used as a standard for access point load distribution.&lt;/span&gt;
APA, Harvard, Vancouver, ISO, and other styles
7

Gani, Ahmad, Sigit Wibawa, and Fadli Ilyas. "PENERAPAN POLA FIBONACCI UNTUK PENGATURAN QOS (QUALITY OF SERVICE) JARINGAN." INTI Nusa Mandiri 19, no. 2 (2025): 267–77. https://doi.org/10.33480/inti.v19i2.6359.

Full text
Abstract:
In managing network quality of service (QoS), this research uses the Fibonacci pattern to optimize delay control and bandwidth allocation. QoS is very important in contemporary network management, especially considering the increasing demand for stable and effective data services. This study prioritizes data based on traffic levels using a Fibonacci algorithm simulation. Each priority is assigned a value corresponding to the Fibonacci sequence, which allows for resource allocation that is more in line with network load.The simulation was conducted under normal and overload conditions. The research results show that conventional methods, such as round-robin and weighted fair queuing, can improve QoS efficiency with the Fibonacci pattern by up to 15%. This improvement primarily focuses on managing important data packets such as real-time communication and video streaming, and reducing latency. Additionally, this technique is better at adapting to traffic changes.The research results show that the Fibonacci pattern can be an innovative method for managing network QoS, especially for complex priority needs. By using the Fibonacci pattern as a data priority management technique, this research helps improve network quality of service (QoS). This method is capable of improving bandwidth allocation efficiency and reducing latency by up to 15% compared to conventional approaches such as Round-Robin and Weighted Fair Queuing. The main contribution of this research is to offer a new approach based on Fibonacci patterns that can be adapted to the dynamics of network traffic.
APA, Harvard, Vancouver, ISO, and other styles
8

Tamri, Rajae, Jilali Antari, and Radouane Iqdour. "A New WRR Algorithm for an Efficient Load Balancing System in IoT Networks under SDN." International Journal of Interactive Mobile Technologies (iJIM) 18, no. 03 (2024): 45–59. http://dx.doi.org/10.3991/ijim.v18i03.42813.

Full text
Abstract:
The Internet of Things (IoT) connects various smart objects and manages a vast network using diverse technologies, which present numerous challenges. Software-defined networking (SDN) is a system that addresses the challenges of traditional networks and ensures the centralized configuration of network entities to manage network integrity. Furthermore, the uneven distribution of IoT network load results in the depletion of IoT device resources. To address this issue, traffic must be distributed equally, requiring efficient load balancing to be ensured. This requires the development of an efficient architecture for IoT networks. The main goal of this paper is to propose a novel architecture that leverages the potential of SDN, the clustering technique, and a new weighted round-robin (N-WRR) protocol. The objective of this architecture is to achieve load balancing, which is a crucial aspect in the development of IoT networks as it ensures the network’s efficiency. Furthermore, to prevent network congestion and ensure efficient data flow by redistributing traffic from overloaded paths to less burdened ones. The simulation results demonstrate that our N-WRR algorithm achieves highly efficient load balancing compared to the simple weighted round-robin (WRR), and without the application of any load balancing method. Furthermore, our proposed approach enhances throughput, data transfer, and bandwidth availability. This results in an increase in processed requests.
APA, Harvard, Vancouver, ISO, and other styles
9

Sahana, Sudipta, Tanmoy Mukherjee, and Debabrata Sarddar. "A Conceptual Framework Towards Implementing a Cloud-Based Dynamic Load Balancer Using a Weighted Round-Robin Algorithm." International Journal of Cloud Applications and Computing 10, no. 2 (2020): 22–35. http://dx.doi.org/10.4018/ijcac.2020040102.

Full text
Abstract:
Cloud load balancing has become one of the most vital aspects of Cloud computing that has captured the attention of IT organizations and business firms in recent years. Among the issues related to this particular aspect, one such issue which needs to be addressed is the issue of effectively serving the clients' requests among multiple servers using an appropriate load balancer. Previous survey papers discussed various issues of cloud load balancing and accordingly devised various methods and techniques to address those issues with the objectives of reduction of processing time and response time along with optimization of costs. In this article, we have discussed an effective load balancing technique using the weighted Round-Robin algorithm which can process the client requests among multiple servers with minimal response time. Considering all these aspects, a cloud-based dynamic load balancer is being used to solve the problem of load balancing in the cloud infrastructure.
APA, Harvard, Vancouver, ISO, and other styles
10

K. A., Vani, and Rama Mohan Babu K. N. "An Intelligent Server load balancing based on Multi-criteria decision-making in SDN." International journal of electrical and computer engineering systems 14, no. 4 (2023): 433–42. http://dx.doi.org/10.32985/ijeces.14.4.7.

Full text
Abstract:
In an environment of rising internet usage, it is difficult to manage network traffic while maintaining a high quality of service. In highly trafficked networks, load balancers are crucial for ensuring the quality of service. Although different approaches to load-balancing have been proposed in traditional networks, some of them require manual reconfiguration of the device to accommodate new services due to a lack of programmability. These problems can be solved through the use of software-defined networks. This research paper presents a dynamic load-balancing algorithm for software-defined networks based on server response time and content mapping. The proposed technique dispatches requests to servers based on real-time server loads. This technique comprises three different modules, such as a request classification module, a server monitoring module, and an optimized dynamic load-balancing module using content-based routing. There are a variety of robust mathematical tools to address complex problems that have multiple objectives. Multi-Criteria Decision-Making is one of them. The performance of the proposed scheme has been validated by applying the Weighted Sum Method of the multi-criteria decision-making technique. The proposed method Server load balancing based on Multi-criteria Decision Making[SDLB-MCDM] is compared with different load-balancing schemes such as round robin, random, load-balancing scheme based on server response time [LBBSRT], and An SDN-aided mechanism for web load- balancing based on server statistics [SD-WLB]. The experimental results of SDLB-MCDM show a significant improvement of 58% when weights are equal and 50% when unequal weights are assigned to various QoS parameters in comparison with the ROUND ROBIN, RANDOM, LBBSRT and SD-WLB techniques.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Weighted round robin technique"

1

Alnowiser, Abdulaziz Mohammed. "TOWARD ENERGY-EFFICIENT SCHEDULING USING WEIGHTED ROUND-ROBIN AND VM REUSE." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/theses/1303.

Full text
Abstract:
AN ABSTRACT OF THE THESIS OF Abdulaziz M. AlNowiser, for the Master of Science degree in Computer Science, presented on November 1, 2013, at Southern Illinois University Carbondale. TITLE: TOWARD ENERGY-EFFICIENT SCHEDULING USING WEIGHTED ROUND- ROBIN AND VM REUSE MAJOR PROFESSOR: Dr. Michelle M. Zhu In recent years, the rapid evolving Cloud Computing technologies multiply challenges such as minimizing power consumption and meeting Quality-of-Services (QoS) requirements in the presence of heavy workloads from a large number of users using shared computing resources. Powering a middle-sized data center normally consumes 80,000kW power every year and computer servers consume around .5% of the global power [1]. Statistics for 5000 production servers over a six-month period show that only 10-50% of the total capacity has been effectively used, and a large portion of the resources is actually wasted. In order to address the skyrocket energy cost from the high level resource management aspect, we propose an energy efficient job scheduling approach based on a modified version of Weighted Round Robin scheduler that incorporates VMs reuse and live VM migration without compromising the Service Level Agreement (SLA). The Weighted Round Robin scheduler can monitor the running VMs status for possible VM sharing for job consolidation or migration. In addition, the VMs utilization rate is observed to start live migration from the over-utilizing Processing Element (PE) to under-utilized PEs or to the hibernated PEs by sending WOL (Wake-On-LAN) signal to activate them. The simulation experiments are conducted under the CloudReports environment based on open source CloudSim simulator. The comparisons with other similar scheduling algorithms demonstrate that our enhanced Weighted Round Robin algorithm (EWRR) can achieve considerable better performance in terms of energy consumption and resource utilization rate.
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Seyon Geoff M. (Geoff Musa) 1974. "Achieving quality of service guarantees on frame relay using weighted round-robin queueing." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47604.

Full text
Abstract:
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.<br>Includes bibliographical references.<br>by Geoff M. Lee Seyon.<br>S.B.and M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
3

Soni, Aakash. "Real-time performance analysis of a QoS based industrial embedded network." Thesis, Toulouse, INPT, 2020. http://www.theses.fr/2020INPT0047.

Full text
Abstract:
L'AFDX est utilisé comme un réseau fédérateur pour la transmission des flux avioniques critiques. Ce réseau est certifié grâce à l'analyse pire-cas utilisant l'approche Network Calculus (NC). Le pessimisme introduit par NC conduit souvent à un réseau surdimensionné et éventuellement sous-utilisé. Les avionneurs envisagent d'augmenter l'utilisation des ressources du réseau AFDX en ajoutant du trafic supplémentaire provenant d'autres fonctions critiques et non critiques. Le partage du réseau AFDX avec des flux de criticité mixtes nécessite l'utilisation d'un mécanisme de qualité de service (QoS) pour satisfaire les contraintes de délai des différentes classes de flux. Dans cette thèse, nous étudions un tel réseau déployant de la qualité de service, en particulier, basé sur l'ordonnancement DRR et WRR. Nous proposons une méthode optimale de distribution de la bande passante qui assure le service requis par les flux critiques tout en fournissant un service maximisé aux flux non-critiques. Nous proposons également une approche NC optimisée qui, sur une configuration industrielle de réseau AFDX, a permis de réduire les bornes jusqu'à 40%<br>AFDX serves as a backbone network for transmission of critical avionic flows. This network is certified thanks to the WCTT analysis using Network Calculus (NC) approach. However, the pessimism introduced by NC approach often leads to an over-sized and eventually an underutilized network. The manufacturers envision to better use the available network resources by increasing occupancy rate of the AFDX network by allowing additional traffic from other critical and non-critical functions. Such harmonization of AFDX network with mixed criticality flows necessitates the use of QoS mechanism to satisfy the delay constraints in different classes of flow. In this thesis we study such QoS-aware network, in particular, based on DRR and WRR scheduling. We propose an optimal bandwidth distribution method that ensures the service required by critical flows while providing maximum service to other non-critical flows. We also propose an optimized NC approach to compute tight delay bounds. Our approach has led to computation of up to 40% tighter bounds, in an industrial AFDX configuration, as compared to the classical approach
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Jianjia. "General schedulability bound analysis and its applications in real-time systems." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/5854.

Full text
Abstract:
Real-time system refers to the computing, communication, and information system with deadline requirements. To meet these deadline requirements, most systems use a mechanism known as the schedulability test which determines whether each of the admitted tasks can meet its deadline. A new task will not be admitted unless it passes the schedulability test. Schedulability tests can be either direct or indirect. The utilization based schedulability test is the most common schedulability test approach, in which a task can be admitted only if the total system utilization is lower than a pre-derived bound. While the utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this dissertation, we develop a general framework that allows effective derivation of schedulability bounds for different workload patterns and schedulers. We introduce an analytical model that is capable of describing a wide range of tasks' and schedulers'€™ behaviors. We propose a new definition of utilization, called workload rate. While similar to utilization, workload rate enables flexible representation of different scheduling and workload scenarios and leads to uniform proof of schedulability bounds. We introduce two types of workload constraint functions, s-shaped and r-shaped, for flexible and accurate characterization of the task workloads. We derive parameterized schedulability bounds for arbitrary static priority schedulers, weighted round robin schedulers, and timed token ring schedulers. Existing utilization bounds for these schedulers are obtained from the closed-form formula by direct assignment of proper parameters. Some of these results are applied to a cluster computing environment. The results developed in this dissertation will help future schedulability bound analysis by supplying a unified modeling framework and will ease the implementation practical real-time systems by providing a set of ready to use bound results.
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Zhen. "Latency-aware Optimization of the Existing Service Mesh in Edge Computing Environment." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254621.

Full text
Abstract:
Edge computing, as an approach to leveraging computation capabilities located in different places, is widely deployed in the industry nowadays. With the development of edge computing, many big companies move from the traditional monolithic software architecture to the microservice design. To provide better performance of the applications which contain numerous loosely coupled modules that are deployed among multiple clusters, service routing among multiple clusters needs to be effective. However, most existing solutions are dedicated to static service routing and load balancing strategy, and thus the performance of the application cannot be effectively optimized when network condition changes.To address the problem mentioned above, we proposed a dynamic weighted round robin algorithm and implemented it on top of the cutting edge service mesh Istio. The solution is implemented as a Docker image called RoutingAgent, which is simple to deployed and managed. With the RoutingAgent running in the system, the weights of the target routing clusters will be dynamically changed based on the detected inter-cluster network latency. Consequently, the client-side request turnaround time will be decreased.The solution is evaluated in an emulated environment. Compared to the Istio without RoutingAgent, the experiment results show that the client-side latency can be effectively minimized by the proposed solution in the multicluster environment with dynamic network conditions. In addition to minimizing response time, emulation results demonstrate that loads of each cluster are well balanced.<br>Edge computing, som ett tillvägagångssätt för att utnyttja beräkningsfunktioner som finns på olika ställen, används i stor utsträckning i branschen nuförtiden. Med utvecklingen av kantdatabasen flyttar många stora företag från den traditionella monolitiska mjukvaruarkitekturen till mikroserviceteknik. För att ge bättre prestanda för de applikationer som innehåller många löst kopplade moduler som distribueras bland flera kluster, måste service routing bland flera kluster vara effektiva. De flesta befintliga lösningarna är dock dedikerade till statisk service-routing och belastningsbalanseringsstrategi, vilket gör att programmets prestanda inte effektivt kan optimeras när nätverksförhållandena ändras.För att ta itu med problemet som nämnts ovan föreslog vi en dynamisk viktad round robin-algoritm och implementerade den ovanpå den avancerade servicenätverket Istio. Lösningen implementeras som en Docker-bild som heter RoutingAgent, som är enkel att distribuera och hantera. Med agenten som körs i systemet ändras vikten av målruteringsklustret dynamiskt baserat på den upptäckta interklusternätets latens. Följaktligen kommer klientsidans begäran om omställningstid att minskas.Lösningen utvärderas i en emulerad miljö. Jämfört med Istio utan agent visar experimentresultaten att klientens latentitet effektivt kan minimeras av den föreslagna lösningen i multicluster-miljö med dynamiska nätverksförhållanden. Förutom att minimera responstid visar emuleringsresultat att belastningar i varje kluster är välbalanserade.
APA, Harvard, Vancouver, ISO, and other styles
6

Brahimi, Belynda. "Proposition d'une approche intégrée basée sur les réseaux de Petri de haut niveau pour simuler et évaluer les systèmes contrôlés en réseau." Phd thesis, Université Henri Poincaré - Nancy I, 2007. http://tel.archives-ouvertes.fr/tel-00200431.

Full text
Abstract:
L'étude des systèmes en réseau supports d'applications collaboratives, distribuées et interconnectées par un réseau repose sur l'identification des exigences de fonctionnement de l'application appelées Qualité de Contrôle (QdC), et sur l'évaluation des performances du réseau pour obtenir son niveau de Qualité de Service (QdS). « Cette thématique comporte d'importants verrous de nature fondamentale relevant du domaine de l'automatique, de la robotique, des capteurs, de la théorie de l'information, des réseaux. Par souci de simplification, les travaux sur les systèmes en réseau se repartissent selon deux approches: la première compense les perturbations générées par les communications au niveau de l'application (« control over network »). La seconde adapte les performances du réseau en fonction des besoins applicatifs (« control of network »). L'objectif de nos travaux de thèse est donc de proposer un environnement de modélisation intégré permettant de représenter le comportement des SCRs. Nous avons choisi les Réseaux de Petri de haut niveau qui possède un fort pouvoir d'expression, de formalisation et dont la modularité permet d'ajouter et/ou de faire évoluer les modèles qui sont développés dans ce travail. Dans un premier temps, nous avons proposé un modèle Ethernet Commuté gérant des mécanismes d'ordonnancement. Le choix de ce réseau a été guidé par le fait qu'il est de plus en plus utilisé dans les SCRs. Ensuite, le modèle d'un SCR a été proposé, et modélisé par des Réseaux de Petri de haut de niveau, en intégrant au modèle Ethernet Commuté, l'environnement applicatif : Contrôleur, Process,.. Enfin, des stratégies pour commander le réseau de façon à adapter sa Qualité de Service en regard de la Qualité de Contrôle requise par l'application, ont été mises en oeuvre. Pour cela, des ordonnanceurs à priorité stricte et de type WRR sont utilisés. Les résultats de simulation montrent clairement que des dispositifs de compensation du réseau pour améliorer les performances du système de communication, permettent aussi d'améliorer les performances du système à commander.
APA, Harvard, Vancouver, ISO, and other styles
7

"Scheduling in wireless networks: a weighted round robin approach." 2001. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0021-2603200719120015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

李益豪. "Scheduling in wireless networks: a weighted round robin approach." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/54676844338299540574.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Shih-Hao, and 林世豪. "A Weighted Round Robin QoS control for Differential Service." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/05723305329784601942.

Full text
Abstract:
碩士<br>中興大學<br>電機工程學系所<br>95<br>Abstract In order to solve the Integrated Service networks scalability and robustness questions, IETF (Internet Engineering Task Force ) proposed a Differentiated Service networks, but the Differentiated Service networks can’t guarantee End-to-End QoS of individual flow. In this thesis, we propose a Weighted Round Robin Queue Control Scheme for Differentiated Service networks that can improve the throughput of individual flow. In this scheme we use Differentiated Service Codepoint values to distinguish these individual flows in Edge Router and examine the individual flow to get the throughput. By mean of calculating the Weighted Round Robin value will come to guarantee End-to-End QoS of individual flow. Through the NS-2 network simulation we can show that the propose scheme can have better throughput of individual flow. Keywords：Integrated Services, Differentiated Services, (Quality of Services, QoS), Differentiated Service Codepoint
APA, Harvard, Vancouver, ISO, and other styles
10

Chang, Gui-Feng, and 張桂逢. "Dynamic Weighted Round Robin: A Simple Packet Scheduling Mechanism for Internet." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/57330960579913086332.

Full text
Abstract:
碩士<br>國立中正大學<br>電機工程研究所<br>88<br>Recently, real time service increase rapidly in the Internet and this kind of service all attach importance to quality of service. So an appropriate mechanism in the switch or router is needed to enhance QoS. This thesis aims to propose Dynamic Weighted Round Robin (DWRR) which is one of the solutions to guarantee the QoS. DWRR can divide the input packets into real time and non-real time and managers can subdivide class according to his requirements. Each class has reserved queue. DWRR can decide quantum size and service policy according to requirement of QoS. We also add dynamic modulated quantum size mechanism to real time service in order to guarantee the QoS. DWRR have high flexibility to change service level according to different requirement and also change parameter according to actual traffic in networks as well. This kind of flexibility can meet manager’s requirements. On the other hand, DWRR have very low complexity to implement in high-speed network environment by hardware. In this paper, the input traffic model according to the actual traffic in the network is designed and schedule the packet form input traffic model in the DWRR. We observe the result in the output, trying to analyze and compare the result in accordance with the parameter of QoS. The simulation result proves that DWRR is effective and practicable.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Weighted round robin technique"

1

Ajayi, Olasupo, Florence Oladeji, Charles Uwadia, and Afolorunsho Omosowun. "Scheduling Cloud Workloads Using Carry-On Weighted Round Robin." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98827-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vyakaranal, Shashidhara B., and Jayalaxmi G. Naragund. "Weighted Round-Robin Load Balancing Algorithm for Software-Defined Network." In Lecture Notes in Electrical Engineering. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-5802-9_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Francini, Andrea, Fabio M. Chiussi, Robert T. Clancy, Kevin D. Drucker, and Nasser E. Idirene. "Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks." In Quality of Service in Multiservice IP Networks. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44554-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Uddin, Ryhan, and Fahad Monir. "Performance Evaluation of Ryu Controller with Weighted Round Robin Load Balancer." In Communications in Computer and Information Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-84842-2_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nagar, Aditi, Neetesh Kumar Gupta, and Upendra Singh. "Precedency with Round Robin Technique for Loadbalancing in Cloud Computing." In Innovative Data Communication Technologies and Application. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38040-3_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hernando, Gorka, Susana Pérez, and José María Cabero. "Adaptive Weighted Round Robin (AWRR) Scheduling for Optimization of the Wireless Medium Virtualisation." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16644-0_58.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Eung Ju, and Hee Yong Youn. "Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth." In Computational Science and Its Applications - ICCSA 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11751632_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Datta, Jayanta, Subhamita Mukherjee, and Indrajit Pan. "Checkpoint-Based Round-Robin Scheduling Technique Toward Fault-Tolerant Resource Management in Cloud Computing." In Recent Trends in Intelligence Enabled Research. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1472-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ali, Md Hayder, and Mohammad Hanif Ali. "A Priority-Based Deficit Weighted Round Robin Queuing for Dynamic Bandwidth Allocation Algorithm in Gigabit Passive Optical Network." In Algorithms for Intelligent Systems. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8820-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Prabhmilan. "CLOUD LOAD BALANCING." In Futuristic Trends in Artificial Intelligence Volume 3 Book 8. Iterative International Publisher, Selfypage Developers Pvt Ltd, 2024. http://dx.doi.org/10.58532/v3bgai8p2ch3.

Full text
Abstract:
Cloud computing has become integral to modern IT, with major companies like Google, Microsoft, IBM, and Amazon providing various cloud services to users. This paper explores the significance and importances of load balancing in cloud computing, a crucial aspect of maintaining efficient and responsive cloud services. It delves into different load-balancing algorithms and mechanisms, offering a comprehensive understanding of the subject matter through charts, graphs, and extensive research analysis. The study begins by outlining the core concepts of cloud computing, which includes Software as a Service (SaaS), Platform as a Service (PaaS), and Infrastructure as a Service (IaaS). It emphasizes the importance of cloud service providers (CSPs). The paper then shifts its focus to load balancing, a critical component of cloud maintenance. It addresses the challenges of overloading within the cloud infrastructure and introduces Load Balancing as a Service (LBaaS) as a solution. Static load balancing algorithms like Round Robin and Weighted Round Robin are discussed in detail, highlighting their approach to distributing loads among servers. Dynamic load balancing algorithms, such as Min-Min and Max-Min, are also explored, each with its distinct advantages and limitations. Furthermore, the paper delves into additional load balancing techniques like Logical Ring Redirection, Load Buffer Range Method, Random Early Detection Method, and Page Caching. Distributed Web Server (DWS) is presented as a reliable solution for managing increasing loads, with its architecture and components outlined. In conclusion, this paper offers a comprehensive insight of load balancing in cloud servers, addressing issues of overloading and under loading servers. It discusses the rationale behind various algorithms and techniques. The study encourages further exploration of load-balancing solutions and highlights the need for algorithm complexity consideration and real-time implementation testing in future research and development efforts.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Weighted round robin technique"

1

Mohanty, Adrika, and Chiranjeevi G N. "Comparative Analysis of Round Robin Arbiter and Weighted Round Robin Arbiter." In 2024 Asia Pacific Conference on Innovation in Technology (APCIT). IEEE, 2024. http://dx.doi.org/10.1109/apcit62007.2024.10673654.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Esmacher, Mel J., John M. Jevec, Thomas M. Laronge, K. Anthony Selby, and David A. Shifler. "Evaluation of Boiler Tube Deposit Weight Density Methodology." In CORROSION 1997. NACE International, 1997. https://doi.org/10.5006/c1997-97454.

Full text
Abstract:
Abstract The T-7H-6f Work Group performed a round-robin series of deposit weight density tests on boiler tube samples. These tests utilized several techniques including chemical dissolution, mechanical scraping and glass bead blasting There were significant differences between the results obtained from the different methods and from sample to sample when using the same method.
APA, Harvard, Vancouver, ISO, and other styles
3

Hickling, J., J. Goellner, A. Burkert, and A. Heyn. "Evaluation of a Round Robin Experiment on Electrochemical Noise." In CORROSION 1998. NACE International, 1998. https://doi.org/10.5006/c1998-98385.

Full text
Abstract:
Abstract Successful measurement of electrochemical noise (EN) signals requires that a number of pre-conditions be fulfilled. In particular, fundamental understanding of the dynamics of the corrosion system concerned must be combined with an appreciation of the way in which the measurements are being made. Broader acceptance of the technique requires a joint effort by the various corrosion investigators and laboratories concerned and this, in turn, requires that a common basis for discussion be established. With this in mind, the Institute of Materials Technology and Testing (IWW) of the University of Magdeburg organised a Round Robin experiment on the measurement of EN and obtained the participation of 17 organisations (universities, commercial firms, R&amp;D laboratories) from 5 countries. The experiment involved the investigation of EN signals from aluminium and stainless steel exposed under conditions in which pitting corrosion can occur. The data provided by the participants were analysed at IWW according to various criteria. Evaluation methods included visual inspection of the noise in the curves of potential or current versus time, calculation of the standard deviation, counting of transients and transformation of the meaurements into the frequency domain. Almost all of the participants were able to detect differences in EN behaviour during different stages of the experiment qualitatively. Quantitative evaluation, however, revealed a more complex situation. At times, differences in measured EN signal intensity of two orders of magnitude were obtained as a result of the different apparatus used (sensitivity, frequency range, etc.). Nonetheless, the fact that more than half of the participants reported data within a relatively narrow scatterband is a positive result. Additional analysis of the results at IWW showed that uniform, numerical treatment of the measured data is of decisive importance in order to obtain comparable results. Furthermore, it became clear that the complex interactions between the way in which EN data are recorded (sampling rate, filtering, on-line data manipulation, baseline noise level) and the subsequent data evaluation should receive increased attention. Critical evaluation of the results from the Round Robin experiment has clearly shown that comparable EN measurements can be made if suitable equipment is used and correct procedures are adhered to. The experience gained provides a sound basis for further development of EN as a tool both for the fundamental understanding of various aspects of corrosion and for the solution of practical problems of corrosion protection, in particular in the area of corrosion monitoring.
APA, Harvard, Vancouver, ISO, and other styles
4

Zuhl, Robert W. "NACE T-3a-8F Work Group's Efforts to Develop a Calcium Carbonate Threshold Inhibition Screening Test for Cooling Water Applications." In CORROSION 1988. NACE International, 1988. https://doi.org/10.5006/c1988-88431.

Full text
Abstract:
Abstract This paper summarizes the National Association of Corrosion Engineers(NACE) T 3A-8f Work Group's efforts to develop a laboratory technique to evaluate the efficacy of calcium carbonate threshold inhibitors used in cooling water applications. The test procedure developed incorporates a synthetic cooling water at a typical cooling system temperature. However, factors such as fluid dynamics and heat transfer are not considered under the static conditions of the test procedure. Two (2) round-robin programs of a proposed test method, statistical analyses of the data, and conclusions are discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

Huet, François, and Kieu Ngo. "Electrochemical Noise - Guidance for Improving Measurements and Data Analysis." In CORROSION 2018. NACE International, 2018. https://doi.org/10.5006/c2018-11042.

Full text
Abstract:
Abstract From the results of the three Round-Robin tests on electrochemical noise (EN) measurements with dummy cells performed between 2014 and 2017 by the European Cooperative Group on Corrosion Monitoring of Nuclear Materials, it can be concluded that only very few commercial potentiostats are able to perform valid EN measurements. This paper is aimed at guiding users of the EN technique by providing the minimum knowledge for EN measurements, including the necessary validation of the signals measured at different sampling frequencies by calculation of their power spectral densities. Two practical works performed with a commercial potentiostat are proposed. The first one is devoted to the measurement of the thermal noise of three resistors of equal value connected in a ‘star' arrangement and used in the conventional three electrode EN measurement setup using a zero-resistance ammeter. This allows the instrumental noise of the equipment to be determined. The second practical work concerns pitting corrosion of two identical aluminum electrodes in potassium chloride to show that the noise impedance is equal to the modulus of the impedance of the electrodes. A bias voltage is then applied between the electrodes to obtain one anode and one cathode which shows the difficulty of analyzing the measured EN in asymmetric systems.
APA, Harvard, Vancouver, ISO, and other styles
6

Tychalas, Dimitrios, and Helen Karatza. "An Advanced Weighted Round Robin Scheduling Algorithm." In PCI 2020: 24th Pan-Hellenic Conference on Informatics. ACM, 2020. http://dx.doi.org/10.1145/3437120.3437304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tabatabaee, Seyed Mohammadhossein, Jean-Yves Le Boudec, and Marc Boyer. "Interleaved Weighted Round-Robin: A Network Calculus Analysis." In 2020 32nd International Teletraffic Congress (ITC 32). IEEE, 2020. http://dx.doi.org/10.1109/itc3249928.2020.00016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Divanovic, Soko, Milutin Radonjic, Gordana Gardasevic, and Igor Radusinovic. "Dynamic weighted round robin in crosspoint queued switch." In 2013 21st Telecommunications Forum Telfor (TELFOR). IEEE, 2013. http://dx.doi.org/10.1109/telfor.2013.6716184.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kesidis, George. "Scalable resources management using shaped weighted round-robin scheduling." In ITCom 2001: International Symposium on the Convergence of IT and Communications, edited by Sonia Fahmy and Kihong Park. SPIE, 2001. http://dx.doi.org/10.1117/12.434404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sonntag, Sören, and Helmut Reinig. "An Efficient Weighted-Round-Robin Algorithm for Multiprocessor Architectures." In 2008 41st Annual Simulation Symposium ANSS. IEEE, 2008. http://dx.doi.org/10.1109/anss-41.2008.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Weighted round robin technique"

1

Selby and Spanner. L52004 Sizing Stress Corrosion Cracking in Pipeline Specimens from the Outside Surface. Pipeline Research Council International, Inc. (PRCI), 2005. http://dx.doi.org/10.55274/r0011064.

Full text
Abstract:
The EPRI NDE Center examined specimens of carbon steel piping containing SCC, distributed by Battelle Columbus on behalf of the Gas Research Institute. Time of Flight Diffraction (TOFD) and phased-array UT techniques were used. The techniques were applied both manually and using an automated data acquisition system. This interim report conveys the results of both techniques. Beginning in 1997, EPRI used TOFD to measure the depth of cracks in three specimens designated for practice. In 1998 and 1999 GRI performed a round-robin test of several candidate crack depth sizing techniques. Each candidate was used to inspect two field removed pipe sections containing SCC. After all the techniques results had been submitted, the two specimens were sectioned to determine the true crack depth of each of the 12 specified measurement locations. EPRI participated in the round-robin using two separate implementations of an advanced ultrasonic technique known as phased array. EPRI and AEA continued to participate in GRIs investigations by applying the techniques to additional SCC specimens provided by GRI in 2000. The results of inspecting the spools were transferred to inspection vendors in May of 2002. This final report provided by EPRI summarizes the results of all of the investigations.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Weighted round robin technique' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography