Practical Course Advanced Networking (Summer 2011): Difference between revisions

no edit summary
No edit summary
 
(23 intermediate revisions by 6 users not shown)
Line 11: Line 11:


==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].
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].  
'''Registration is still open. Please contact one of the topic advisers.'''


==Prerequisites==
==Prerequisites==
Line 25: Line 26:


==Passing requirements==
==Passing requirements==
* Prepare a written report on the selected topic (12-15 pages) and have a face-to-face discussion with your topic advisor. (30%)
* 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 (20 min. presentation and demo + 10 min. discussion). (70%)
* Present your topic and '''demonstrate your project''' at the end of this course (20 min. presentation and demo + 10 min. discussion). (70%)
* '''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.)
* '''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.)
Line 32: Line 33:
* Friday, '''15 April 2011, 16.15 - 17.15''': Informational meeting:  
* Friday, '''15 April 2011, 16.15 - 17.15''': Informational meeting:  
** Introduction to the course, selection of topics, teams and discussion of open questions
** Introduction to the course, selection of topics, teams and discussion of open questions
* Thursday, '''19 May 2011, 15.00 - 17.30''': Mid-presentation:  
* Thursday, '''30.06.2011, 15.00 - 17.30''': Mid-presentation:  
** 20 Minutes presentation slot for each team  
** 20 Minutes presentation slot for each team  
* Thursday, '''08.09.2011, 23.59 (CET)''' Submission of slides/animation and demo for final presentation  
* Thursday, '''08.09.2011, 23.59 (CET)''' Submission of slides/animation and demo for final presentation  
Line 50: Line 51:
*** A short manual on how to use the code
*** A short manual on how to use the code
*** CD/link to the code
*** CD/link to the code
==Student Projects Demos==
===1.Give Me a Ride===
this app intends to be useful for someone who wants to announce his or her extra ticket information, especially for those who has bought one weekend ticket for five persons but only find one or two people to travel with. And others who need those tickets can just find and book by this windows phone app.
Additionally this app also provide notification functionality for users who didn't find any adorable ticket info. they will receive a toast message when there is ticket satisfying their requirement.
*[http://www.youtube.com/watch?v=Sw2ddH7sosw Demo of registering and searching functionalities]
*[http://www.youtube.com/watch?v=5n6IVjQ25n8 Demo of book and notification functionalities]
[[File:WP7demo.jpg]]


== Topics ==
== Topics ==
Line 66: Line 77:
| [http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao]
| [http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao]
| [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 imagining that you can make some files on your phone accessible to your friends by only marking these files as "shared", 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 exploiting various cloud services from Microsoft, e.g., Relay and Rendezvous Services enable one Windows Phone to access another via some replay point in the cloud, which seem to be the best fit for the implementation of this application.
| 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.
|
|-
| Talk to Strangers around You Anonymously ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| [http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao]
| [http://en.wikipedia.org/wiki/Omegle] [http://www.omegle.com/] [http://research.microsoft.com/en-us/um/redmond/projects/hawaii/students/]
| [http://www.omegle.com/ Omegle] is a website via which strangers worldwide can talk with each other anonymously. Anonymous chat can also be implemented in a location-based fashion, i.e., people can be enabled to chat anonymously with others who are physically nearby. In this project, you are expected to develop such a location-based anonymous instant-messaging application for Windows Phones. You can leverage various cloud services from Microsoft to select co-located strangers to form one-to-one, one-to-many and many-to-many conversations. This application can also be extended to exchanging files between strangers and video chat if strangers are willing to see eath other.
|
|-
| Decentralize Twitter by Content-Centric Networking
| [http://www.net.informatik.uni-goettingen.de/people/lei_jiao Lei Jiao]
| [http://www.ccnx.org/] [http://www.named-data.net/] [http://www.peerson.net/] [http://www.safebook.us/home.html]
| Social Network Service (SNS) such as Twitter suffers from server performance bottlenecks, central point of failure and malicious attacks due to the centralized architecture. Besides existing work (e.g., PeerSon, Safebook, etc.) of building decentralized SNS on top of P2P overlay, Content-Centric Networking (CCN) can achieve efficient content cache and dissemination and therefore provide an alternative to construct decentralized SNS. Leveraging CCN, this project is to decentralize Twitter in a peer-assisted fashion where messages (i.e., tweets/statuses) are disseminated by CCN among users and the Twitter server is only used as a messages backup. A Twitter client application is expected to be implemented in the context of CCN and built over the open-source CCNx implementation.
|
|
|-
|-
Line 104: Line 103:
| 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.
| 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.
|
|
|-
| 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://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.
|
|-
| Development and Data Collection of a Facebook/Twitter application
| [http://www.net.informatik.uni-goettingen.de/people/mayutan_arumaithurai Mayutan A]
| [http://developers.facebook.com/docs/]
| Build a Facebook application (I have some ideas or you could implement your own) and perform basic data collection and presentation of the data.
|
|-
| A foursquare like location based game ([https://wiki.net.informatik.uni-goettingen.de/wiki/Hawaii_Summer_2011 Hawaii])
| [http://www.net.informatik.uni-goettingen.de/people/mayutan_arumaithurai Mayutan A]
| [https://foursquare.com/]
| Build an application that is able to rank you based on the frequency with which you visit a place. E.g., if you are the most frequent visitor to
the university Mensa for a month, you will obtain the title major, the second most visitor would get the title Major's wife and etc.
|
|-
Editor
112

edits