sch_llf study Aktuell Seminare Reports Homepage Software
printer / text mode version
university-logo
draheim
@informatik.hu-berlin.de

Reports
- postindustr.CC
- XML/Ti Report
- pTA StudienArbeit  .
- sch_llf study
- Geschichte des PC

TechDocs
- Perl Objects
- Installing Oracle
- shell cmds in python
- Using css for xml
    defs   tricks
- Unsafe mono  [x]  !
- Docbook Manpages
- Java Bean   Code
rpm-suse
 
- schema-mappingen
  ig cv hg re dv ev
  zz mk pr
- java problemsen
  lang swing ext gtk jjtree xul
 
boot
-grub-netboot
-grub-gtk
-partclone freshmeat
-partimage links
 
-releaseuploader


sitemap


-guidod-pygtk
sitemap             *offsite link

2003-12-30
(C) Guido Draheim
guidod@gmx.de

 
generated by mksite.sh

Experimental Comparison of

Fixed and Dynamic Priority Driven

Message Queuing


Addressing the problem of congestion, packet scheduling policies are useful, especially to fulfil the real-time constraints of interactive audio-video or remote-control/robotic applications. Fixed priority policies are good on end-to-end notations, and the RSVP is developping quickly. Dynamic Policies are behaving better, where the information is solely in the packets themselves, but they usually require much more processing. Todays technology does make this still cost-effective. This paper evaluates the benefit of LLF (least-laxity first) policies over fixed-priority policies.


Least Laxity First Scheduling