English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider a task of serving requests that arrive in an online fashion inSoftware-Defined Networks (SDNs) with network function virtualization (NFV).Each request specifies an abstract routing and processing "plan" for a flow.Each processing function can be performed by a specified subset of servers inthe system. The algorithm needs to either reject the request or admit it andreturn detailed routing (a.k.a. "path computation") and processing assignment("function placement"). Each request also specifies the communication bandwidthand the processing load it requires. Components in the system (links andprocessors) have bounded capacity; a feasible solution may not violate thecapacity constraints. Requests have benefits and the goal is to maximize thetotal benefit of accepted requests.  In this paper we first formalize the problem, and propose a new service modelthat allows us to cope with requests with unknown duration. The new servicemodel augments the traditional accept/reject schemes with a new possibleresponse of "stand by." Our main result is an online algorithm for pathcomputation and function placement that guarantees, in each time step,throughput of at least $\Omega\left(\frac{\text{OPT}^*}{\log n}\right)$, where$n$ is the system size and $\text{OPT}^*$ is an upper bound on the maximalpossible throughput. The guarantee holds assuming that requests ask for at mostan $O\left(1/{\log n}\right)$-fraction of the capacity of any component in thesystem. Furthermore, the guarantee holds even though our algorithm servesrequests in an all-or-nothing fashion using a single path and never preemptsaccepted flows, while $\text{OPT}^*$ may serve fractional requests, may splitthe allocation over multiple paths, and may arbitrarily preempt and resumeservice of requests.

Competitive Path Computation and Function Placement in SDNs