Binding registration based on home agent priority queue scheduling in MIPv6 network

2014 ◽  
Author(s):  
A. Avelin Diana ◽  
V. Ragavinodhini ◽  
K. Sundarakantham ◽  
S. Mercy Shalinie ◽  
K. Narasima Mallikarjunan
Keyword(s):  
Priority Queue ◽  
Home Agent ◽  
Queue Scheduling

Comprehensive Structure of Novel Voice Priority Queue Scheduling System Model for VoIP Over WLANs

2011 ◽  
Vol 3 (4) ◽  
pp. 50-70 ◽  
Author(s):  
Kashif Nisar ◽  
Angela Amphawan ◽  
Suhaidi B. Hassan
Keyword(s):  
Traffic Flow ◽  
Low Cost ◽  
Local Area ◽  
Priority Queue ◽  
High Rate ◽  
System Model ◽  
Scheduling System ◽  
Queue Scheduling ◽  
Voice Packets ◽  
The Voice

Voice over Internet Protocol (VoIP) has grown quickly in the world of telecommunication. Wireless Local Area Networks (WLANs) are the most performance assuring technology for wireless networks, and WLANs have facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender or a receiver depending on the direction of traffic flow over the network. A VoIP application requires high throughput, low packet loss, and a high fairness index over the network. The packets of VoIP streaming may experience drops because of the competition among the different kinds of traffic flow over the network. A VoIP application is also sensitive to delay and requires the voice packets to arrive on time from the sender to the receiver side without any delay over WLAN. The scheduling system model for VoIP traffic is an unresolved problem. The objectives of this paper are to identify scheduler issues. This comprehensive structure of Novel Voice Priority Queue (VPQ) scheduling system model for VoIP over WLAN discusses the essential background of the VPQ schedulers and algorithms. This paper also identifies the importance of the scheduling techniques over WLANs.

scholarly journals Load Balancing Using SJF-MMBF and SJF-ELM Approach

2021 ◽  
pp. 74-86
Author(s):  
S. Rekha ◽  
C. Kalaiselvi
Keyword(s):  
Cloud Computing ◽  
Scheduling Algorithm ◽  
Dynamic Environment ◽  
Scheduling Algorithms ◽  
Computing System ◽  
Priority Queue ◽  
Lower Priority ◽  
Cloud Computing System ◽  
Queue Scheduling ◽  
Multi Level

This paper studies the delay-optimal virtual machine (VM) scheduling problem in cloud computing systems, which have a constant amount of infrastructure resources such as CPU, memory and storage in the resource pool. The cloud computing system provides VMs as services to users. Cloud users request various types of VMs randomly over time and the requested VM-hosting durations vary vastly. A multi-level queue scheduling algorithm partitions the ready queue into several separate queues. The processes are permanently assigned to one queue, generally based on some property of the process, such as memory size, process priority or process type. Each queue has its own scheduling algorithm. Similarly, a process that waits too long in a lower-priority queue may be moved to a higher-priority queue. Multi-level queue scheduling is performed via the use of the Particle Swarm Optimization algorithm (MQPSO). It checks both Shortest-Job-First (SJF) buffering and Min-Min Best Fit (MMBF) scheduling algorithms, i.e., SJF-MMBF, is proposed to determine the solutions. Another scheme that combines the SJF buffering and Extreme Learning Machine (ELM)-based scheduling algorithms, i.e., SJF- ELM, is further proposed to avoid the potential of job starva¬tion in SJF-MMBF. In addition, there must be scheduling among the queues, which is commonly implemented as fixed-priority preemptive scheduling. The simulation results also illustrate that SJF- ELM is optimal in a heavy-loaded and highly dynamic environment and it is efficient in provisioning the average job hosting rate.

Comprehensive Structure of Novel Voice Priority Queue Scheduling System Model for VoIP over WLANs

2013 ◽  
pp. 257-278
Author(s):  
Kashif Nisar ◽  
Angela Amphawan ◽  
Suhaidi B. Hassan
Keyword(s):  
Traffic Flow ◽  
Low Cost ◽  
Local Area ◽  
Priority Queue ◽  
High Rate ◽  
System Model ◽  
Scheduling System ◽  
Queue Scheduling ◽  
Voice Packets ◽  
The Voice

Voice over Internet Protocol (VoIP) has grown quickly in the world of telecommunication. Wireless Local Area Networks (WLANs) are the most performance assuring technology for wireless networks, and WLANs have facilitated high-rate voice services at low cost and good flexibility. In a voice conversation, each client works as a sender or a receiver depending on the direction of traffic flow over the network. A VoIP application requires high throughput, low packet loss, and a high fairness index over the network. The packets of VoIP streaming may experience drops because of the competition among the different kinds of traffic flow over the network. A VoIP application is also sensitive to delay and requires the voice packets to arrive on time from the sender to the receiver side without any delay over WLAN. The scheduling system model for VoIP traffic is an unresolved problem. The objectives of this paper are to identify scheduler issues. This comprehensive structure of Novel Voice Priority Queue (VPQ) scheduling system model for VoIP over WLAN discusses the essential background of the VPQ schedulers and algorithms. This paper also identifies the importance of the scheduling techniques over WLANs.

scholarly journals Multi Level Queue Scheduling with Particle Swarm Optimization (Mlqs-Pso) of Vms in Queueing Heterogeneous Cloud Computing Systems

2020 ◽  
Vol 8 (5) ◽  
pp. 864-872
Keyword(s):  
Cloud Computing ◽  
Particle Swarm Optimization ◽  
Scheduling Algorithm ◽  
Particle Swarm ◽  
Priority Queue ◽  
Computing Systems ◽  
Swarm Optimization ◽  
Queue Scheduling ◽  
Multi Level ◽  
Learning Machine

This article investigates in cloud computing systems about problem of delay optimal Virtual Machine (VM) scheduling holds constant resources with full infrastructure like CPU, memory and storage in the resource pool. Cloud computing offers users with VMs as utilities. Cloud consumers randomly demand different VM types over time, and the usual length of the VM hosting differs greatly. A scheduling algorithm for a multilevel queue divides the prepared queue towards lengthy and various queues. System is allocated with single queue in to several longer queues. The systems are allocated to one queue indefinitely, usually on any basis of process property, like memory size, process priority, or process sort. Every queue will have its self-algorithm for scheduling. Likewise, a system that’s taking in a less preference queue is so lengthy, a high-priority queue can be transferred. Using Particle Swarm Optimization Algorithm (MQPSO), Multi-level queue scheduling has been done. To evaluate the solutions, it explores both Shortest-JobFirst (SJF) buffering and Min-Min Best Fit (MMBF) programming algorithms, i.e., SJF-MMBF. The scheme incorporating the SJF-ELM-specific scheduling algorithms depending SJF buffering and Extreme Learning Machine (ELM) is also being proposed to prevent work hunger in an SJF-MMBF system. Furthermore, the queues must be planned, which is usually used as a preventive fixed priority schedule. The results of the simulation show that the SJF-ELM is ideal inside strong duty as well as maximum is environment dynamically, with an efficient average employment hosting rate.

Sign in / Sign up

Export Citation Format

Share Document