1639 search results - page 132 / 328 » Degree-constrained network flows |
131
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— With the rapid growth of Internet, parameter design and analysis for large-scale networks has become a topic of active interest. Since simulation of such large scale systems is...
132
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
111
click to vote
FPL
2009
Springer
15 years 9 months ago
2009
Springer
This paper presents an FPGA-friendly approach to tracking elephant flows in network traffic. Our approach, Single Step Segmented Least Recently Used (S3 -LRU) policy, is a netwo...
191
click to vote
ECUMN
2004
Springer
15 years 8 months ago
2004
Springer
In a competitive telecommunications marketplace, operators must provide customers with rapid access to both new and traditional service offerings. Market share is developed through...
112
click to vote
ENTCS
2008
15 years 4 months ago
2008
A Network-on-Chip (NoC) is increasingly needed to interconnect the large number and variety of Intellectual Property (IP) cells that make up a System-on-Chip (SoC). The network mu...