A new queueing strategy for the Adversarial Queueing Theory

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 1 figure, ps-trix

Scientific paper

In the today's Internet and TCP/IP-networks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are researched in this model and better results are performed by alternative queueing strategies, e.g. LIS (Longest In System). This article introduces a new queueing protocol called interval-strategy that is concerned with the reduction from dynamic to static routing. We discuss the maximum system time for a packet and estimate with up-to-date results how this can be achieved. We figure out the maximum amount of time where a packet can spend in the network (i.e. worst case system time), and argue that the universal instability of the presented interval-strategy can be reached through these results. When a large group of queueing strategies is used for queueing, we prove that the interval-strategy will be universally unstable. Finally, we calculate the maximum time of the static routing to reach an universal stable and polynomial - in detail linear - bounded interval-strategy. Afterwards we close - in order to check this upper bound - with up-to-date results about the delivery times in static routing.

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

A new queueing strategy for the Adversarial Queueing Theory 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 A new queueing strategy for the Adversarial Queueing Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new queueing strategy for the Adversarial Queueing Theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-209642

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