Mean field calculation for optical grid dimensioning
For traditional optical network dimensioning, a plethora of algorithms exists to design the amount of network resources required to accommodate a given amount of traffic, expressed as a (source, destination)-based traffic matrix. In optical Grid dimensioning, however, the anycast principle applies:...
- Autores:
- Tipo de recurso:
- Fecha de publicación:
- 2010
- Institución:
- Universidad del Rosario
- Repositorio:
- Repositorio EdocUR - U. Rosario
- Idioma:
- eng
- OAI Identifier:
- oai:repository.urosario.edu.co:10336/28117
- Acceso en línea:
- https://doi.org/10.1364/JOCN.2.000355
https://repository.urosario.edu.co/handle/10336/28117
- Palabra clave:
- Algorithms
Hybrid circuits
Network topology
Optical networks
Particle physics
Routing algorithms
- Rights
- License
- Restringido (Acceso a grupos específicos)
| Summary: | For traditional optical network dimensioning, a plethora of algorithms exists to design the amount of network resources required to accommodate a given amount of traffic, expressed as a (source, destination)-based traffic matrix. In optical Grid dimensioning, however, the anycast principle applies: Grid users do not really care where exactly their tasks (Grid jobs) end up being executed. Thus, the destination of traffic is not known beforehand and traditional dimensioning algorithms are not applicable. In this paper we propose a mean field calculation method to analytically derive the traffic matrix for given job arrival intensities at the originating Grid sites (the sources). We also indicate how it can be integrated in a stepwise dimensioning approach to compute not only the amount of network resources, but also Grid resources (computational and/or storage). Hence it forms part of a solution for Grid dimensioning: determining how many servers to provide, where to place them, and which network to install for interconnecting server sites and users generating Grid jobs. |
|---|