DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    An optimal single-path routing algorithm in the Datacenter Network DPillar


    Beteiligte:

    Erscheinungsdatum :

    2017-03-01


    Anmerkungen:

    Erikson , A , E. Kiasari , A , Navaridas Palma , J & Stewart , I A 2017 , ' An optimal single-path routing algorithm in the Datacenter Network DPillar ' IEEE Transactions on Parallel and Distributed Systems , vol 28 , no. 3 , pp. 689 - 703 . DOI:10.1109/TPDS.2016.2591011



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch


    Klassifikation :

    DDC:    629



    An Optimal Manhattan Street Network-Routing Algorithm

    Bataineh, S. / Younis, A. | British Library Online Contents | 2003


    AIRBORNE DATACENTER

    DAS TAMOJIT / RANJAN PARITOSH | Europäisches Patentamt | 2023

    Freier Zugriff

    Datacenter rack and removable tray

    HOLYOAKE COLIN IAN / BISHOP BARBARA SHARON / EAMES GRAHAM JON | Europäisches Patentamt | 2020

    Freier Zugriff

    An optimal path selection using lion optimization routing protocol for mobile ad-hoc network

    Awad, Ala Sabree / Alheety, Khalid Shaker / Rashid, Ahmed N. | BASE | 2020

    Freier Zugriff

    Datacenter Application Delivery Virtual Laboratory

    Kajova, Henri | BASE | 2016

    Freier Zugriff