2013
DOI: 10.5121/ijcnc.2013.5308
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Hierarchical Scheduling for Heterogeneous Traffic Over Network

Abstract: Scheduling real time and non real time packets at network nodes has an important impact by reducing theprocessing overhead, queuing delay and response time. Most of the existing packet scheduling algorithmsused in network based on First-In First-Out (FIFO), non-preemptive priority, and preemptive priorityscheduling. However, these algorithms incur a large processing overhead, queuing delay and responsetime and are not dynamic to the data traffic changes. In this paper, we present a new hierarchicalscheduling a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Future work in this research field may specially include: (i) to implement the proposals herein presented together with proven-efficient piece selection policies of the literature, resulting in novel BitTorrent-like proposals for on-demand streaming systems. These proposals should be then compared with others of the literature; (ii) to quantify the data-retrieving efficiency that may be granted to BitTorrent-like protocols by the eventual deployment of local buffers on the client´s side, under interactive scenarios; (iii) to look into the peer request problem [23], the service request problem [23], and the traffic locality of P2P file swarming systems [19,24] to see whether there is still space to optimize the BitTorrent's peer and piece selection policies [25], respectively, targeting at on-demand streaming solutions; (iv) lastly, to examine the influences of the Network Address Translation (NAT) service [26] as well as of traffic hierarchical scheduling [27] on the design of P2P on-demand streaming protocols.…”
Section: Discussionmentioning
confidence: 99%
“…Future work in this research field may specially include: (i) to implement the proposals herein presented together with proven-efficient piece selection policies of the literature, resulting in novel BitTorrent-like proposals for on-demand streaming systems. These proposals should be then compared with others of the literature; (ii) to quantify the data-retrieving efficiency that may be granted to BitTorrent-like protocols by the eventual deployment of local buffers on the client´s side, under interactive scenarios; (iii) to look into the peer request problem [23], the service request problem [23], and the traffic locality of P2P file swarming systems [19,24] to see whether there is still space to optimize the BitTorrent's peer and piece selection policies [25], respectively, targeting at on-demand streaming solutions; (iv) lastly, to examine the influences of the Network Address Translation (NAT) service [26] as well as of traffic hierarchical scheduling [27] on the design of P2P on-demand streaming protocols.…”
Section: Discussionmentioning
confidence: 99%