TITLE

ADAPTIVE PACKET SCHEDULING FOR REQUESTS DELAY GUARANTIES IN PACKET-SWITCHED COMPUTER COMMUNICATION NETWORK

AUTHOR(S)
ŚWIĄTEK, PAWEŁ; GRZECH, ADAM; RYGIELSKI, PIOTR
PUB. DATE
March 2010
SOURCE
Systems Science;2010, Vol. 36 Issue 1, p7
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network edge nodes is one of the crucial mechanisms essential for delivery of required level of quality of end-to-end network services (QoS). In order to satisfy QoS guaranties for each incoming request belonging to one of the distinguished traffic classes, packet scheduling algorithm must make decisions based on current state of the scheduling system (e.g., buffer lengths) and actual characteristics of the serviced traffic (e.g., lengths of connections following requests, packet intensities within requests, etc.). The paper proposes a new packet scheduling algorithm based on Weighted Round Robin (WRR), whose weights are adapted according to changes of network's load and traffic characteristics. By means of computer simulation, on representative examples, it was shown that utilization of additional knowledge about incoming traffic in the process of packet scheduling may improve QoS guaranties for serviced traffic.
ACCESSION #
60782705

 

Related Articles

  • An Improved Node Scheduling Scheme for Resilient Packet Ring Network. Ashourian, Mohsen; Gheisari, Mehdi; Hashemi, Ali // Majlesi Journal of Electrical Engineering;Jun2015, Vol. 9 Issue 2, p43 

    Priority Queue (PQ) algorithm is used as the scheduling scheme for Resilient Packet Ring network (RPR). The scheduler handles a specific queue on the basis that all the higher priority queues have been served and emptied. This approach ensures low delay for higher priority classes of traffic....

  • GENETIC ALGORITHM FOR SHORTEST PATH IN PACKET SWITCHING NETWORKS. CHAUDHARY, ANU; PANDEY, NEERAJ KUMAR // Journal of Theoretical & Applied Information Technology;7/31/2011, Vol. 29 Issue 2, p107 

    The problem of finding the shortest path between two nodes is a well known problem in network analysis. Optimal routing has been widely studied for interconnection networks this paper considers the problem of finding the shortest path. A Genetic algorithm based strategy is proposed and the...

  • Routing in Delay Tolerant Networks (DTN). Sammou, El Mastapha; Abdali, Abdelmounaim // International Journal of Communications, Network & System Scienc;Jan2011, Vol. 4 Issue 1, p53 

    In this paper, we address the problem of routing in delay tolerant networks (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and destination at any time, especially when the destination is not in the same region as the source, which...

  • Finding Multiple Length-Bounded Disjoint Paths in Wireless Sensor Networks. Kejia Zhang; Hong Gao // Wireless Sensor Network;Dec2011, Vol. 3 Issue 12, p384 

    In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not...

  • Joint Packet Scheduling and Radio Resource Assignment for WiMAX Networks. Nan Xu; Whijia Jia // Adhoc & Sensor Wireless Networks;2011, Vol. 13 Issue 3/4, p193 

    The IEEE 802.16 standard defines the QoS signaling framework and various types of service flows, but left the QoS based Packet Scheduling and Radio Resource Assignment undefined. This paper proposes a novel joint Packet Scheduling and Radio Resource Assignment algorithm for WiMAX Networks. Our...

  • Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm. Arivudainambi, D.; Rekha, D. // International Journal of Computers, Communications & Control;Feb2013, Vol. 8 Issue 1, p18 

    In this paper, a new efficient immune genetic algorithm (IGA) is proposed for broadcast scheduling problem in TDMA Ad hoc network. Broadcast scheduling is a primary issue in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other...

  • Delay minimization and Vehicle velocity based Traffic Control Scheme in VANET. Mishra, Namrata; Pratap, Sandeep // International Journal of Computer Applications;Jul2014, Vol. 97, p26 

    In Vehicular Ad Hoc Networks (VANET) networks, vehicles are equipped with communication equipment that allows them to exchange messages with each other in Vehicle-to-Vehicle communication (V to V) and with a roadside network infrastructure i.e. Vehicle-to-Roadside Unit Communication (V to RSU)....

  • Modified Fast Recovery Algorithm for Performance Enhancement of TCP-NewReno. Torkey, Hanaa; Attiya, Gamal; Morsi, Ibrahim Z. // International Journal of Computer Applications;Feb2012, Vol. 40, p30 

    One of the keys to the success of the Internet is relying on using efficient congestion control mechanisms. Congestion control is required not only to prevent congestion collapse in the network, but also to improve network utilization. Without congestion control, a sending node may continue...

  • Stochastic Multi-hop Model of Coding-Based Reprogramming Protocols in Lossy Wireless Sensor Networks. Jun-Wei Li; Shi-Ning Li; Yu Zhang // Applied Mechanics & Materials;2014, Vol. 687-691, p2120 

    Reprogramming in lossy wireless sensor networks is a dynamic process. Dijkstra's shortest path algorithm is used in previous work to represent the multi-hop propagation of data packets, however, it is not accurate enough to use a static model to capture the behaviors of stochastic multi-hop...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics