Exploitation of Strictly Local Information

Strictly local information corresponds to information that is available to an individual node. In order to tackle the previously mentioned scalability problem, the various mechanisms that decide on gradually better locations (in terms of the overall cost) for the facility and adapt automatically to dynamic network changes were studied. Even though they may not always conclude on the optimal location (non-realistic in any case in highly dynamic environments where the optimal location continuously changes), they allow for overall cost reduction for every movement of the facility compared to the previous location.

Having the service facility located at node y, if the load seen from its neighbor node z (Λ^y_z) is more than half the total load seen by node y (i.e., Λ^z_y+Λ^y_z), the migration of the service facility from node y to node z can take place and it is ensured that the overall cost will be reduced.


[7] Georgios Tsoumanis, Konstantinos Oikonomou, Sonia Aïssa, Ioannis Stavrakakis, “Recharging Vehicle Distance Minimization in Wireless Sensor Networks”, In BalkanCom 2017, First International Balkan Conference on Communications and Networking, Tirana, Albania, 2017. ([pdf])
[6] Eleni Kavvadia, Spyros Sagiadinos, Konstantinos Oikonomou, Giorgos Tsioutsiouliklis, Sonia Aïssa, “Elastic Virtual Machine Placement in Cloud Computing Network Environments”, In Computer Networks, Elsevier, vol. 93, no. Part 3, pp. 435-447, 2015.
[5] Konstantinos Oikonomou, Giorgos Tsioutsiouliklis, Sonia Aïssa, “Scalable Facility Placement for Communication Cost Reduction in Wireless Networks”, In 2012 IEEE International Conference on Communications (ICC), pp. 5118-5123, 2012.
[4] Konstantinos Oikonomou, Ioannis Stavrakakis, “Scalable Service Migration in Autonomic Network Environments”, In IEEE Journal on Selected Areas in Communications, vol. 28, no. 1, pp. 84-94, 2010.
[3] Konstantinos Oikonomou, Spyros Sioutas, Ioannis Stavrakakis, “Scalable Communication Cost Reduction: The Chord Case”, In 2009 8th IFIP Annual Mediterranean Ad Hoc Networking Workshop, pp. 42-47, 2009.
[2] Konstantinos Oikonomou, Ioannis Stavrakakis, Alexios Xydias, “Scalable Service Migration in General Topologies”, In 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1-6, 2008.
[1] Konstantinos Oikonomou, Ioannis Stavrakakis, “Scalable Service Migration: The Tree Topology Case”, In 5th Annual Mediterranean Ad Hoc Networking Workshop, 2006. ([pdf])