2010 Second International Conference on Network Applications, Protocols and Services 2010
DOI: 10.1109/netapps.2010.54
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Simulation of Scheduling Mechanism in Packet Switching Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…The basic approach to transmitting a packet in every network is FIFO. In queue, the first packet is served first in an exact time slot, in spite of any prioritization, security, or even fairness [6]. Therefore, it is easy to simulate.…”
Section: Description Of Fifomentioning
confidence: 99%
See 2 more Smart Citations
“…The basic approach to transmitting a packet in every network is FIFO. In queue, the first packet is served first in an exact time slot, in spite of any prioritization, security, or even fairness [6]. Therefore, it is easy to simulate.…”
Section: Description Of Fifomentioning
confidence: 99%
“…Therefore, it is easy to simulate. Nevertheless, it fails to arrive at all other priority customize excluding difficulty FIFO suffers from the "HOL problem that refers to that if the first packet in the queue is blocked for any reason, the remaining is blocked although the link is idle" [6].…”
Section: Description Of Fifomentioning
confidence: 99%
See 1 more Smart Citation
“…However, it fails to achieve all other scheduling properties except complexity. FIFO suffers from head of line (HOL) issue, which means that if the first packet in the queue is blocked for any reason, the rest is blocked even though the link is idle [1].…”
Section: A First-in-first-out (Fifo)mentioning
confidence: 99%
“…Priority Queuing is developed to overcome the problem of FIFO, which does not provide any priority to any class or any data traffic. PQ generally ensures the fastest service of high priority data at every point where it is used [1]. It gives strict priority to the traffic, which is very important.…”
Section: B Priority Queuing (Pq)mentioning
confidence: 99%