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...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Chinês |
| Baskı/Yayın Bilgisi: |
Editorial Department of Journal on Communications
2010-01-01
|
| Seri Bilgileri: | Tongxin xuebao |
| Konular: | |
| Online Erişim: | http://www.joconline.com.cn/zh/article/74647201/ |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|