The Experts below are selected from a list of 63606 Experts worldwide ranked by ideXlab platform
Khaled A Arisha - One of the best experts on this subject based on the ideXlab platform.
-
a constrained shortest path energy aware Routing algorithm for wireless sensor networks
Wireless Communications and Networking Conference, 2002Co-Authors: Moustafa Youssef, Mohamed Younis, Khaled A ArishaAbstract:While traditional Routing protocols try to minimize the end-to-end delay or maximize the throughput, most energy-aware Routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. We introduce a new energy-aware Routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional Routing and energy-aware Routing Algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional Routing Algorithms and the energy-aware Routing Algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.
Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.
-
impairment aware Routing in wavelength routed optical networks
The 17th Annual Meeting of the IEEELasers and Electro-Optics Society 2004. LEOS 2004., 2004Co-Authors: Biswanath Mukherjee, Y HuangAbstract:New network-layer technologies such as impairment-aware Routing Algorithms are emerging to facilitate the design and operation of next-generation optical networks. Motivation, definition, network model, and approaches for impairment-aware Routing Algorithms are examined for wavelength-routed networks.
-
Multicast Routing Algorithms and protocols: a tutorial
IEEE Network, 2000Co-Authors: L.h. Sahasrabuddhe, Biswanath MukherjeeAbstract:Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. There has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast Routing Algorithms and their relationship with multicast Routing protocols for packet-switched-wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject).
Moustafa Youssef - One of the best experts on this subject based on the ideXlab platform.
-
a constrained shortest path energy aware Routing algorithm for wireless sensor networks
Wireless Communications and Networking Conference, 2002Co-Authors: Moustafa Youssef, Mohamed Younis, Khaled A ArishaAbstract:While traditional Routing protocols try to minimize the end-to-end delay or maximize the throughput, most energy-aware Routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. We introduce a new energy-aware Routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional Routing and energy-aware Routing Algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional Routing Algorithms and the energy-aware Routing Algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.
Luiza De Macedo Mourelle - One of the best experts on this subject based on the ideXlab platform.
-
congestion aware ant colony based Routing Algorithms for efficient application execution on network on chip platform
Expert Systems With Applications, 2013Co-Authors: Nadia Nedjah, Luneque Silva, Luiza De Macedo MourelleAbstract:Networks-on-Chip (NoC) is an interesting option in design of communication infrastructures for embedded systems. It provides a scalable structure and balanced communication between the cores. Parallel applications that take advantage of the NoC architectures, are usually are communication-intensive. Thus, a big deal of data packets is transmitted simultaneously through the network. In order to avoid congestion delays that deteriorate the execution time of the implemented applications, an efficient Routing strategy must be thought of carefully. In this paper, the ant colony optimization paradigm is explored to find and optimize routes in a mesh-based NoC. The proposed Routing Algorithms are simple yet efficient. The Routing optimization is driven by the minimization of total latency during packets transmission between the tasks that compose the application. The presented performance evaluation is threefold: first, the impact of well-known synthetic traffic patterns is assessed; second, randomly generated applications are mapped into the NoC infrastructure and some synthetic communication traffics, that follow known patterns, are used to simulate real situations; third, sixteen real-world applications of the E3S and one specific application for digital image processing are mapped and their execution time evaluated. In both cases, the obtained results are compared to those obtained with known general purpose Algorithms for deadlock free Routing. The comparison avers the effectiveness and superiority of the ant colony inspired Routing.
Maurizio Palesi - One of the best experts on this subject based on the ideXlab platform.
-
hira a methodology for deadlock free Routing in hierarchical networks on chip
Networks-on-Chips, 2009Co-Authors: Rickard Holsmark, Maurizio Palesi, Shashi Kumar, A MejiaAbstract:Complexity of designing large and complex NoCs can be reduced/managed by using the concept of hierarchical networks. In this paper, we propose a methodology for design of deadlock free Routing Algorithms for hierarchical networks, by combining Routing Algorithms of component subnets. Specifically, our methodology ensures reachability and deadlock freedom for the complete network if Routing Algorithms for subnets are deadlock free. We evaluate and compare the performance of hierarchical Routing Algorithms designed using our methodology with Routing Algorithms for corresponding flat networks. We show that hierarchical Routing, combining best Routing algorithm for each subnet, has a potential for providing better performance than using any single Routing algorithm. This is observed for both synthetic as well as traffic from real applications. We also demonstrate, by measuring jitter in throughput, that hierarchical Routing Algorithms leads to smoother flow of network traffic. A router architecture that supports scalable table-based Routing is briefly outlined.
-
design of bandwidth aware and congestion avoiding efficient Routing Algorithms for networks on chip platforms
Networks-on-Chips, 2008Co-Authors: Maurizio Palesi, Rickard Holsmark, Shashi Kumar, G Longo, S Signorino, Vincenzo CataniaAbstract:In this paper we demonstrate that it is possible to design highly efficient application specific Routing Algorithms which distribute traffic more uniformly by using information regarding applications communication behavior (communication topology and communication bandwidth). We use off-line analysis to estimate expected load on various links in the network. The result of this analysis is used along with the available Routing adaptivity in each router to distribute less traffic to links and paths which are expected to be congested. The methodology for Application Specific Routing Algorithms (APSRA) is extended to incorporate these features to design highly adaptive deadlock free Routing Algorithms which also distribute traffic more uniformly and reduce network congestion. We show that the number of congested links (links exceeding threshold bandwidth) is reduced by up to 100% with this extension. Significant reduction in average delay is also obtained for both synthetic (up to 25%) as well as a real application (12.5%) communication traffic with this extension to APSRA. We discuss architectural implications and area overhead of our approach on the design of a table based NoC router.
-
deadlock free Routing Algorithms for irregular mesh topology noc systems with rectangular regions
Journal of Systems Architecture, 2008Co-Authors: Rickard Holsmark, Maurizio Palesi, Shashi KumarAbstract:The simplicity of regular mesh topology Network on Chip (NoC) architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free Routing algorithm. Available adaptive Routing Algorithms developed for regular mesh topology cannot ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free Routing Algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific Routing Algorithms for communication networks. The application specific Routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific Routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers.
-
a methodology for design of application specific deadlock free Routing Algorithms for noc systems
International Conference on Hardware Software Codesign and System Synthesis, 2006Co-Authors: Maurizio Palesi, Rickard Holsmark, Shashi Kumar, Vincenzo CataniaAbstract:In this paper, we present a methodology to specialize the Routing algorithm in Routing table based NoC routers. It tries to maximize the communication performance while ensuring deadlock free Routing for an application. We demonstrate through analysis that Routing Algorithms generated by our methodology have higher adaptiveness as compared to turn-model based deadlock free Routing Algorithms for a mesh topology NoC architecture. Performance evaluation is carried out by using a flit-accurate simulator on traffic scenarios generated by both synthetic and real applications. The Routing Algorithms generated by the proposed methodology achieve an improvement in delay close to 50% and 30% over deterministic XY Routing algorithm and adaptive Odd-Even Routing algorithm respectively.
-
deadlock free Routing Algorithms for mesh topology noc systems with regions
Digital Systems Design, 2006Co-Authors: Rickard Holsmark, Maurizio Palesi, Shashi KumarAbstract:Region concept helps to accommodate cores larger than the tile size in mesh topology NoC architectures. In addition, it offers many new opportunities for NoC design, as well as provides new design issues and challenges. The most important among these is the design of a deadlock free Routing algorithm. In this paper, we present and compare two Routing Algorithms for mesh topology NoC with regions. The first algorithm is borrowed from the area of fault tolerant networks and is adapted for the NoC context. We compare this with an algorithm designed using a methodology for design of application specific Routing Algorithms for communication networks. Our study shows that the application specific Routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases.
