Effective Scheduling in Networks - TRUMP

A. Caroline Mary¹ , A. V. Senthil Kumar²

¹ Department of Computer Technology, Sri Krishna Arts and Science College, Tamilnadu, India.
² Department of MCA, Hindustan College of Arts and Science, Coimbatore , India.

Correspondence should be addressed to: marypsgtech@gmail.com.

Section:Review Paper, Product Type: Journal
Vol.5 , Issue.6 , pp.27-30, Dec-2017

CrossRef-DOI:   https://doi.org/10.26438/ijsrnsc/v5i6.2730

Online published on Dec 31, 2017

Copyright © A. Caroline Mary, A. V. Senthil Kumar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

1494 Views    550 Downloads    467 Downloads

Abstract :
Due to the growth of internet, there arises the need for large amount of data transactions in the Network. Making the best uses of resources is the most important thing. Resources like bandwidth should be used effectively to make sure that the packets reaches on time. Issues like loss of packets, packet delay should be addressed. Scheduling and Routing have to be perfect enough so that the data transactions in network takes place at ease. Number of routing and scheduling algorithm do exists and its necessary to choose the best routing path and to schedule it. When there are n number of packets ready to be scheduled, scheduling algorithms like FCFS, Time to live, Priority based , Adaptive double ring scheduling etc can be considered according to the needs. To make effective use of resources backlogs can be considered while Scheduling. Issues like packet loss are expected because of the importance over the larger queue. Solutions are discussed.

Key-Words / Index Term :
Backlog, Packets, Scheduling

References :
[1]. Zhenzhen Jiao, Wei Gong, Cheng Li, , Baoxian Zhang. Virtual Gradient based Back-Pressure Scheduling in Wireless Multi-Hop Networks. IEEE ICC 2015 - Mobile and Wireless Networking Symposium. PP. 3281 - 3286
[2] Loc X. Bui, Associate Member, IEEE, R. Srikant, Fellow, IEEE, and Alexander Stolyar. A Novel Architecture for Reduction of Delay
and Queueing Structure Complexity
in the Back-Pressure Algorithm. IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 6, DECEMBER 2011. PP- 1597 - 1609
[3]. Suhas Bansode, Santosh Sambare, “Performance Evaluation of Dynamic Multilevel Priority (DMP) Packet Scheduling Method for Wireless Sensor Networks (WSNs)�, International Conference on Pervasive Computing (ICPC) 2015.
[4]. Vijay Gabale, Bhaskaran Raman, Partha Dutta, and Shivkumar Kalyanraman. A Classification Framework for Scheduling Algorithms in Wireless Mesh Networks. IEEE COMMUNICATIONS SURVEYS & TUTORIALS, VOL. 15, NO. 1, FIRST QUARTER 2013. PP - 199 – 221.
[5]. Bo Ji, Changhee Joo, and Ness B. Shroff. Exploring the Inefficiency and Instability of Back-Pressure Algorithms. 2013 Proceedings IEEE INFOCOM.PP- 1528 – 1536.
[6]. Prathap M1 , Antony Selvadoss.Thanamani2Real-time Packet Performances under Socket Application. IJSRNSC, 201784-89