Computer Science – Networking and Internet Architecture
Scientific paper
2012-04-24
Computer Science
Networking and Internet Architecture
15 pages
Scientific paper
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when the policy is permitted to drop already admitted packets) and non-push-out cases. In particular, we provide analytical guarantees for the throughput performance of our algorithms. We further conduct a comprehensive simulation study which experimentally validates the predicted theoretical behaviour.
Kogan Kirill
Lopez-Ortiz Alejandro
Nikolenko Sergey I.
Sirotkin Alexander V.
Tugaryov Denis
No associations
LandOfFree
FIFO Queueing Policies for Packets with Heterogeneous Processing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with FIFO Queueing Policies for Packets with Heterogeneous Processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and FIFO Queueing Policies for Packets with Heterogeneous Processing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-520617