WAN design with demand, hop limit and path diversity constraints
This thesis presents a challenging telecommunication network design problem, in which the network designer has to assure not only connectivity, but also some degree of performance guarantee and survivability to the solution. We introduce a topological and capacity design, with node-pair constraints...
Sparad:
| Huvudupphov: | |
|---|---|
| Materialtyp: | masterThesis |
| Språk: | engelska |
| Utgiven: |
2008
|
| Ämnen: | |
| Länkar: | http://hdl.handle.net/20.500.12008/2950 |
| Taggar: |
Inga taggar, Lägg till första taggen!
|
Liknande verk: WAN design with demand, hop limit and path diversity constraints
- Techniques d'ingénierie de trafic dynamique pour l'internet
- Real path planning based on genetic algorithm and Voronoi diagrams
- Polynomial-time topological reductions that preserve the diameter constrained reliability of a communication network :un ambiente para el desarrollo de experimentos científicos
- Vertical Movement of Resonance Hopping Robot with Electric Drive and Simple Control System
- Invariant and vulnerable food web components after bullfrog invasion
- Canonical analysis of the gravitational description of the deformation