In this paper, we have experimentally compared synchronized versus asynchronized all-optical deflection networks. The originality of our approach is first that we have included a model of bursty traffic : it is simulated by a bi-Poissonian emission. Second, we have compared four routing modes : synchronous mode, partially synchronous mode, and asynchronous modes with fixed and bounded size packets. All modes were considered under the same emission protocols. More precisely, we have run the several experiments with a careful attention to the several time scalings related to these different modes. Our experiments mainly show that the natural decrease of the performances of the asynchronous mode, compared to the synchronous mode, can be balanc...
Ankara : Department of Computer Engineering and Information Science and the Institute of Engineering...
Fundamental performance limits of multi-hop wireless transmissions are currently being investigated ...
Gossiping is an information dissemination problem in which each node of a communication network has ...
In this paper, we deal with the compact routing problem, that is the problem of implementing routing...
In this paper, we describe a new adaptive routing algorithm for meshed-topology deflection networks....
High speed networks are now providing incredible performance. Software evolution is slow and the old...
WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that ex...
Consider shortest path interval routing, a popular memory-balanced method for solving the routing pr...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
Researchers in the area of distributed computing conduct many of their experiments in simulation. Wh...
Given a set $L$ of $n$ points in the $d$-dimensional Cartesian space $E^d$, and a query specifying a...
Even if the design of asynchronous circuits reaches a certain level of maturity, they are still cons...
In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorit...
The research presented in this thesis was conducted in the context of the Mosaic C, an experimental,...
Ankara : Department of Computer Engineering and Information Science and the Institute of Engineering...
Fundamental performance limits of multi-hop wireless transmissions are currently being investigated ...
Gossiping is an information dissemination problem in which each node of a communication network has ...
In this paper, we deal with the compact routing problem, that is the problem of implementing routing...
In this paper, we describe a new adaptive routing algorithm for meshed-topology deflection networks....
High speed networks are now providing incredible performance. Software evolution is slow and the old...
WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that ex...
Consider shortest path interval routing, a popular memory-balanced method for solving the routing pr...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
This thesis presents a design style for implementing communicating sequential processes (CSP) as qua...
Researchers in the area of distributed computing conduct many of their experiments in simulation. Wh...
Given a set $L$ of $n$ points in the $d$-dimensional Cartesian space $E^d$, and a query specifying a...
Even if the design of asynchronous circuits reaches a certain level of maturity, they are still cons...
In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorit...
The research presented in this thesis was conducted in the context of the Mosaic C, an experimental,...
Ankara : Department of Computer Engineering and Information Science and the Institute of Engineering...
Fundamental performance limits of multi-hop wireless transmissions are currently being investigated ...
Gossiping is an information dissemination problem in which each node of a communication network has ...