Abstract
Packet scheduling in a network providing differentiated services, where each packet is assigned a value, was considered. The nonpreemptive, FIFO preemptive, and bounded delay models were studied. The resultant data were analyzed in detail.
Original language | English |
---|---|
Pages | 761-770 |
Number of pages | 10 |
State | Published - 2003 |
Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: 2 Nov 1998 → 3 Nov 1998 |
Conference
Conference | Configuralble Computing: Technology and Applications |
---|---|
Country/Territory | United States |
City | Boston, MA |
Period | 2/11/98 → 3/11/98 |