scholarly journals A Study of Hexagon Star Network with Vertex-Edge-Based Topological Descriptors

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Eshrag A. Refaee ◽  
Ali Ahmad
Keyword(s):  
Network Topology ◽  
Topology Design ◽  
Mesh Network ◽  
Topological Descriptors ◽  
Star Network ◽  
Central Computer ◽  
Wide Range ◽  
Point To Point ◽  
Edge Based ◽  
Entire Network

There are many network topology designs that have emerged to fulfill the growing need for networks to provide a robust platform for a wide range of applications like running businesses and managing emergencies. Amongst the most famous network topology designs are star network, mesh network, hexagonal network, honeycomb network, etc. In a star network, a central computer is linked with various terminals and other computers over point-to-point lines. The other computers and terminals are directly connected to the central computer but not to one another. As such, any failure in the central computer will result in a failure of the entire network and computers in star network will not be able to communicate. The star topology design can be represented by a graph where vertices represent the computer nodes and edges represent the links between the computer nodes. In this paper, we study the vertex-edge-based topological descriptor for a newly designed hexagon star network.

Analysis of Wireless Mesh Network Routing

2014 ◽  
Vol 989-994 ◽  
pp. 4629-4632
Author(s):  
Xiao Long Tan ◽  
Jia Zhou ◽  
Wen Bin Wang
Keyword(s):  
Network Topology ◽  
Routing Protocol ◽  
Wireless Mesh Network ◽  
Network Routing ◽  
Mesh Network ◽  
Mac Layer ◽  
Key Factors ◽  
Wireless Mesh ◽  
Topology Changes ◽  
Communication Links

Since the wireless mesh network topology dynamics and the radio channels instable, the design of wireless mesh network routing protocol become one of the key factors to determine the performance. This paper mainly studied the existing several kinds of typical three-layer mesh network routing protocol (DSDV and AODV), aimed at the defects of three-layer routing limited to the network topology changes, the paper proposed a network model based on two-layer routing. Forwarding the packet, establishing and maintaining the communication links are accomplished on the Mac layer. Simulation tests showed that two-layer routing has a big improvement on the efficiency of packet forwarding, and it effectively reduced the routing overhead and end-to-end delay simultaneously.

scholarly journals Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments

2019 ◽  
Vol 3 ◽  
pp. 3-7
Author(s):  
Krzysztof Stachowiak ◽  
Piotr Zwierzykowski
Keyword(s):  
Quality Of Service ◽  
Computational Complexity ◽  
Optimization Methods ◽  
The Other ◽  
Ongoing Research ◽  
Mathematical Problems ◽  
Point To Point ◽  
Difficult Challenge ◽  
Entire Network

The multicast quality of service-enabled routing is a computationally challenging task. Despite ongoing research efforts, the associated mathematical problems are still considered to be NP-hard. In certain applications, computational complexity of finding the optimal connection between a set of network devices may be a particularly difficult challenge. For example, connecting a small group of participants of a teleconference is not much more complex than setting up a set of mutual point-to-point connections. On the other hand, satisfying the demand for such services as IPTV, with their receivers constituting the majority of the network, requires applying appropriate optimization methods in order to ensure real system execution. In this paper, algorithms solving this class of problems are considered. The notion of multicast saturation is introduced to measure the amount of multicast participants relative to the entire network, and the efficiency of the analyzed algorithms is evaluated for different saturation degrees.

Sign in / Sign up

Export Citation Format

Share Document