1639 search results - page 107 / 328 » Degree-constrained network flows |
131
Voted
AINA
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a new QoS guarantee scheme called R-(m,k)-firm (Relaxed-(m,k)-firm) which provides the guarantee on transmission delay of at least m out of any k consecutive p...
111
click to vote
LISA
2004
15 years 2 months ago
2004
Analysis of network traffic is becoming increasingly important, not just for determining network characteristics and anticipating requirements, but also for security analysis. Sev...
89
Voted
CORR
2002
Springer
15 years 18 days ago
2002
Springer
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. T...
116
Voted
ICNP
1997
IEEE
15 years 5 months ago
1997
IEEE
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
109
Voted
JNCA
2008
15 years 23 days ago
2008
Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up with...