1404 search results - page 119 / 281 » On General Laws of Complex Networks |
127
click to vote
NETCOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
121
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
117
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
147
click to vote
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
131
click to vote
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...