LEASE: Lattice and ECC-Based Authentication and Integrity Verification Scheme in E-Healthcare
(2018)
Presentation / Conference Contribution
Dua, A., Chaudhary, R., Singh Aujla, G., Jindal, A., Kumar, N., & Rodrigues, J. J. (2018). LEASE: Lattice and ECC-Based Authentication and Integrity Verification Scheme in E-Healthcare. . https://doi.org/10.1109/glocom.2018.8648089
Outputs (329)
Bloom Filter Based Efficient Caching Scheme for Content Distribution in Vehicular Networks (2019)
Presentation / Conference Contribution
Dua, A., Shishodia, M., Kumar, N., Aujla, G. S., & Kumar, N. (2019). Bloom Filter Based Efficient Caching Scheme for Content Distribution in Vehicular Networks. . https://doi.org/10.1109/iccw.2019.8756669
NoViSec: Novel Virtual Network Mapping Framework for Secure Software-Defined Networking (2020)
Presentation / Conference Contribution
Cao, H., Hu, Y., Wu, S., Du, J., Tian, F., Aujla, G. S., & Yang, L. (2020). NoViSec: Novel Virtual Network Mapping Framework for Secure Software-Defined Networking. . https://doi.org/10.1109/wcncw48565.2020.9124795
A Self Organised Workload Classification and Scheduling Approach in IoT-Edge-Cloud Ecosystem (2020)
Presentation / Conference Contribution
Singh, A., Aujla, G. S., Singh Bali, R., Chahal, P. K., & Singh, M. (2020). A Self Organised Workload Classification and Scheduling Approach in IoT-Edge-Cloud Ecosystem. . https://doi.org/10.1109/vtc2020-fall49728.2020.9348511
The forgiving graph: a distributed data structure for low stretch under adversarial attack (2009)
Presentation / Conference Contribution
Hayes, T. P., Saia, J., & Trehan, A. (2009). The forgiving graph: a distributed data structure for low stretch under adversarial attack.
Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games (2011)
Presentation / Conference Contribution
Kutten, S., Lavi, R., & Trehan, A. (2011). Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games.
Sublinear Bounds for Randomized Leader Election (2013)
Presentation / Conference Contribution
Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013). Sublinear Bounds for Randomized Leader Election.
On Termination of a Flooding Process (2019)
Presentation / Conference Contribution
Hussak, W., & Trehan, A. (2019). On Termination of a Flooding Process. . https://doi.org/10.1145/3293611.3331586
DRUMS: Demand Response Management in a Smart City Using Deep Learning and SVR (2018)
Presentation / Conference Contribution
Jindal, A., Aujla, G. S., Kumar, N., Prodan, R., & Obaidat, M. S. (2018). DRUMS: Demand Response Management in a Smart City Using Deep Learning and SVR. . https://doi.org/10.1109/glocom.2018.8647926
Sustainable Smart Energy Cyber-Physical System: Can Electric Vehicles Suffice Its Needs? (2018)
Presentation / Conference Contribution
Jindal, A., Aujla, G. S., Kumar, N., & Misra, S. (2018). Sustainable Smart Energy Cyber-Physical System: Can Electric Vehicles Suffice Its Needs?. . https://doi.org/10.1109/iccw.2018.8403555
Information Classification Strategy for Blockchain-based Secure SDN in IoT Scenario (2020)
Presentation / Conference Contribution
Zhang, P., Liu, F., Kumar, N., & Aujla, G. S. (2020). Information Classification Strategy for Blockchain-based Secure SDN in IoT Scenario. . https://doi.org/10.1109/infocomwkshps50562.2020.9162677
An efficient shortest path routing algorithm in the data centre network DPillar (2015)
Presentation / Conference Contribution
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_16DPillar 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.
Routing packets on DPillar data centre networks (2015)
Presentation / Conference Contribution
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
Routing algorithms for recursively-defined data centre networks (2015)
Presentation / Conference Contribution
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.616The 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.
Accelerating ant colony optimization-based edge detection on the GPU using CUDA (2014)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2014). Accelerating ant colony optimization-based edge detection on the GPU using CUDA. In Proceedings of the 2014 IEEE Congress on Evolutionary Computation : July 6-11, 2014, Beijing, China (1736-1743). https://doi.org/10.1109/cec.2014.6900638Ant Colony Optimization (ACO) is a nature-inspired metaheuristic that can be applied to a wide range of optimization problems. In this paper we present the first parallel implementation of an ACO-based (image processing) edge detection algorithm on t... Read More about Accelerating ant colony optimization-based edge detection on the GPU using CUDA.
On the mathematics of data centre network topologies (2015)
Presentation / Conference Contribution
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_22In 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.
Improved routing in the data centre networks HCN and BCN (2014)
Presentation / Conference Contribution
Stewart, I. (2014). Improved routing in the data centre networks HCN and BCN. . https://doi.org/10.1109/candar.2014.16
Candidate set parallelization strategies for Ant Colony Optimization on the GPU (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013). Candidate set parallelization strategies for Ant Colony Optimization on the GPU. In J. Kołodziej, B. Di Martino, D. Talia, & K. Xiong (Eds.), 13th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP'13: Vietri sul Mare, Italy, December 18-20, 2013, Proceedings, Part I (216-225). https://doi.org/10.1007/978-3-319-03859-9_18For solving large instances of the Travelling Salesman Problem (TSP), the use of a candidate set (or candidate list) is essential to limit the search space and reduce the overall execution time when using heuristic search methods such as Ant Colony O... Read More about Candidate set parallelization strategies for Ant Colony Optimization on the GPU.
Improving Ant Colony Optimization performance on the GPU using CUDA. (2013)
Presentation / Conference Contribution
Dawson, L., & Stewart, I. (2013). Improving Ant Colony Optimization performance on the GPU using CUDA. In 2013 IEEE Congress on Evolutionary Computation (CEC 2013): Proceedings of a meeting held 20-23 June 2013, Cancun, Mexico (1901-1908). https://doi.org/10.1109/cec.2013.6557791We solve the Travelling Salesman Problem (TSP) using a parallel implementation of the Ant System (AS) algorithm for execution on the Graphics Processing Unit (GPU) using NVIDIA CUDA. Extending some recent research, we implement both the tour construc... Read More about Improving Ant Colony Optimization performance on the GPU using CUDA..
Graph editing to a fixed target (2013)
Presentation / Conference Contribution
Golovach, P., Paulusma, D., & Stewart, I. A. (2013). Graph editing to a fixed target. In T. Lecroq, & L. Mouchard (Eds.), Combinatorial algorithms : 24th International Workshop, IWOCA 2013, 10-12 July 2013, Rouen, France ; revised selected papers (192-205). https://doi.org/10.1007/978-3-642-45278-9_17For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex di... Read More about Graph editing to a fixed target.