Allocation of Publisher/Subscriber Data Links on a Set of Virtual Machines

IEEE International Conference on Cloud Computing, CLOUD

Volumn 2018-July, Issue , 2018, Pages 516-523

  Lambert, Thomas ^a   Sakellariou, Rizos ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Bandwidth Allocation; Knapsack Problems; Publish Subscribe

Indexed keywords

APPLICATION PROGRAMS; BANDWIDTH; COMBINATORIAL OPTIMIZATION; FREQUENCY ALLOCATION; INTEGER PROGRAMMING; NETWORK SECURITY; VIRTUAL MACHINE;

CLOUD INFRASTRUCTURES; INDUSTRIAL SETTINGS; INTEGER LINEAR PROGRAMMING FORMULATION; KNAPSACK PROBLEMS; LARGE VOLUMES; PUBLISH/SUBSCRIBE; PUBLISHER/SUBSCRIBER; SPECIALIZED SOFTWARE;

CLOUD COMPUTING;

EID: 85057457521     PISSN: 21596182     EISSN: 21596190     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2018.00072     Document Type: Conference Paper

References (16)

1. A. Antonić, M. Marjanović, K. Pripuẑić, and I. P. Z;arko, "A mobile crowd sensing ecosystem enabled by cupus: Cloud-based publish/ subscribe middleware for the internet of things," Future Generation Computer Systems, vol. 56, pp. 607-622, 2016.
2. P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec, "The many faces of publish/subscribe," ACM Computing Surveys, vol. 35, no. 2, pp. 114-131, Jun. 2003.
3. V. Setty, R. Vitenberg, G. Kreitz, G. Urdaneta, and M. v. Steen, "Costeffective resource allocation for deploying pub/sub on cloud," in 2014 IEEE 34th International Conference on Distributed Computing Systems, June 2014, pp. 555-566.
4. Y. Sun, X. Qiao, B. Cheng, and J. Chen, "A low-delay, lightweight publish/subscribe architecture for delay-sensitive IoT services," in 2013 IEEE 20th International Conference on Web Services, June 2013, pp. 179-186.
5. D. Happ, N. Karowski, T. Menzel, V. Handziski, and A. Wolisz, "Meeting iot platform requirements with open pub/sub solutions," Annals of Telecommunications, vol. 72, no. 1, pp. 41-52, Feb 2017.
6. Y. Teranishi, R. Banno, and T. Akiyama, "Scalable and locality-aware distributed topic-based pub/sub messaging for iot," in 2015 IEEE Global Communications Conference (GLOBECOM), Dec 2015, pp. 1-7.
7. L. Guo, D. Zhang, G. Li, K.-L. Tan, and Z. Bao, "Location-aware pub/sub system: When continuous moving queries meet dynamic event streams," in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, ser. SIGMOD'15. New York, NY, USA: ACM, 2015, pp. 843-857.
8. M. A. Shah and D. B. Kulkarni, "Storm pub-sub: High performance, scalable content based event matching system using storm," in 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, May 2015, pp. 585-590.
9. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of computer computations. Springer, 1972, pp. 85-103.
10. C. Chekuri and S. Khanna, "A polynomial time approximation scheme for the multiple knapsack problem," SIAM Journal on Computing, vol. 35, no. 3, pp. 713-728, 2005.
11. S. Martello and P. Toth, "Heuristic algorithms for the multiple knapsack problem," Computing, vol. 27, no. 2, pp. 93-112, 1981.
12. C. Cotta and J. M. Troya, "A hybrid genetic algorithm for the 0-1 multiple knapsack problem," in Artificial neural nets and genetic algorithms. Springer, 1998, pp. 250-254.
13. D. Pisinger, "An exact algorithm for large multiple knapsack problems," European Journal of Operational Research, vol. 114, no. 3, pp. 528-541, 1999.
14. A. S. Fukunaga, "A branch-and-bound algorithm for hard multiple knapsack problems," Annals of Operations Research, vol. 184, no. 1, pp. 97-119, 2011.
15. "IBM ILOG CPLEX Optimizer." [Online]. Available: https://www.ibm. com/analytics/data-science/prescriptive-analytics/cplex-optimizer
16. "Plateforme Fédérative pour la Recherche en Informatique et Mathématiques," 2009. [Online]. Available: https://www.plafrim.fr/fr/ accueil/