Link-disjoint routing algorithm under multiple additive QoS constraints
The problem of finding link-disjoint paths under multiple additive QoS constraints was studied.Since the existing algorithms depended on network’s structure and could not guarantee to find feasible solutions for arbitrary net-works,a novel algorithm called multiple constrained link-disjoint path rou...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Chinês |
| Publicado: |
Editorial Department of Journal on Communications
2010-01-01
|
| Colección: | Tongxin xuebao |
| Materias: | |
| Acceso en línea: | http://www.joconline.com.cn/zh/article/74647201/ |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
