Sciweavers

3637 search results - page 42 / 728
» Application of Network Calculus to Guaranteed Service Networ...
Sort
View
102
Voted
ICNP
1998
IEEE
15 years 6 months ago
Adaptive Packet Marking for Providing Differentiated Services in the Internet
This paper examines the use of adaptable priority marking for providing soft bandwidth guarantees to individual connections or connection groups over the Internet. In contrast to ...
Wu-chang Feng, Dilip D. Kandlur, Debanjan Saha, Ka...
122
Voted
ICNP
1997
IEEE
15 years 6 months ago
On-line Dynamic Bandwidth Allocation
Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these g...
Errin W. Fulp, Douglas S. Reeves
ICNP
2005
IEEE
15 years 7 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
122
Voted
ATMN
1993
15 years 3 months ago
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Quality-of-service (QOS) requirements for applications in high-speed networks are typically specied on an end-to-end basis. Mapping this end-to-end requirement to nodal requiremen...
Ramesh Nagarajan, James F. Kurose, Donald F. Towsl...
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 8 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi