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/

Zendy Plus

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

Zendy Tools

Zendy Open

We present a formal model to represent and solve the unicast/multicastrouting problem in networks with Quality of Service (QoS) requirements. Toattain this, first we translate the network adapting it to a weighted graph(unicast) or and-or graph (multicast), where the weight on a connectorcorresponds to the multidimensional cost of sending a packet on the relatednetwork link: each component of the weights vector represents a different QoSmetric value (e.g. bandwidth, cost, delay, packet loss). The second stepconsists in writing this graph as a program in Soft Constraint LogicProgramming (SCLP): the engine of this framework is then able to find the bestpaths/trees by optimizing their costs and solving the constraints imposed onthem (e.g. delay < 40msec), thus finding a solution to QoS routing problems.Moreover, c-semiring structures are a convenient tool to model QoS metrics. Atlast, we provide an implementation of the framework over scale-free networksand we suggest how the performance can be improved.

Unicast and Multicast Qos Routing with Soft Constraint Logic Programming