Planning of data transfers

• Thesis title in English: Planning of data transfers
• Academic year of topic announcement: 2009/2010
• Thesis type: diploma thesis
• Thesis language: angličtina
• Department: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
• Supervisor: prof. RNDr. Roman Barták, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 26.10.2009
• Date of assignment: 26.10.2009

Guidelines

The diploma thesis deals with planning data movements in computer networks. In particular, the thesis will be about algorithms for finding optimal paths in computer networks for data transfer satisfying the required constraints such as limited bandwidth. Student will familiarize himself with problems of optimizing data transfers in networks and with existing techniques for solving these or similar problems, in particular with constraint satisfaction techniques. The student will compare the existing techniques based on their efficiency and applicability to particular problems and then he will propose or modify a certain solving technique for a particular problem.

References

H. Simonis. Constraint Applications in Networks. In Handbook of Constraint Programming, pp. 875-903, Elsevier, 2006.

R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.

M. Liška, P. Holub. CoUniverse: Framework for Building Self-Organizing Collaborative Environments Using Extreme-Bandwidth Media Applications. In The Eighth International Conference on Networks ICN 2009. Cancún, Mexico: IARIA, 2009.

M. Zerola, M. Šumbera, J. Lauret, R. Barták. Efficient Scheduling of Data Transfers and Job Allocations. In P. Ambroz, Z. Masakova (eds.): Doktorandske dny 2008 (sbornik workshopu doktorandu FJFI oboru Matematicke inzenyrstvi), pp. 215 - 224. CVUT, Praha, 2008.

M. Zerola, R. Barták, J. Lauret, M. Šumbera. Planning Heuristics for Efficient Data Movement on the Grid. In Proceedings of MISTA 2009: Fourth Multidisciplinary International Scheduling Conference: Theory and Applications, pp. 768-771. Dublin, Ireland, 2009.

Preliminary scope of work

Diplomová práce se bude zabývat návrhem algoritmů pro plánování přenosu dat v počítačových sítích, konkrétně hledáním vhodných cest pro přenos dat při zachování požadovaných omezení jako je průtok dat. Student se nejprve seznámí s problémy optimalizace přenosu data a s existujícími modely pro jejich řešení. Existující modely porovná a navrhne případně modifikuje řešící algoritmus pro vybraný problém.