| 1. |
- Vaishnavi, I., et al.
(författare)
-
Realizing services and slices across multiple operator domains
- 2018
-
Ingår i: Proceedings 2018 IEEE/IFIP Network Operations and Management Symposium, NOMS 2018. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1-7
-
Konferensbidrag (refereegranskat)abstract
- Supporting end-to-end network slices and services across operators has become an important use case of study for 5G networks as can be seen by 5G use cases published in 3GPP, ETSI as well as NGMN. This paper presents the in- depth architecture, implementation and experiment on a multidomain orchestration framework that is ab le to deploy such multi-operator service as well as monitor the service for SLA compliance. Our implemented architecture allows operators to abstract their sensitive details while exposing the relevant amount of information to support inter-operator slice creation. Our experiment shows that the implemented framework is capable of creating services across operators while fulfilling the respective service requirements.
|
|
| 2. |
- Pioro, Michal, et al.
(författare)
-
On open shortest path first related network optimisation problems
- 2002
-
Ingår i: Performance Evaluation. - 0166-5316. ; 48:1-4, s. 201-223
-
Tidskriftsartikel (refereegranskat)abstract
- The paper deals with flow allocation problems in IP networks using open shortest path first (OSPF) routing. Its main purpose is to discuss and propose methods for finding settlements of OSPF link weight system realising the assumed demand pattern for the given network resources (links capacities). Such settlements can result in a significantly better network performance, as compared with the simplified weight setting heuristics typically used nowadays. Although the configuration of the link weight system is primarily done in the network planning phase, still additional re-optimisations are feasible, and in fact essential, in order to cope with major changes in traffic conditions and with major resources' failures and rearrangements. The paper formulates a relevant OSPF routing optimisation problem, proves its NP-completeness, and discusses possible heuristic approaches and related optimisation methods for solving it. Two basic approaches are considered (the direct approach and the two-phase approach) and the resulting optimisation algorithms are presented. The considerations are illustrated with numerical results. (C) 2002 Elsevier Science B.V. All rights reserved.
|
|
