Practical Course Advanced Networking (Winter 2011/2012): Difference between revisions

From NET Wiki
Jump to navigation Jump to search
 
(64 intermediate revisions by 4 users not shown)
Line 4: Line 4:
|module=M.Inf.805.6C: Fortgeschrittenenpraktikum Computernetzwerke
|module=M.Inf.805.6C: Fortgeschrittenenpraktikum Computernetzwerke
|ta=[http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao], [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
|ta=[http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao], [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
|time=Friday, 15 April 2011, 15.00-16.00 (organizational meeting, see [[#Schedule]] for details)
|time=4 November 2011 - 10 February 2012
|place=IfI 3.101
|place=IfI 3.101
|univz=[http://univz.uni-goettingen.de/qisserver/rds?state=verpublish&status=init&vmfile=no&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung&veranstaltung.veranstid=90530]
|univz=[http://univz.uni-goettingen.de/qisserver/rds?state=verpublish&status=init&vmfile=no&moduleCall=webInfo&publishConfFile=webInfo&publishSubDir=veranstaltung&veranstaltung.veranstid=90530]
|
|
}}
}}
{{Announcement|'''Please do not hesitate to contact us if you want to take this course or join the Hawaii competition.'''}}


==Course description==
==Course description==
We offer a couple of practical topics related to advanced computer networking. In this semester, some of the offered projects are supported by Microsoft's [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/ Hawaii] project. By choosing one of the projects marked by '''Hawaii''', you are eligible to participate in the [https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii competition].  
In this semester, some of our offered projects are supported by Microsoft's [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/ Hawaii] project. By choosing one of the projects marked by '''Hawaii''', you are eligible to participate in the [https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii competition]. (500 US dollars will be awarded to the most competent team within our university.)
'''Registration is still open. Please contact one of the topic advisers.'''
 
We have some project(s) demo [https://wiki.net.informatik.uni-goettingen.de/wiki/Practical_Course_Advanced_Networking_(Summer_2011)#Student_Projects_Demos here] last semester.


==Prerequisites==
==Prerequisites==
This course requires fair overall knowledge of computer networking. You are highly ''recommended'' to have attended the following courses prior to taking this one:
You are highly ''recommended'' to have attended the following course(s) prior to this one:
*Computer Networks (previously "Telematik")
*Computer Networks (previously "Telematik")


==Organization==
==Organization==
===Informational meeting===
===Informational meeting===
At the beginning of a semester (see [[#Schedule]]) there will be an informational meeting. At this meeting we will give an introduction to this practical course including a tour to our lab and the students will form lab teams.
At the beginning of this semester (see [[#Schedule]]), there is an informational meeting.


===Lab teams===
===Course teams===
The students will conduct the practical course in small teams. A team usually consists of two or three students. Teams will be formed at the informational meeting at the beginning of this course.
Students conduct this course in small teams. A team consists of at most three students.


==Passing requirements==
==Passing requirements==
* Prepare a written report on the selected topic (12-15 pages, Template:[ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip]) and have a face-to-face discussion with your topic advisor. (30%)
* Present your topic and '''demonstrate your project''' at the end of this course (70%)
* Present your topic and '''demonstrate your project''' at the end of this course (20 min. presentation and demo + 10 min. discussion). (70%)
* Prepare a '''written report''' on the selected topic (12-15 pages, Template:[ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip]) (30%)
* '''To be fair to all, it is mandatory for all to stick to the deadlines mentioned in [[#Schedule]]'''. (Please see [[#Schedule]] to have an idea of what is required at each stage and also talk to your topic advisors for more details.)
* It is mandatory for all students to '''stick to the deadlines''' mentioned in [[#Schedule]]'''.


==Schedule==
==Schedule==
* '''4 November 2011, 15.00 - 16.00''': Informational meeting:
* '''4 November 2011, 15.00 - 16.00''': Informational meeting
** Introduction to the course, selection of topics, teams and discussion of open questions
** Introduction to the course, selection of topics, formation of teams, and discussion of open questions
* '''23 December 2011, 14.00 - 17.00''': Mid-term presentation:
* '''13 January 2011, 14.00 - 17.00''': Mid-term presentation
** Each group has 20 minutes, 12-15 minutes for the presentation of the current status and 5-8 minutes for questions and comments
** Time allocated for each presentation = 20 minutes
* '''17 February 2011''' Submission of slides/animation and demo for final presentation  
*** Presentation = 12-15 minutes
** '''(Mandatory to get a presentation slot)'''
*** Q & A = 5-8 minutes
* '''24 February 2011''' Final presentations Slot - I
* '''31 January 2012''': Submission of slides (and/or animation, demo, etc.) for final presentation  
** Mandatory in order to get a presentation slot
* '''3 February 2012, 14.00 - 17.00''': Final presentations slot - I
** Time allocated for each presentation = 30 minutes  
** Time allocated for each presentation = 30 minutes  
*** Presentation = 10 minutes
*** Presentation = 10 minutes
*** Demo = 10 Minutes
*** Demo = 10 Minutes
*** Q and A = 10 minutes  
*** Q & A = 10 minutes
* '''22.09.2011''' Final presentations Slot - II
* '''10 February 2012, 14.00 - 17.00''': Final presentations slot - II
* '''30.09.2011, 23.59 (CET)''' Submission of Final report & video/slides
* '''31 March 2012''': Submission of the written report
** '''(Mandatory to receive a final grade and/or be eligible for Hawaii competition)'''
** The Final report must contain the following:
*** Introduction and Motivation for the project
*** Design. implementation and evaluation details
*** Evaluation results
*** A short manual on how to use the code
*** CD/link to the code


== Topics ==
== Topics ==


The following list of topics is constantly being expanded. If there is no topic that you like at the moment, please check back regularly for the most recent updates. You can also get in touch with us directly and we will try to find a topic that interests you. Feel free to suggest your own topics too, to the course advisors and we might accept it if the topic satisfies the requirements of the course.   
The following list of topics is constantly being expanded. If there is no topic that you like at the moment, please check back regularly for the most recent updates. You can also get in touch with us directly and we will try to find a topic that interests you. Also feel free to suggest your own topic(s) to the course advisors and we will accept it if the topic satisfies the requirements of this course.   


{| align="center" class="wikitable sortable" {{Prettytable}}  
{| align="center" class="wikitable sortable" {{Prettytable}}  
Line 68: Line 65:
| [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]
| [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]
| Imagining that you can store your photos and videos remotely on phones of your trusted friends when your own phone is short of storage, and also imagining that you can make files on your phone accessible to your friends by only marking these files as "share", in this project, you are expected to develop such an application to enable Windows Phones of your own and your friends to form a network of shared storage by leveraging various cloud services (e.g., Relay and Rendezvous Services) from Microsoft. This application can be further enhanced by adding some location-based functionalities.
| Imagining that you can store your photos and videos remotely on phones of your trusted friends when your own phone is short of storage, and also imagining that you can make files on your phone accessible to your friends by only marking these files as "share", in this project, you are expected to develop such an application to enable Windows Phones of your own and your friends to form a network of shared storage by leveraging various cloud services (e.g., Relay and Rendezvous Services) from Microsoft. This application can be further enhanced by adding some location-based functionalities.
|  
|
|-
|-
| A Cloud-Enabled Mobile Content-Based Image Retrieval Application ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| A Cloud-Enabled Mobile Content-Based Image Retrieval Application ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
| [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
| [http://www.ccnx.org/] [http://www.named-data.net/] [http://www.peerson.net/] [http://www.safebook.us/home.html]
| [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]
|The team will develop a cloud-enabled Content-Based Image Retrieval (CBIR) application for Windows Mobile platforms using the cloud as corpus rather than a local database. The application will have mobile interfaces which allow Windows Mobile users to access such service. Users can use their Windows Live ID to set up some preferences (such as preferred image size, search domain, etc) associated with the ID.
|The team will develop a cloud-enabled Content-Based Image Retrieval (CBIR) application for Windows Mobile platforms using the cloud as corpus rather than a local database. The application will have mobile interfaces which allow Windows Mobile users to access such service. Users can use their Windows Live ID to set up some preferences (such as preferred image size, search domain, etc) associated with the ID.
|
|
Line 78: Line 75:
| A Mobile Socially-Aware Tour Guide Application ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| A Mobile Socially-Aware Tour Guide Application ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
| [http://www.net.informatik.uni-goettingen.de/people/jiachen_chen Jiachen Chen]
| [http://www.ccnx.org/] [http://www.named-data.net/] [http://www.peerson.net/] [http://www.safebook.us/home.html]
| [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]
| The team will develop an application which allows users to photograph/speak/input the name of a tour attraction and then invoke the cloud OCR/speak-to-text services and search engines to discover and share the information about this attraction. Users can write on the electronic-wall created for the attraction to share information. Users can also invite people who also visited the same attraction to be friends, get other people's comments or leave their own ones on this attraction, and recommend this attraction to other people.
| The team will develop an application which allows users to photograph/speak/input the name of a tour attraction and then invoke the cloud OCR/speak-to-text services and search engines to discover and share the information about this attraction. Users can write on the electronic-wall created for the attraction to share information. Users can also invite people who also visited the same attraction to be friends, get other people's comments or leave their own ones on this attraction, and recommend this attraction to other people.
|
|
|-
|-
| Group function in mobile social networks and its evaluation
| Mobile effects in online social networks
| [http://www.net.informatik.uni-goettingen.de/people/konglin_zhu Konglin Zhu]
| [http://www.winterwell.com/software/jtwitter/] [http://www.twitter.com/] [http://www.cl.cam.ac.uk/~ph315/publications/goose_final_socialComWorkshop.pdf]
| Complete the design of group function in a mobile social networks and evaluate the performance using crawled online/mobile social network datast.
|
|-
| Interest graph modeling and analysis
| [http://www.net.informatik.uni-goettingen.de/people/konglin_zhu Konglin Zhu]
| [http://www.net.informatik.uni-goettingen.de/people/konglin_zhu Konglin Zhu]
| [http://blog.assetmap.com/2010/11/social-web/why-the-interest-graph-will-reshape-social-networks-and-the-next-generation-of-internet-business/]
| [http://www.twitter.com/]  
| In social networks, people sharing same interests or public pages, which construct interest graph. This kind of interest orientated graph can not only create a valuable exchange for intermation commerce, but also improve how people learn, discover, share and communicate. It provides a new path of content sharing. Interest graph is "interest" objected. People may not know each other but sharing same interest can be in a same interest graph. We provide you a interested based dataset to analyize the interest graph. It includes the interest graph construction, interest graph degree, distribution, and the correlation between interest graph and social graph.
| Evaluating the influence of mobile phone in online social networks, including social graph analysis. Analysize the offline social network data and compare the difference of mobile effects in such two scenarios.
|
|
|-
|-
| A Location Based Community Organizer ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| A Location Based Community Organizer ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| [http://www.net.informatik.uni-goettingen.de/people/david_koll David Koll]
| [http://www.net.informatik.uni-goettingen.de/people/david_koll David Koll]
| [http://http://www.facebook.com/places/][http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]  
| [http://www.facebook.com/places/][http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]  
| The team will develop a location based community organizer, similar to Facebook places. The idea is to share your location and activity with communities within your social contacts. If two members of a community are close to each other with regards to their location, the application will trigger events, which allow setting up meeting points, sharing contents (e.g., ratings for nearby places), etc.
| The team will develop a location based community organizer, similar to Facebook places. The idea is to share your location and activity with communities within your social contacts. If two members of a community are close to each other with regards to their location, the application will trigger events, which allow setting up meeting points, sharing contents (e.g., ratings for nearby places), etc.
|
|
|-
|-

Latest revision as of 12:58, 29 December 2011

Details

Workload/ECTS Credits: 180h, 6 ECTS
Module: M.Inf.805.6C: Fortgeschrittenenpraktikum Computernetzwerke
Lecturer: {{{lecturer}}}
Teaching assistant: Lei Jiao, Jiachen Chen
Time: 4 November 2011 - 10 February 2012
Place: IfI 3.101
UniVZ [1]


Imbox content.png Please do not hesitate to contact us if you want to take this course or join the Hawaii competition.

Course description

In this semester, some of our offered projects are supported by Microsoft's Hawaii project. By choosing one of the projects marked by Hawaii, you are eligible to participate in the Hawaii competition. (500 US dollars will be awarded to the most competent team within our university.)

We have some project(s) demo here last semester.

Prerequisites

You are highly recommended to have attended the following course(s) prior to this one:

  • Computer Networks (previously "Telematik")

Organization

Informational meeting

At the beginning of this semester (see #Schedule), there is an informational meeting.

Course teams

Students conduct this course in small teams. A team consists of at most three students.

Passing requirements

  • Present your topic and demonstrate your project at the end of this course (70%)
  • Prepare a written report on the selected topic (12-15 pages, Template:[2]) (30%)
  • It is mandatory for all students to stick to the deadlines mentioned in #Schedule.

Schedule

  • 4 November 2011, 15.00 - 16.00: Informational meeting
    • Introduction to the course, selection of topics, formation of teams, and discussion of open questions
  • 13 January 2011, 14.00 - 17.00: Mid-term presentation
    • Time allocated for each presentation = 20 minutes
      • Presentation = 12-15 minutes
      • Q & A = 5-8 minutes
  • 31 January 2012: Submission of slides (and/or animation, demo, etc.) for final presentation
    • Mandatory in order to get a presentation slot
  • 3 February 2012, 14.00 - 17.00: Final presentations slot - I
    • Time allocated for each presentation = 30 minutes
      • Presentation = 10 minutes
      • Demo = 10 Minutes
      • Q & A = 10 minutes
  • 10 February 2012, 14.00 - 17.00: Final presentations slot - II
  • 31 March 2012: Submission of the written report

Topics

The following list of topics is constantly being expanded. If there is no topic that you like at the moment, please check back regularly for the most recent updates. You can also get in touch with us directly and we will try to find a topic that interests you. Also feel free to suggest your own topic(s) to the course advisors and we will accept it if the topic satisfies the requirements of this course.

Topic Topic advisor Initial readings Description Student
Store and Share in Your Friend Cloud (Hawaii) Lei Jiao [3] Imagining that you can store your photos and videos remotely on phones of your trusted friends when your own phone is short of storage, and also imagining that you can make files on your phone accessible to your friends by only marking these files as "share", in this project, you are expected to develop such an application to enable Windows Phones of your own and your friends to form a network of shared storage by leveraging various cloud services (e.g., Relay and Rendezvous Services) from Microsoft. This application can be further enhanced by adding some location-based functionalities.
A Cloud-Enabled Mobile Content-Based Image Retrieval Application (Hawaii) Jiachen Chen [4] The team will develop a cloud-enabled Content-Based Image Retrieval (CBIR) application for Windows Mobile platforms using the cloud as corpus rather than a local database. The application will have mobile interfaces which allow Windows Mobile users to access such service. Users can use their Windows Live ID to set up some preferences (such as preferred image size, search domain, etc) associated with the ID.
A Mobile Socially-Aware Tour Guide Application (Hawaii) Jiachen Chen [5] The team will develop an application which allows users to photograph/speak/input the name of a tour attraction and then invoke the cloud OCR/speak-to-text services and search engines to discover and share the information about this attraction. Users can write on the electronic-wall created for the attraction to share information. Users can also invite people who also visited the same attraction to be friends, get other people's comments or leave their own ones on this attraction, and recommend this attraction to other people.
Mobile effects in online social networks Konglin Zhu [6] Evaluating the influence of mobile phone in online social networks, including social graph analysis. Analysize the offline social network data and compare the difference of mobile effects in such two scenarios.
A Location Based Community Organizer (Hawaii) David Koll [7][8] The team will develop a location based community organizer, similar to Facebook places. The idea is to share your location and activity with communities within your social contacts. If two members of a community are close to each other with regards to their location, the application will trigger events, which allow setting up meeting points, sharing contents (e.g., ratings for nearby places), etc.