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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

MPLS paths can be calculated on-line as demands arrive or off-line for an estimate of the traffic demand over time. Off-line calcu- lation has the advantage of allowing a globally optimal network design. From the operational standpoint, a layout design for large networks should consider minimizing the layout complexity, thus reducing the cost of operation. In this paper, we formulate an optimization problem whose objective is to minimize the number of required hops. An end-to-end path delay constraint provides quality of service (QoS) guarantees. The resulting Minimum Path Set and Flow Allocation Problem (MPSFAP), formulated as a Mixed Integer Non Linear Program (MINLP) is NP -complete. As such, it is only possible to solve it exactly on small size networks. To overcome this limitation, we designed a Tabu Search (TS) based algorithm that computes good quality approximate solutions for the MPSFAP problem. Solutions for medium to large size networks in reasonable CPU time and within acceptable optimality tolerances are found using the proposed TS based algorithm.

A Tabu Search Heuristic for the Offline MPLS Reduced Complexity Layout Design Problem