Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

Eramo, V.; Lavacca, Francesco G.; Catena, Tiziana; Polverini, Marco; Cianfrani, Antonio

doi:10.3390/fi11030071

Cited by 16 publications

(15 citation statements)

References 30 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sixth paper [6] deals with the design and evaluation of a scalable NFV orchestration architecture that supports elastic cloud and bandwidth resource allocation. A further contribution of the paper is the use of segment routing (SR) to implement the data plane of the proposed architecture, achieving an overall solution of reduced complexity with respect to the corresponding of traditional orchestrations.…”

Section: Contributionsmentioning

confidence: 99%

Software Defined Networking (SDN) and Network Function Virtualization (NFV)

Papavassiliou

2020

Future Internet

View full text Add to dashboard Cite

The role of Software Defined Networking (SDN) and Network Function Virtualization (NFV) have been instrumental in realizing the transition and vision “from black boxes to a white box towards facilitating 5G network architectures”. Though significant research results and several deployments have occurred and realized over the last few years focusing on the NFV and SDN technologies, several issues—both of theoretical and practical importance—remain still open. Accordingly, the papers of this special issue are significant contributions samples within the general ecosystem highlighted above, ranging from SDN and NFV architectures and implementations, to SDN-NFV integration and orchestration approaches, while considering issues associated with optimization, network management and security aspects. In particular, a total of nine excellent articles (one review and eight original research articles) have been accepted, following a rigorous review process, and addressing many of the aforementioned challenges and beyond.

show abstract

Section: Contributionsmentioning

confidence: 99%

Software Defined Networking (SDN) and Network Function Virtualization (NFV)

Papavassiliou

2020

Future Internet

View full text Add to dashboard Cite

show abstract

“…In this regard, a service deployment algorithm that is cognizant of the limited information exposure is well suited for service deployment under this scenario. Moreover, abstracting the internal topology of the different domains from the global orchestrator has been found to result in a significant reduction in the solution computation time with a tenable cost increment [18], [26], [27]. The authors in [26] and [18], [27] analyzed the time reduction gain and provisioning cost performance, respectively, resulting from abstracting the internal topologies of the different domains in the multiprovider service deployment problem.…”

Section: Introductionmentioning

confidence: 99%

A Multi-Stage Graph Aided Algorithm for Distributed Service Function Chain Provisioning Across Multiple Domains

et al. 2021

View full text Add to dashboard Cite

Network Service Providers (NSPs) envisage to support the divergent and stringent requirements of future services by instantiating these services as service chains, commonly referred to as Service Function Chains (SFCs), that are customized and configured to meet specific service requirements. However, due to the limited footprint of the Infrastructure Providers (InPs), these SFCs may have to transcend multiple InPs/domains. In this regard, determining the optimal set of InPs in which to embed the SFC request emerges as a complex problem for several reasons. First, the large number of possible combinations for selecting the InPs to embed the different sub-chains of the request makes this problem computationally complex, rendering optimal solutions only after long computations, especially in large scale networks, which is unfeasible for delay sensitive applications. Second, the unwillingness of InPs to disclose their internal information, which may be vital for making embedding decisions, usually implies the provisioning of single-domain solutions, which are unsuitable in this working scenario. In this regard, this paper first formulates the multi-domain service deployment problem under multiple request constraints, such as bandwidth or delay, among others. Then, due to the NP-hardness nature of the above problem, this paper proposes an algorithm that is aided by a multi-stage graph for computing a request embedding solution in a distributed manner, solving the problem in acceptable run-times. Results from different simulations reveal that the proposed algorithm is optimized in terms of acceptance ratio and embedding cost, with up to 60.0% and 88.7% improvements in terms of embedding cost and execution time, respectively, for some scenarios, in comparison with a benchmark state-of-the-art algorithm.

show abstract

“…These challenges exist both in the Internet network cores and in cellular networks, whether these are C-RAN-based [4] or massive MIMO base-station-based networks [5]. Methods to perform effective network resource orchestration to minimize the bandwidth and network resource consumption were presented in [6]. However, to achieve the benefits of SDN orchestration, the base-stations or the C-RAN need to cross optimize the scheduling mechanism together with the physical layer beamforming [4,[7][8][9] Moreover, dealing with both priority and deadline constraints requires a new approach to user scheduling and resource allocation, which ensures that the scheduler and the physical layer are harmonized to optimize performance.…”

Section: Introductionmentioning

confidence: 99%

“…Optimal resource allocation even without beamforming is an NP hard problem [6] and [32]. This implies that our policy is likely to be sub-optimal.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Scheduling for Multi-User Multi-Input Multi-Output Wireless Networks with Priorities and Deadlines

Raviv

Leshem

2019

Future Internet

View full text Add to dashboard Cite

The spectral efficiency of wireless networks can be significantly improved by exploiting spatial multiplexing techniques known as multi-user MIMO. These techniques enable the allocation of multiple users to the same time-frequency block, thus reducing the interference between users. There is ample evidence that user groupings can have a significant impact on the performance of spatial multiplexing. The situation is even more complex when the data packets have priority and deadlines for delivery. Hence, combining packet queue management and beamforming would considerably enhance the overall system performance. In this paper, we propose a combination of beamforming and scheduling to improve the overall performance of multi-user MIMO systems in realistic conditions where data packets have both priority and deadlines beyond which they become obsolete. This method dubbed Reward Per Second (RPS), combines advanced matrix factorization at the physical layer with recently-developed queue management techniques. We demonstrate the merits of the this technique compared to other state-of-the-art scheduling methods through simulations.Future Internet 2019, 11, 172 2 of 20 the overall system constraints. To be optimal in the context of a multi-user MIMO system, we need a different approach to the physical layer beamforming and coding design.The downlink of the MU-MIMO channel is known in the information theoretic context as the Broadcast Channel (BC). Several methods have been proposed to improve data rates over the broadcast channel. The Dirty Paper Coding (DPC) concept [10] for non-causally known multi-user interference at the transmitter was proven to eliminate the interference perfectly without power penalty.The main drawback of this method is that finding the resulting optimal transmit co-variances has very high computational complexity. To reduce this computational complexity, several other beamforming techniques have been proposed. Zero-Forcing (ZF) beamforming was introduced as a simple alternative to DPC. In [11], the relationship between the linear ZF precoding design and generalized inverses in linear algebra was presented. Typically, the ZF method is sub-optimal. However, it has been shown to suffer a constant loss relative to capacity achieving approaches such as DPC in the case of large numbers of users and a high signal-to-noise ratio [12,13].To overcome the shortcomings of ZF beamforming, where transmission to non-orthogonal users suffers significant power penalty, the proper scheduling and grouping of packets are required [13] to achieve optimal behavior. Indeed, the work in [7,13,14] proposed opportunistic or greedy grouping of users. This is indeed a special case of the general problem of joint scheduling and beamforming. This problem is known to be NP-hard [9]. Several approaches have been taken in order to propose scheduling with lower complexity beyond the greedy solutions above. Convex approximation algorithms were proposed in [9]. In the case of large numbers of MSs, opportunistic policies achieve near ...

show abstract

Effectiveness of Segment Routing Technology in Reducing the Bandwidth and Cloud Resources Provisioning Times in Network Function Virtualization Architectures

Cited by 16 publications

References 30 publications

Software Defined Networking (SDN) and Network Function Virtualization (NFV)

Software Defined Networking (SDN) and Network Function Virtualization (NFV)

A Multi-Stage Graph Aided Algorithm for Distributed Service Function Chain Provisioning Across Multiple Domains

Scheduling for Multi-User Multi-Input Multi-Output Wireless Networks with Priorities and Deadlines

Contact Info

Product

Resources

About