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

In dynamic and wide networks, such as Metropolitan Mesh Network (MMN), routing becomes very complex because a packet can be blocked before it reaches its destination. In addition, users can also log in or log out from network topology. Therefore, a good routing algorithm, which is able to reduce time in network update process or when there is an error in the network, are required. Routing problems can be represented as the shortest path problem to facilitate completion. In this paper, a routing algorithm optimization using Adaptive Mutation Genetic Algorithm (AMGA) on MMN is presented by determining a probability of 0.5782 at the beginning, with crossover probability of 0.000847, to reduce or avoid premature convergence.

Optimasi Routing pada Metropolitan Mesh Network Menggunakan Adaptive Mutation Genetic Algorithm