2009 International Conference on Information Technology and Computer Science 2009
DOI: 10.1109/itcs.2009.122
View full text |Buy / Rent full text
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 17 publications
(15 citation statements)
references
References 1 publication
0
15
0
Order By: Relevance
“…Whereas the nodes which are at the top having more number of queues. To eliminate the drawbacks in schemes used before Lee proposed the multi level queue scheduler which used different number of queues based on the location of the node in the network [9].…”
Section: ) Real Time Packet Scheduling Schemementioning
confidence: 99%
“…Whereas the nodes which are at the top having more number of queues. To eliminate the drawbacks in schemes used before Lee proposed the multi level queue scheduler which used different number of queues based on the location of the node in the network [9].…”
Section: ) Real Time Packet Scheduling Schemementioning
confidence: 99%
“…Bundle arranging recipe method and dynamic line administration enhances network Quality of Service. besides, most existing bundle arranging calculations of remote gadget systems are neither element nor fitting for wide choice of utilizations since these schedulers are preset and not dynamic however static, and can't be altered progressively to reaction for alteration inside of the application necessities or situations [23]- [25]. As an example, in an exceedingly ton of period of time applications, a period of time priority hardware can't be modified dynamically at some purpose within they operate and it's statically employed in wireless device network applications.…”
Section: Literature Reviewmentioning
confidence: 99%
“…To eliminate these drawbacks, Zhao Y. [23]planned associate degree improved priority-based soft period packet programming algorithmic program. Schedulers navigate the weighting queue for the data bundles and settle on the most diminutive parcel ID in light of the fact that the most noteworthy need to execute.…”
Section: Packet Typementioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, the data queue can be filled up very quickly if local data packets are more frequent that causes the discard of real-time packets from other nodes. To eliminate these drawbacks, Zhao Y. et al [127] proposed an improved priority-based soft real-time packet scheduling algorithm. Schedulers traverse the waiting queue for the data packets and choose the smallest packet ID as the highest priority to execute.…”
Section: Non-real-time Packet Schedulingmentioning
confidence: 99%