Scaling of Most-Likely Traffic Patterns of Hose- and Cost-Constrained Ring and Mesh Networks

2006 ◽  
Author(s):  
S.K. Korotky ◽  
K.N. Oikonomou
Keyword(s):  
Mesh Networks ◽  
Traffic Patterns

NON-UNIFORM "FAT-MESHES" FOR CHIP MULTIPROCESSORS

2009 ◽  
Vol 19 (04) ◽  
pp. 595-617 ◽  
Author(s):  
YU ZHANG ◽  
ALEX K. JONES
Keyword(s):  
Hot Spots ◽  
Chip Multiprocessors ◽  
Mesh Networks ◽  
Heavy Traffic ◽  
Routing Algorithms ◽  
Traffic Patterns ◽  
Simulation Results ◽  
Mesh Models ◽  
Splash 2

This paper studies the traffic hot spots of mesh networks in the context of chip multiprocessors. To mitigate these effects, this paper describes a non-uniform fat-mesh extension to mesh networks, which are popular for chip multiprocessors. The fat-mesh is inspired by the fat-tree and dedicates additional links for connections with heavy traffic (e.g. near the center) with fewer links for lighter traffic (e.g. near the periphery). Two fat-mesh schemes are studied based on the traffic requirements of chip multiprocessors using dimensional ordered XY routing and a randomized XY-YX routing algorithms, respectively. Analytical fat-mesh models are constructed by theoretically presenting the expressions for the traffic requirements of personalized all-to-all traffic for both the raw message numbers and their normalized equivalents. We demonstrate how traffic scales for a traditional mesh compared to a non-uniform fat mesh. Simulation results demonstrate that using same number of physical links the non-uniform fat-mesh can achieve better performance than a uniform fat-mesh mesh using both synthetic traffic patterns and splash-2 benchmark traces.

ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS

2007 ◽  
Vol 08 (04) ◽  
pp. 407-426 ◽  
Author(s):  
LIANG MA ◽  
MIESO K. DENKO
Keyword(s):  
Load Balancing ◽  
Wireless Mesh Networks ◽  
Mesh Networks ◽  
Transmission Time ◽  
Delivery Ratio ◽  
Traffic Patterns ◽  
Routing Metric ◽  
Traffic Splitting ◽  
Wireless Mesh ◽  
Entire Network

Wireless mesh networks (WMNs) have been drawing significant attention in recent years due to their flexibility in providing extensive wireless backbone. WMNs typically consist of mesh routers and mesh clients with each node operating not only as a host but also as a router. Due to the traffic patterns in WMNs, load-balancing becomes an important issue and may degrade the performance of the entire network. This paper proposes a routing metric known as Weighted Cumulative Expected Transmission Time with Load-Balancing (WCETT-LB) for wireless mesh networks. WCETTT-LB enhances the basic Weighted Cumulative Expected Transmission Time (WCETT) by incorporating load-balancing into the routing metric. Unlike existing schemes, WCETT-LB implements load-balancing at mesh routers. WCETT-LB provides a congestion-aware routing and traffic splitting mechanism to achieve global load-balancing in the network. By conducting an extensive simulation experiments, the result shows that WCETT-LB outperforms the existing routing metrics in load-balancing in terms of achieving high packet delivery ratio, low average end-to-end delay and low average congestion level in wireless mesh networks. The qualitative and quantitative analysis also show the significance of the proposed scheme.

Proxy-Based IPv6 Neighbor Discovery Scheme for Wireless LAN Based Mesh Networks

2010 ◽  
Vol E93-B (5) ◽  
pp. 1151-1154
Author(s):  
Jihoon LEE ◽  
Seungwoo JEON ◽  
Jaehoon KIM
Keyword(s):  
Wireless Lan ◽  
Mesh Networks ◽  
Neighbor Discovery
Sign in / Sign up

Export Citation Format

Share Document