Novel Metric for Load Balance and Congestion Reducing in Network on-Chip

The Network-on-Chip (NoC) is an alternative pattern that is considered as an emerging technology for distributed embedded systems. The traditional use of multi-cores in computing increase the calculation performance; but affect the network communication causing congestion on nodes which therefore decrease the global performance of the NoC. To alleviate this problematic phenomenon, several strategies were implemented, to reduce or prevent the occurrence of congestion, such as network status metrics, new routing algorithm, packets injection control, and switching strategies. In this paper, we carried out a study on congestion in a 2D mesh network, through various detailed simulations. Our focus was on the most used congestion metrics in NoC. According to our experiments and performed simulations under different traffic scenarios, we found that these metrics are less representative, less significant and yet they do not give a true overview of reading within the NoC nodes at a given cycle. Our study shows that the use of other complementary information regarding the state of nodes and network traffic flow in the design of a novel metric, can really improve the results. In this paper, we put forward a novel metric that takes into account the overall operating state of a router in the design of adaptive XY routing algorithm, aiming to improve routing decisions and network performance. We compare the throughput, latency, resource utilization, and congestion occurrence of proposed metric to three published metrics on two specific traffic patterns in a varied packets injection rate. Our results indicate that our novel metric-based adaptive XY routing has overcome congestion and significantly improve resource utilization through load balancing; achieving an average improvement rate up to 40 % compared to adaptive XY routing based on the previous congestion metrics

Quality-of-service management in IP networks

Quality of Service (QoS) in Internet Protocol (IF) Networks has been the subject of active research over the past two decades. Integrated Services (IntServ) and Differentiated Services (DiffServ) QoS architectures have emerged as proposed standards for resource allocation in IF Networks. These two QoS architectures support the need for multiple traffic queuing systems to allow for resource partitioning for heterogeneous applications making use of the networks. There have been a number of specifications or proposals for the number of traffic queuing classes (Class of Service (CoS)) that will support integrated services in IF Networks, but none has provided verification in the form of analytical or empirical investigation to prove that its specification or proposal will be optimum. Despite the existence of the two standard QoS architectures and the large volume of research work that has been carried out on IF QoS, its deployment still remains elusive in the Internet. This is not unconnected with the complexities associated with some aspects of the standard QoS architectures. [Continues.

Protocol design and optimization for QoS provisioning in wireless mesh networks

Wireless Mesh Network (WMN) has been recognized as a promising step towards the goal of ubiquitous broadband wireless Internet access. By exploiting the state-of-the-art radio and multi-hop networking technologies, mesh nodes in WMN collaboratively form a stationary wireless communication backbone. Data between clients and the Internet is routed through a series of mesh nodes via one or multiple paths. Such a mesh structure enables WMN to provide clients high-speed Internet access services with a less expensive and easier-to-deployment wireless infrastructure comparing to the wired counterparts. Due to the unique characteristics of WMN, existing protocols and schemes designed for other wellstudied wireless networks, such as Wi-Fi and Mobile Ad-hoc Network (MANET), are not suitable for WMN and hence cannot be applied to WMN directly. Therefore, novel protocols specifically designed and optimized forWMNare highly desired to fully exploit the mesh architecture. The goal is to provide high-level Quality-of-Service (QoS) to WMN clients to enable a rich portfolio of wireless and mobile applications and scenarios. This dissertation investigates the following important issues related to QoS provisioning in WMN: high throughput routing between WMN clients and the Internet, fairness provisioning among WMN clients and network-level capacity optimization. We propose innovative solutions to address these issues and improve the performance, scalability and reliability of WMN. In addition, we develop CyMesh, a multi-radio multi-channel (MRMC) wireless mesh network testbed, to evaluate the capacity and performance of WMN in real world environments. Extensive simulation (using the QualNet simulator) and experimental (over the CyMesh testbed) results demonstrate the effectiveness of the designed protocols. In particular, we learn that the system capacity of WMN can be improved significantly by exploiting the MRMC network architecture and the antenna directionality of radios equipped on mesh nodes, and our proposed fulfillment based fairness is a reasonable notion for fair service provisioning among WMN clients. Moreover, we report the encountered problems, key observations and learned lessons during the design and deployment of CyMesh, which may serve as a valuable resource for future MRMC WMN implementations

Scalable Scheduling for Industrial Time-Sensitive Networking: A Hyper-flow Graph Based Scheme

Industrial Time-Sensitive Networking (TSN) provides deterministic mechanisms for real-time and reliable flow transmission. Increasing attention has been paid to efficient scheduling for time-sensitive flows with stringent requirements such as ultra-low latency and jitter. In TSN, the fine-grained traffic shaping protocol, cyclic queuing and forwarding (CQF), eliminates uncertain delay and frame loss by cyclic traffic forwarding and queuing. However, it inevitably causes high scheduling complexity. Moreover, complexity is quite sensitive to flow attributes and network scale. The problem stems in part from the lack of an attribute mining mechanism in existing frame-based scheduling. For time-critical industrial networks with large-scale complex flows, a so-called hyper-flow graph based scheduling scheme is proposed to improve the scheduling scalability in terms of schedulability, scheduling efficiency and latency & jitter. The hyper-flow graph is built by aggregating similar flow sets as hyper-flow nodes and designing a hierarchical scheduling framework. The flow attribute-sensitive scheduling information is embedded into the condensed maximal cliques, and reverse maps them precisely to congestion flow portions for re-scheduling. Its parallel scheduling reduces network scale induced complexity. Further, this scheme is designed in its entirety as a comprehensive scheduling algorithm GH^2. It improves the three criteria of scalability along a Pareto front. Extensive simulation studies demonstrate its superiority. Notably, GH^2 is verified its scheduling stability with a runtime of less than 100 ms for 1000 flows and near 1/430 of the SOTA FITS method for 2000 flows