Availability of service in mesh-restorable transport networks
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
We present a collection of studies related to the availability of service in mesh-restorable transport networks. The issue of service availability in transport networks is of increasing importance due to our always increasing reliance on telecommunication networks, which now requires that network operators give service-availability guarantees to their customers in the form of service level agreements (SLA). It is therefore important to study network architectures in terms of the level of service availability they provide, and not just on capacity efficiency, simplicity of operation, cost, etc. This work deals with this issue for transport networks using a mesh architecture and more specifically for dynamic mesh-restorable networks. After a long era where ring-based systems dominated the world of transport networking, the mesh architecture appears to be the solution of choice for future optical transport networks. The mesh architecture is already known for its high capacity efficiency (little capacity is required to serve demands and to guarantee restorability to failures), the simplicity of service provisioning (new service paths can usually be provisioned on shortest path), and for its good scalability (capacity only needs to be added where exhausted therefore making the network scaling easy). However, the issue of service availability in mesh-restorable networks was yet to be investigated. We first develop theoretical and practical approaches for determining the availability of service paths in mesh-restorable transport networks that are designed to be restorable to any single span-failure. This initial treatment of the problem shows the major influence that dual span-failure restorability has on service availability—the importance of considering dual span-failure scenarios is later reinforced by a study of the effects of maintenance actions on network restorability. It is also demonstrated that, despite what intuition tells us, restoration time has in fact little impact on service availability. The influence of various factors on dual-span failure restorability (and therefore on availability) is also investigated. We then present several network capacity design methods for serving demands with various restorability requirements: first considering the case of demands with higher restorability requirements (single span-failure restorability and dual span-failure restorability), and then considering a multi quality of protection environment with demands having restorability requirements ranging from single span-failure restorability down to preemptible services. The thesis also provides an initial theoretical treatment of the availability of service in networks using p-cycle protection—a new survivability scheme offering fast restoration and high capacity efficiency—, and a comparison between the availability of service with dynamic mesh-restoration and with ring-based protection. Experimental results are obtained using a set of detailed test networks of various sizes and connectivity. The results show the very high potential of mesh-restorable networks to simultaneously serve various types of availability requirements from low requirements to requirements of ultra high availability—higher than the availability of paths in ring-based networks—through the use of a multi QoP environment, and to benefit from that multi service aspect to achieve high capacity efficiency.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle