Evolution of the architecture of services

somdn_product_page

(Downloads - 0)

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Context and motivation
1.2 Contributions
1.3 Structure of this manuscript
1.4 Publications
2 Background and problem statement 
2.1 The convergence of telecommunications and computer networks
2.2 Evolution of the architecture of services
2.3 Multi-domain services
2.4 Resource allocation problems in networks
2.5 Conclusion
3 State of the art 
3.1 Defnition and model for distributed resource allocation
3.2 Distributed algorithms for the allocation of resources: state of the art and taxonomy
3.3 Performance evaluation and comparison
3.4 Conclusion
4 A distributed algorithm for the allocation of resources 
4.1 Variables of nodes and messages
4.2 Path computation
4.3 Allocation
4.4 Examples
4.5 Heuristics
4.6 Algorithm Complexity
4.7 Conclusion
5 Performance analysis 
5.1 Metrics and reference confguration
5.2 Experimental environment
5.3 Systems with one instance of n types of resources
5.4 System with m instances of n types of resources
5.5 Computing the expected value for the Average Usage Rate
5.6 Conclusion
6 Experimental comparison with state of the art algorithms
6.1 System setup
6.2 Dijkstra’s Incremental algorithm
6.3 Chandy-Misra Drinking Philosophers Problem (DrPP) algorithm
6.4 Rhee’s algorithm
6.5 Bouabdallah-Laforest algorithm
6.6 Summary
6.7 Conclusion
7 Conclusion 
7.1 Contributions
7.2 Limitations and future work

Laisser un commentaire

Votre adresse e-mail ne sera pas publiée. Les champs obligatoires sont indiqués avec *