FIFO Queueing Policies for Packets with Heterogeneous Processing

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-520617

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.