This paper describes designing an efficient mesh topology Network-on-Chip system by employing MPLS protocol as an on-chip communication technique. A discrete-event simulator is developed in C++ to show the applicability of MPLS in providing efficient on-chip communication for multicore processing system-on-chip designs. Experimental results are compared with two simulators: wormhole equipped with virtual channels; and MPLS-based fat tree network-on-chip systems. Outstandingly, MPLS as on-chip communication means recorded better results than the wormhole +virtual channels in terms of throughput and packet end-to-end delay (latency).
Azeddien M. Sllame, Hadeel Ben Rajab , Nagwa Salama (1-2021)

This paper presents a genetic based approach to the partitioning and mapping of multicore SoC cores over a NoC system that uses mesh topology. The proposed algorithm performs the partitioning and mapping by reducing communication cost and minimizing power consumption by placing those intercommunicated cores as close as possible together. A program developed in C++ in which the provided specification of the multicore MPSoC system captures all data dependencies before any start of the design process. Experimental results of several multimedia benchmarks demonstrates that the genetic-based approach able to find different satisfied implementations to the problem of partitioning and mapping of MPSoC cores over mesh-based NoC system that satisfies design goals
Azeddien M. Sllame, Walid Mokthar Salh(2-2021)

Even though it is an essential requirement of any computer system, there is not yet a standard method to measure data security, especially when sending information over a network. However, the most common technique used to achieve the three goals of security is encryption. Three security metrics are derived from important issues of network security in this chapter. Each metric demonstrates the level of achievement in preserving one of the security goals. Routing algorithms based on these metrics are implemented to test the proposed solution. Computational effort and blocking probability are used to assess the behavior and the performance of these routing algorithms. Results show that the algorithms are able to find feasible paths between communicating parties and make reasonable savings in the computational effort needed to find an acceptable path. Consequently, higher blocking probabilities are encountered, which is the price to be paid for such savings. arabic 3 English 22
Ibrahim Almerhag(3-2014)