Tags:
create new tag
view all tags

Network Algorithms

Algoritmi per le Reti

A.y./A.A. 2016/17


computer_network.jpg

Prof. Tiziana Calamoneri

Notices/Avvisi

April 2017 Exam (only for the students who required it): April 4 2017 at 2.30 p.m. in the teacher office (via Regina Elena 295 room G29)

Urgent and Very important:

the last lesson is set on Thursday 21 December at 2.00 p.m.

12/19/2016: unfortunately I am still not well, so no lesson today. I will try to find another time slot as soon as possible and keep you informed

12/18/2016: dear students,

I have got sick and it is highly probable that I will not be able to be present during our last lesson of Monday the 19th.

But, for your evaluation, it is essential not to skip this lesson, so I will do my best to find another time slot soon. Please often look at this web page for further communications.

--

scheduling of students' lessons:

December 12

  • Francesco Palini (layout)
  • Mario Profumo (L(2,1)-labeling)
  • Marco Cugino (L(2,1)-labeling)
  • Karim Mejri (L(2,1)-labeling)

December 19

  • Andrea Nadelle (routing)
  • Meysam Seyahtiri (routing)
  • Carlo Maria Russo (set cover)
  • Rafael Salinas (deployment)

No lessons this week. Mid term exam will be held on Friday 11 at 10 a.m. in the teacher's office. Please confirm your presence with an email.
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.


FOR ITALIAN STUDENTS ONLY: Dall.A.A. 2014/15 questo corso sarà previsto al II anno del corso di laurea magistrale. Tuttavia, se siete del I anno e volete frequentarlo e sostenere l'esame potete farlo, con l'accortezza di verbalizzarlo l'A.A. sucessivo.

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

lunedì/Monday 14.00 - 15.30 Aula Alfa/Alpha Room
venerdì/Friday 14.00 - 15.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 4991 8422 per appuntamento inviando una e-mail a calamo@diNOSPAM.uniroma1.it - cancellare la scritta NOSPAM dall'indirizzo/write an e-mail to calamo@diNOSPAM.uniroma1.it (delete NOSPAM from the address) to get an appointment


Date Esami/Exam Dates

June 2017
        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  

Prossimi appuntamenti/Next meetings:

  • 4 Apr 2017 - 2.30 p.m. Oral exam (reserved) - teacher office (via Regina Elena 295, room G29)
  • 31 Jan 2017 - 9.30 a.m. Oral exam - meeting room 3rd floor.
  • 10 Jan 2017 - 9.30 a.m. Oral exam - Meeting room 3rd floor.
  • 5 Sep 2016 - 3.00 p.m. Oral exam. Please contact me asap if you are interested.
  • 22 Mar 2016 - 2.00 p.m. Oral exam (special session) - in my room. Please communicate in advance your willing to give the exam.
  • 8 Jan 2016 - 10.00 a.m. Oral exam - in my room. Please communicate in advance to the teacher your willing to give the exam.
  • 5 Feb 2016 - 10.00 a.m. Oral exam - in my room. Please communicate in advance to the teacher your willing to give the exam.
  • 6 Nov 2015 - 12.00 a.m. mid term (oral) exam - in my room. Please, drop me an email claiming your intention to give the exam within Tuesday November 3.

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


Mid-course examination Results/Risultati Esoneri

Edit | Attach | Watch | Print version | History: r58 < r57 < r56 < r55 < r54 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r58 - 2017-03-20 - TizianaCalamoneri






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