Sublinear bounds for randomized leader election (2015)
Journal Article
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). Sublinear bounds for randomized leader election. Theoretical Computer Science, 561, 134 - 143. https://doi.org/10.1016/j.tcs.2014.02.009

On the Complexity of Universal Leader Election (2015)
Journal Article
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). On the Complexity of Universal Leader Election. Journal of the ACM, 62(1), 7:1-7:27

Providing healthcare services on-the-fly using multi-player cooperation game theory in Internet of Vehicles (IoV) environment (2015)
Journal Article
Kumar, N., Kaur, K., Jindal, A., & Rodrigues, J. J. (2015). Providing healthcare services on-the-fly using multi-player cooperation game theory in Internet of Vehicles (IoV) environment. Digital Communications and Networks, 1(3), https://doi.org/10.1016/j.dcan.2015.05.001

A Novel Resource Reservation Scheme for Mobile PHEVs in V2G Environment Using Game Theoretical Approach (2015)
Journal Article
Kaur, K., Dua, A., Jindal, A., Kumar, N., Singh, M., & Vinel, A. (2015). A Novel Resource Reservation Scheme for Mobile PHEVs in V2G Environment Using Game Theoretical Approach. IEEE Transactions on Vehicular Technology, 64(12), https://doi.org/10.1109/tvt.2015.2482462

Routing packets on DPillar data centre networks (2015)
Conference Proceeding
Kiasari, A., Navaridas, J., & Stewart, I. (2015). Routing packets on DPillar data centre networks. In G. Wang, A. Zomaya, G. Perez, & K. Li (Eds.), . https://doi.org/10.1007/978-3-319-27140-8_23

A novel smart meter for better control over devices including electric vehicles and to enable smart use of power in smart home (2015)
Conference Proceeding
Arora, N. N., Jindal, A., Singh, M., Kumar, N., & Kumar, P. (2015). A novel smart meter for better control over devices including electric vehicles and to enable smart use of power in smart home. . https://doi.org/10.1109/itec-india.2015.7386924

An efficient shortest path routing algorithm in the data centre network DPillar (2015)
Conference Proceeding
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015). An efficient shortest path routing algorithm in the data centre network DPillar. In Z. Lu, D. Kim, W. Wu, W. Li, & D. -. Du (Eds.), Combinatorial optimization and applications: 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, proceedings (209-220). https://doi.org/10.1007/978-3-319-26626-8_16

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 symm... Read More about An efficient shortest path routing algorithm in the data centre network DPillar.

On the mathematics of data centre network topologies (2015)
Conference Proceeding
Stewart, I. (2015). On the mathematics of data centre network topologies. In A. Kosowski, & I. Walukiewicz (Eds.), Fundamentals of computation theory : 20th international symposium, FCT 2015, Gdańsk, Poland, August 17 - 19, 2015 ; proceedings (283-295). https://doi.org/10.1007/978-3-319-22177-9_22

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to... Read More about On the mathematics of data centre network topologies.

Routing algorithms for recursively-defined data centre networks (2015)
Conference Proceeding
Erickson, A., Kiasari, A., Navaridas, J., & Stewart, I. (2015). Routing algorithms for recursively-defined data centre networks. In ISPA 105: The 13th IEEE International Symposium on Parallel and Distributed Processing with Applications (84-91). https://doi.org/10.1109/trustcom.2015.616

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... Read More about Routing algorithms for recursively-defined data centre networks.