1022 search results - page 96 / 205 » New models and algorithms for programmable networks |
108
Voted
ASIAMS
2007
IEEE
15 years 7 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
87
Voted
WDAG
2005
Springer
15 years 6 months ago
2005
Springer
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
125
Voted
LCN
1996
IEEE
15 years 4 months ago
1996
IEEE
Development of new transport protocols or protocol algorithms suffers from the complexity of the envir onment in which they ar e intended to run. Modeling techniques attempt to av...
89
Voted
SASO
2008
IEEE
15 years 7 months ago
2008
IEEE
We investigate periodic time synchronization of networks without centralized control, which can be modeled as a problem of aligning local variables taking values on a circle. Sync...
94
Voted
IV
2003
IEEE
15 years 6 months ago
2003
IEEE
Diffusion-Limited Aggregation (DLA) is a model of fractal growth. Computer models can simulate the fast aggregation of millions of particles. In this paper, we propose a modified ...