Tags:
create new tag
view all tags

Network Algorithms

Algoritmi per le Reti

A.y./A.A. 2017/18

NEW The Lesson of December 11 is moved to the Seminar Room, III floor

IMPORTANT The schedule of Student lessons has been changed. Please look at the relative section.

INTERESTING OPPORTUNITY The Computer Science Department at ETH offers a summer research fellowship for undergraduate and graduate students over the summer months (1 July – 31 August 2018). Applications for the program are open to all students – international students are particularly encouraged (deadline: 31 December 2017). The department is committed to increasing diversity in the computer science area.

The program offers: • Research experience: fellows will pursue a research project that aligns with a chosen area of their interest as part of a research group in our department. This includes interacting and collaborating with group members. • Networking and socializing: a number of on-site socializing events will help fellows to get to know people outside their respective research groups, including current ETH students at both undergraduate and graduate levels. • Stipend: fellows will receive a monthly allowance to cover housing and living expenses. Travel and visa expenses will be covered as well. • Accommodation: assistance is provided for finding affordable housing during the research stay, once a candidate is accepted into the program. We will also provide information regarding visa applications (where required).

Please find further details on the Website: https://www.inf.ethz.ch/ssr-fellowship.html


computer_network.jpg

Prof. Tiziana Calamoneri

Notices/Avvisi


Dear students,

during the algorithm courses you have already attended you have been told that algorithms in general, and graph algorithms in particular, are important because they are able to model the solution of a number of real life problems: having a good algorithm often means having a good solution for the initial problem. Nevertheless, probably nobody has clarified which are these real life problems. During this course I will show you many real life problems arising from using communication networks (cable or wireless networks, fixed or mobile networks) and, for each of them, we will discuss together how a problem can be modeled as a classical graph problem and solved by means of a graph algorithm, proposing sometimes more than one solution. In the first part of the course, I will propose some classical problems (together with their algorithmic solutions), hence essentially related to cable networks. In the second part of the course, I will deal with some advanced problems, especially related with wireless, ad hoc and sensor networks. Of course, these latter problems are particularly feasible to be study in a master thesis, with good possibilities to find some new results.

Finally, the approach is algorithmic, so a special accent is posed on the method used to find the optimal solution or, at least, the best possible one.


Cari ragazzi,

nei corsi di algoritmi che avete seguito vi è stato certamente detto che gli algoritmi in generale, e gli algoritmi su grafi in particolare, sono importanti perché possono modellare tanti problemi della vita reale ed avere un buon algoritmo per un problema su grafi significa spesso avere una buona soluzione per il relativo problema reale. Ma di quali siano in concreto questi problemi reali non si è quasi mai parlato. Ebbene, quello che invece cercherò di fare in questo corso è mostrarvi molti problemi "reali" che nascono dall'utilizzo di reti di comunicazione di vario tipo (cablate e senza fili, fisse e mobili) e, per ciascuno di essi, discuteremo come sia possibile modellarlo tramite un problema algoritmico classico e proporre quindi una o più soluzioni. Nella prima parte del corso, vi proporrò delle problematiche (e rispettive soluzioni algoritmiche) classiche, e quindi legate essenzialmente alle reti cablate. Nella seconda parte, invece, tratterò di argomenti di ricerca attuale, specie nel campo delle reti wireless ad hoc e delle reti di sensori. In particolare questi ultimi argomenti, come è ovvio, saranno particolarmente adatti a diventare argomenti di tesi di ampio respiro e con buone prospettive di trovare dei nuovi risultati.

L'approccio del corso sarà comunque algoritmico, e quindi si porrà particolare accento sul metodo con cui sia possibile trovare la soluzione ottima o, almeno, la più efficiente possibile.


Timetable/Orario delle Lezioni 2016/17 I semester/I semestre

lunedì/Monday 14.00 - 16.30 Aula Alfa/Alpha Room
venerdì/Friday 14.00 - 16.30 Aula Alfa/Alpha Room


Orario di ricevimento/Office Hours A.A. 2016/17 I semestre/I semester

Prof Tiziana Calamoneri Dip. Informatica/Computer Science Dept. 06 4925.5162 write an e-mail to calamo@diNOSPAM.uniroma1.it (delete NOSPAM from the address) to get an appointment/per appuntamento inviando una e-mail a calamo@diNOSPAM.uniroma1.it - cancellare la scritta NOSPAM dall'indirizzo


Exam Dates/Date Esami

January 2018
  01 02 03 04 05 06
07 08 09 109.00 a.m. Final exam - teacher office (via Regina Elena 295, room G29) 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 31      

Next meetings/Prossimi appuntamenti:

  • 22 Dec 2017 - 9.00 a.m. Partial/Final exam - teacher office (via Regina Elena 295, room G29).
Pay attention: if you wish to complete the exam on Dec. 22, register on Infostud; if you wish to do only a part, register here: http://twiki.di.uniroma1.it/twiki/view/Prenotazioni/2017_12_22_NetworkAlgorithms

  • 10 Jan 2018 - 9.00 a.m. Final exam - teacher office (via Regina Elena 295, room G29)
  • 7 Feb 2018 - 9.00 a.m. Final exam - teacher office (via Regina Elena 295, room G29)
Register on Infostud

Exam Procedure/Modalita' d'Esame


Program and Textbook/Programma del Corso e libri di testo


Lesson Diary/Diario delle Lezioni


Lesson Slides/Slides delle Lezioni


Student Lessons' Schedule/Programma Lezioni degli Studenti

Edit | Attach | Watch | Print version | History: r65 < r64 < r63 < r62 < r61 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r65 - 2017-12-04 - TizianaCalamoneri






 
Questo sito usa cookies, usandolo ne accettate la presenza. (CookiePolicy)
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback