A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of analysis and experimentation in order that they might achieve their full potential as data centre networks. We propose a family of novel routing algorithms on two well-known data centre networks of this type, (Generalized) DCell and FiConn, using techniques that can be applied more generally to the class of networks wearXiv:1509.01747v1 fatcat:kpp6dtt4tjdexisrhc5e63am74
more »... all completely connected recursively-defined networks. In doing so, we develop a classification of all possible routes from server-node to server-node on these networks, called general routes of order t, and find that for certain topologies of interest, our routing algorithms efficiently produce paths that are up to 16 than the best previously known algorithms, and are comparable to shortest paths. In addition to finding shorter paths, we show evidence that our algorithms also have good load-balancing properties.
Corresponding author's email: firstname.lastname@example.org. ... Kiasari et al.  extended the proposed queueing model of Kiasari et al. [2008c] to support arbitrary topology, buffer size, and oblivious routing algorithm. ...doi:10.1145/2480741.2480755 fatcat:wwlsqn7arng7hcgu4lxwbpdf3u
In this paper, we present a system-level Congestion-Aware Routing (CAR) framework for designing minimal deterministic routing algorithms. CAR exploits the peculiarities of the application workload to spread the load evenly across the network. To this end, we first formulate an optimization problem of minimizing the level of congestion in the network and then use the simulated annealing heuristic to solve this problem. The proposed framework assures deadlock-free routing, even in the networksdoi:10.1145/1921249.1921261 dblp:conf/micro/KiasariJL10 fatcat:fbabgxyhofc2vmtg2zbzesbaue
more »... hout virtual channels. Experiments with both synthetic and realistic workloads show the effectiveness of the CAR framework. Results show that maximum sustainable throughput of the network is improved by up to 205% for different applications and architectures.
The authors are with the Electronic Systems Department, School of Information and Communication Technology, Royal Institute of Technology (KTH), SE-16440 Kista, Stockholm, Sweden (e-mail: email@example.com ... Kiasari is a member of the IEEE Computer Society. From 1989 to 2000, he was an Engineer in the area of electronic and embedded systems. ...doi:10.1109/tvlsi.2011.2178620 fatcat:fi62vugyibbgdi6cwldbxpey7q
Lecture Notes in Computer Science
The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consultdoi:10.1007/978-3-319-26626-8_16 fatcat:5gihumpisjgxbfcsnj4bh32oyy
more »... full DRO policy for further details. Abstract. DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry property of DPillar. 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 log(n)), where k parameterizes the dimension of DPillar and n the number of ports in its switches. 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. A secondary and important effect of our work is that it emphasises that data centre networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.
Queueing Theory (Abbas Eslami Kiasari) Queueing theory is a branch of probability theory which is concerned with the mathematical modeling and analysis of systems that provide service to stochastic demands ...doi:10.1145/2380403.2380442 dblp:conf/cases/KiasariJBBL12 fatcat:kc2ehewdzncahibi735ybenbx4
Eslami Kiasari, Axel Jantsch and Zhonghai Lu. ... Symposium on Networks-on-Chip 6 2014-09-17 Analysis approach Traffic model Server model Mathematical tool Metric of interest • Like a typical theoretical approach, we need 2014-09-17 Abbas ...doi:10.1109/nocs.2014.7008763 dblp:conf/nocs/LuYJ14 fatcat:ndt3fjywingvhowxetodi4sone
ABT n k servers DCellRouting DCellRouting 3 3 24,492 10.18 5475.43 4 3 176,820 11.29 33582.97 12 2 24,492 6.34 6968.73 18 2 117,306 6.56 31937.10 Abbas Eslami Kiasari received ... Material for "An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar" Alejandro Erickson, Abbas Kiasari, Javier Navaridas and Iain A. Stewart Lemma 1. ...doi:10.1109/tpds.2016.2591011 fatcat:ljkrjinwizfjjk6f6t5ztlhhim