Tags:
create new tag
view all tags

Network Algorithms

Algoritmi per le Reti

A.y./A.A. 2018/19


computer_network.jpg

Prof. Tiziana Calamoneri

Notices/Avvisi

10/30/2018: Some Dates' changes:

Dear students, while reminding you that today the lesson has been canceled by the Dean, I inform you that it is necessary to do some changes to the dates we had fixed, both for the Mid Term exam and for the Students' Lessons. Namely, before having the Mid Term exam, I would like to conclude the section on L(h,k)-labeling, so the Mid Term exam is moved to November 8 (and it is not on November 6 anymore); moreover, on November 27 I have to attend a compulsory course on work security and also that lesson will be deleted; it follows that the third group of Students' lesson will be held on December 11, while the fourth group on December 20. See you on November 6 for the usual lesson.

10/29/2018: tomorrow no lessons because of weather

10/19/2018: Because of theses defenses, next lesson (10/23/2018) will be held in Aula Seminari - 3rd floor (not in Aula Alfa).


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: designing a good algorithm often means having a good solution for the initial problem. Nevertheless, probably nobody 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 studied in a master thesis, with good possibilities to find some new results.

It is worth to be noted that the approach of the course 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

Tuesday/martedì 14.00 - 16.30 Aula Alfa/Alpha Room
Thursday/giovedì 14.00 - 16.30 Aula Alfa/Alpha Room


Office Hours/Ricevimento A.A. 2018/19 I semester/I semestre

Prof. Tiziana Calamoneri Dept. of Computer Science/Dip. Informatica - via Regina Elena 295 - room G27 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 2018-2019

November 2018
        01 02 03
04 05 06 07 08 09 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25 26 27 28 29 30  

Next meetings/Prossimi appuntamenti:

  • 25 Sep 2018 - 14.00 Alpha Room first lesson
Past meetings/Appuntamenti passati:
  • 12 Sep 2018 - 9.00 a.m. Oral exam - teacher office (via Regina Elena 295, room G29) - Please, register on Infostud
  • 6 Jul 2018 - 9.00 a.m. Final exam - room G50 (via Regina Elena 295, building G, 3rd floor)
  • 13 Jun 2018 - Final exam - 2.00 p.m. - room G50 (via Regina Elena 295, building G, 3rd floor)
  • 4 Apr 2017 - 2.30 p.m. Oral exam (reserved) - teacher office (via Regina Elena 295, room G29)
  • 2 Mar 2018 - 9.30 a.m. Oral exam - meeting room 3rd floor.
  • 7 Feb 2018 - 9.30 a.m. Oral exam - meeting room 3rd floor.
  • 10 Jan 2018 - 9.30 a.m. Oral exam - Meeting room 3rd floor.

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: r76 < r75 < r74 < r73 < r72 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r76 - 2018-10-30 - 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