Loading...
Search for: router
0.006 seconds
Total 122 records

    SPONGE: a scalable pivot-based on/off gating engine for reducing static power in NoC routers

    , Article Proceedings of the International Symposium on Low Power Electronics and Design23 July 2018 ; 23-25 July , 2018 ; 15334678 (ISSN) ; 9781450357043 (ISBN) Farrokhbakht, H ; Mardani Kamali, H ; Jerger, N. E ; Hessabi, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    Due to high aggregate idle time of Networks-on-Chip (NoCs) routers in practical applications, power-gating techniques have been proposed to combat the ever-increasing ratio of static power. Nevertheless, the sporadic packet arrivals compromise the effectiveness of power-gating by incurring significant latency and energy overhead. In this paper, we propose a Scalable Pivot-based On/Off Gating Engine (SPONGE) which efficiently manages power-gating decisions and routing mechanism by adaptively selecting a small set of powered-on columns of routers and keeping the others in power-gated state. To this end, a router architecture augmented with a novel routing algorithm is proposed in which a... 

    Router Backdoor Insertion and Assessment

    , M.Sc. Thesis Sharif University of Technology Kazemi Khaneghah, Soheil (Author) ; Jahangir, Amir Hossein (Supervisor)
    Abstract
    With the expansion of network equipment including routers and wireless modems, these equipment have become more susceptible to backdoors and hacker attacks. One way to cause troubles to these systems is through backdoor insertion. Recently, several attacks via backdoor insertions have been reported by some of the major router companies. In this project, a complete description of routers, ways of intrusion to routers and how to change settings in routers in order to measure traffic intensity are explained. In this thesis we manually setup a backdoor in a router in order to observe its effects on local networks. Furthermore, we purposely attack a router in order to find the followings: 1. Ways... 

    Energy-optimized on-chip networks using reconfigurable shortcut paths

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 24 February 2011 through 25 February 2011 ; Volume 6566 LNCS , February , 2011 , Pages 231-242 ; 03029743 (ISSN) ; 9783642191367 (ISBN) Teimouri, N ; Modarressi, M ; Tavakkol, A ; Sarbazi Azad, H ; Sharif University of Technology
    2011
    Abstract
    Topology is an important network attribute that greatly affects the power, performance, cost, and design time/effort of NoCs. In this paper, we propose a novel NoC architecture that can exploit the benefits of both application-specific and regular NoC topologies. To this end, a subset of NoC links bypass the router pipeline stages and directly connect remotely located nodes. This results in an NoC which holds both fixed connections between adjacent nodes and long connections virtually connecting non-adjacent nodes. These shortcut paths are constructed at run-time by employing a simple and fast mechanism composed of two processes: on-chip traffic monitoring and path reconfiguration. The... 

    Scalable architecture for wavelength-switched optical NoC with multicasting capability

    , Article Proceedings - 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2010, 1 September 2010 through 3 September 2010, Lille ; 2010 , Pages 398-403 ; 9780769541716 (ISBN) Koohi, S ; Shafaei, A ; Hessabi, S ; Sharif University of Technology
    2010
    Abstract
    This paper proposes a novel all-optical router as a building block for a scalable wavelength-switched optical NoC. The proposed optical router, named as AOR, performs passive routing of optical data streams based on their wavelengths. Utilizing wavelength routing method, AOR eliminates the need for electrical resource reservation and the corresponding latency and area overheads. Taking advantage of Wavelength Division Multiplexing (WDM) technique, the proposed architecture is capable of data multicasting, concurrent with unicast data transmission, with high bandwidth and low power dissipation, without imposing noticeable area and latency overheads. Comparing AOR against previously proposed... 

    Analytical performance modelling of partially adaptive routing in wormhole hypercubes

    , Article 20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006, 25 April 2006 through 29 April 2006 ; Volume 2006 , 2006 ; 1424400546 (ISBN); 9781424400546 (ISBN) Patooghy, A ; Sarbazi Azad, H ; Sharif University of Technology
    IEEE Computer Society  2006
    Abstract
    Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work dealing with partially adaptive routing algorithms. This paper proposes an accurate analytical model to predict message latency in wormhole-routed hypercube based networks using the partially adaptive routing algorithm. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy for various network sizes and under different operating conditions. © 2006 IEEE  

    Performance evaluation of fully adaptive routing under different workloads and constant node buffer size

    , Article 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005, Fukuoka, 20 July 2005 through 22 July 2005 ; Volume 2 , 2005 , Pages 510-514 ; 15219097 (ISSN); 0769522815 (ISBN) Rezazad, M ; Sarbazi Azad, H ; Ma J ; Yang L. T ; Sharif University of Technology
    2005
    Abstract
    In this paper, the performance of some popular direct interconnection networks, namely the mesh, torus and hypercube, are studied with adaptive wormhole routing for different traffic patterns. We investigate the effect of the number of virtual channels and depth of their buffers on the performance of such strictly orthogonal topologies under uniform, hot-spot and matrix-transpose traffic patterns for generated messages, while the total buffer size associated to each physical channel is kept constant. In addition we analyze the effect of escape channel buffer length on the performance of a fully adaptive routing algorithm. It is shown that the optimal number of virtual channels and buffer... 

    Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks

    , Article IEE Proceedings: Computers and Digital Techniques ; Volume 150, Issue 2 , 2003 , Pages 97-106 ; 13502387 (ISSN) Khonsari, A ; Shahrabi, A ; Ould Khaoua, M ; Sarbazi Azad, H ; Sharif University of Technology
    2003
    Abstract
    Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most... 

    Intrusion Detection in Data Networks Using Header Space Analysis

    , M.Sc. Thesis Sharif University of Technology Mohammadi, Amir Ahmad (Author) ; Pakravan, Mohammad Reza (Supervisor) ; Kazemian, Payman (Supervisor)
    Abstract
    Software Defined Networking (SDN) provides a logically centralized view of the state of the network, and as a result opens up new ways to manage and monitor networks. In this dissertation a novel approach to network intrusion detection in SDNs is introduced that takes advantage of these attributes. This approach can detect compromised routers that produce faulty messages, copy or steal traffic or maliciously drop certain types of packets. To identify these attacks and the affected switches, we correlate the forwarding state of network---i.e. installed forwarding rules---with the forwarding status of packets---i.e. the actual route packets take in the network and detect anomaly in routes.... 

    A novel test strategy and fault-tolerant routing algorithm for NoC routers

    , Article Proceedings - 17th CSI International Symposium on Computer Architecture and Digital Systems ; 2013 , Pages 133-136 ; 9781479905621 (ISBN) Alamian, S. S ; Fallahzadeh, R ; Hessabi, S ; Alirezaie, J ; Computer Society of Iran; IPM ; Sharif University of Technology
    IEEE Computer Society  2013
    Abstract
    In this paper, we present a novel routing algorithm in order to avoid deadlock and packet dropping. In our proposed algorithm the network-on-chip (NoC) is capable of tolerating faults in presence of control faults in combinational parts of routers. In addition, by modifying the functionality of the router, the router is enabled to test its own, as well as the preceding router's functionality based on the routing algorithm, destination address and previous router's situation. Each router recognizes the faulty neighbor and announces it to successive routers. In this scheme no extra packets will be generated. We analyze the effects of our method on latency, power consumption and drop rate. Our... 

    Fully contention-free optical NoC based on wavelenght routing

    , Article CADS 2012 - 16th CSI International Symposium on Computer Architecture and Digital Systems ; 2012 , Pages 81-86 ; 9781467314824 (ISBN) Khouzani, H. A ; Koohi, S ; Hessabi, S ; Sharif University of Technology
    2012
    Abstract
    This paper proposes a new optical network-on-chip which is scalable, low-power and high-performance. We design a centralized all-optical router which takes advantage of wavelength based structures. Our design achieves fully contention-free operation by utilizing path-based algorithms. By merging primary photonic switches and utilizing WDM technique, we mitigated the number of basic switching elements and thus reduced the consumed power down to 47.37% in comparison with the most prominent structure introduced for wavelength routing; i.e., the λ-Router. We obtained this superiority while maintaining the performance as high as the previous structures, which yields in energy savings. Moreover,... 

    QuT: A low-power optical network-on-chip

    , Article Proceedings - 2014 8th IEEE/ACM International Symposium on Networks-on-Chip, NoCS 2014, 17 September 2014 through 19 September 2014 ; 2015 , Pages 80-87 ; 9781479953479 (ISBN) Khadem Hamedani, P ; Enright Jerger, N ; Hessabi, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    To enable the adoption of optical Networks-on-Chip (NoCs) and allow them to scale to large systems, they must be designed to consume less power and energy. Therefore, optical NoCs must use a small number of wavelengths, avoid excessive insertion loss and reduce the number of microring resonators. We propose the Quartern Topology (QuT), a novel low-power all-optical NoC. We also propose a deterministic wavelength routing algorithm based on Wavelength Division Multiplexing that allows us to reduce the number of wavelengths and microring resonators in optical routers. The key advantages of QuT network are simplicity and lower power consumption. We compare QuT against three alternative... 

    An efficient dynamically reconfigurable on-chip network architecture

    , Article Proceedings - Design Automation Conference, 13 June 2010 through 18 June 2010 ; June , 2010 , Pages 166-169 ; 0738100X (ISSN) ; 9781450300025 (ISBN) Modarressi, M ; Sarbazi Azad, H ; Tavakkol, A ; Sharif University of Technology
    Abstract
    In this paper, we present a reconfigurable architecture for NoCs on which arbitrary application-specific topologies can be implemented. The proposed NoC can dynamically tailor its topology to the traffic pattern of different applications at run-time. The run-time topology construction mechanism involves monitoring the network traffic and changing the inter-node connections in order to reduce the number of intermediate routers between the source and destination nodes of heavy communication flows. This mechanism should also preserve the NoC connectivity. In this paper, we first introduce the proposed reconfigurable topology and then address the problem of run-time topology reconfiguration.... 

    A packet-based photonic label switching router for a multirate all-optical CDMA-based GMPLS switch

    , Article IEEE Journal on Selected Topics in Quantum Electronics ; Volume 13, Issue 5 , 2007 , Pages 1522-1530 ; 1077260X (ISSN) Farnoud, F ; Ibrahirni, M ; Salehi, J. A ; Sharif University of Technology
    2007
    Abstract
    A novel packet-based photonic label switching router for a multirate all-optical switch using generalized multiprotocol label switching is proposed. The idea is based on using optical codedivision multiple access (OCDMA) as multiplexing technique and treating OCDMA codes as labels. The system can coexist with current wavelength division multiplexing systems on the same infrastructure. The concept of switch fabric is introduced. Label processing and label swapping functionalities of the switch are discussed. In-depth analyses are made for spectrally phase-encoded OCDMA (SPE-OCDMA) due to its capabilities of supporting high data rates, large code cardinality, and its secure transmission.... 

    SMPCS: Sub-optimal model predictive control scheduler

    , Article 6th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking, NEW2AN 2006, St. Petersburg, 29 May 2005 through 2 June 2005 ; Volume 4003 LNCS , 2006 , Pages 554-565 ; 03029743 (ISSN); 3540344292 (ISBN); 9783540344292 (ISBN) Mahramian, M ; Taheri, H ; Haeri, M ; Sharif University of Technology
    Springer Verlag  2006
    Abstract
    An approximated quadratic programming algorithm is proposed to determine a model predictive controller, which is applied to the scheduling problem. We name the algorithm Sub-optimal Model Predictive Control Scheduler (SMPCS). The SMPCS prepares a platform to guarantee end to end proportional delay in DiffServ architecture. This paper investigates the complication of SMPCS and its implementation problems in high speed routers. In order to efficiently implement the controller we admit sub-optimal results against reduction in the complexity of the optimizer. Simulation results show that the proposed approximation improves speed of the controller considerably. © Springer-Verlag Berlin Heidelberg... 

    NetworkTraffic Estimation for Adaptive Video Streaming

    , M.Sc. Thesis Sharif University of Technology Manafi, Mohammad Saeed (Author) ; Ghanbari, Mohammad (Supervisor)
    Abstract
    In recent years, advances in computer technology and widespread use of computers have alleviated the wide usage of network-based services in contrast to traditional services like radio and television. These facilities made it possible to integrate various type of services with adding new features whenever is necessary.
    Video has specific characteristics that its transport over the network imposes some challenges to service providers. In the literature several solutions have been offered for solving the problems of network-based video services. A set of these solutions use routers and other network assisted devices to gather information for better transportation. These router-assisted... 

    Performance Optimization of Cu Wires for Network-on-chip Based Many-core Architectures

    , M.Sc. Thesis Sharif University of Technology Radfar, Farzad (Author) ; Sarvari, Reza (Supervisor)
    Abstract
    The exponential increase in power density within a chip due to higher frequency of operation in recent years (Moor's law) is a major limiting factor for designers. Increasing the number of parallel cores instead of increasing the frequency of operation is a possible solution. The design of connections within the cores can be followed by the old process but the global interconnectsbetween the cores instead of point to point can be replaced byNetwork-on-Chip (NoC). In this thesis, The dimensions of global interconnects in many-core chips are optimized for maximum bandwidth density and minimum delay taking into account network-on-chip router latency and size effects of coppe. The optimal... 

    A deadlock free shortest path routing algorithm for WK-recursive meshes

    , Article 9th International Conference on Distributed Computing and Networking, ICDCN 2008, Kolkata, 5 January 2008 through 8 January 2008 ; Volume 4904 LNCS , 2008 , Pages 280-285 ; 03029743 (ISSN); 3540774432 (ISBN); 9783540774433 (ISBN) Rezazad, M ; Hoseiny Farahabady, M ; Sarbazi Azad, H ; Sharif University of Technology
    Springer Verlag  2008
    Abstract
    In this paper, we investigate an efficient deadlock-free shortest path routing algorithm for WK-recursive mesh networks which has been shown that possess several advantages like suitable to be manufactured by VLSI technology and easy to be expanded. It will be shown that the proposed algorithm requires O(√n) routing steps (where N is the network size) to route the entire network by exploiting either the self-routing or second order routing scheme. © Springer-Verlag Berlin Heidelberg 2008  

    Reducing power consumption in NoC design with no effect on performance and reliability

    , Article 14th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2007, Marrakech, 11 December 2007 through 14 December 2007 ; 2007 , Pages 886-889 ; 1424413788 (ISBN); 9781424413782 (ISBN) Patooghy, A ; Fazeli, M ; Miremadi, S. G ; Sharif University of Technology
    2007
    Abstract
    High reliability, low power consumption and high performance are key objectives in the design of NoCs. These three design objectives should be considered simultaneously in order to have an optimal design. This paper proposes a method to reduce power consumption of an application specific NoC. This is done in two steps: 1) Extra virtual channels are used in the router architecture to increase the performance in an application specific NoC, and 2) The amount of the performance gain is then set to the initial point using frequency scaling technique, hence reducing the power consumption, without corruption of reliability. The simulation results show that the method can reduce the power... 

    Evaluation of traffic pattern effect on power consumption in mesh and torus network-on-chips

    , Article 2007 International Symposium on Integrated Circuits, ISIC, Singapore, 26 September 2007 through 28 September 2007 ; 2007 , Pages 512-515 ; 1424407974 (ISBN); 9781424407972 (ISBN) Koohi, S ; Mirza Aghatabar, M ; Hessabi, S ; Sharif University of Technology
    2007
    Abstract
    Technology scaling increases clock rates and die sizes; therefore, power dissipation is predicted to soon become the key limiting factor on the performance of single-chip designs. NoC as an efficient and scalable on-chip communication architecture for SoC architectures, enables integration of a large number of computational and storage blocks on a single chip. Since different applications impose different traffic models to the network, in this paper we will analyze the power and energy consumption of the most popular traffic models, i.e., Uniform, Local, HotSpot and First Matrix Transpose, in two famous and well designed topologies, mesh and torus. We will also compare these topologies with... 

    The effect of routing-update time on network's performability

    , Article 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; 2007 , Pages 655-658 ; 1424410312 (ISBN); 9781424410316 (ISBN) Shaad Zolpirani, M ; Bidmeshki, M. M ; Miremadi, S. G ; Sharif University of Technology
    2007
    Abstract
    By occurring failures in computer networks, routing protocols are triggered to update routing and forwarding tables. Because of invalid tables during update-time, transient loop may occur and packet-drop rate and end-to-end delay increase which means that the quality of service decreases. This paper studies the effect of routing-tables update-time on networks' performability, i.e. the ability of network to deliver services at predefined level. A sample network is studied and the simulation results show that faster updates of routing table, improve network's performability in the presence of failures. Since it may not worth or even be practical to accelerate all routers in the network, this...