This paper is presenting a discrete-event simulator written in C++ for modeling and simulating Fat tree network-on-chip systems based on MPLS technique. The simulator contains main component that construct butterfly Fat tree structure and other components that generate suitable number of switches and IP nodes (cores). The designed switch consists of input ports, output ports, input/output link controller, multi-buffers, crossbar switch, routing and arbitration components and MPLS unit. The correctness and the efficiency of the MPLS based Fat network-on-chip system is measured against well-known wormhole+ virtual channels technique. The produced results are clearly demonstrated the efficiency of the MPLS technique for future NoC designs. arabic 45 English 189
Azeddien M. Sllame, Nagwa Abobaker Salama(2-2018)

Multi Protocol Label Switching (MPLS) is a core networking technology that operates essentially in between Layers 2 and 3 of the OSI model; for this reason, MPLS has been referred to as operating at Layer 2.5. MPLS can overlay existing technologies such as Asynchronous Transfer Mode (ATM) or Frame Relay, or it can operate in an entirely IP native environment; this can allow users to take advantage of existing Customer Premises Equipment (CPE) while making a move towards converging all network traffic, such as data, video and voice, at a pace that users can accommodate and afford. MPLS provides. its users a number of advantageous features such as traffic engineering, network convergence, failure protection, and the ability to guarantee Quality of Service (QoS) over IP. arabic 2 English 27
Mariam Abojela Msaad, Amer R. Zerek , Wesam M. Tohamei(1-2012)

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)