IT-højskolen /Courses spring 2002 /Networks and Protocols

Lecture Plan (2002-02-05)

Networks and Protocols

IT-C, spring 2002

Internet Technology and Single subject (Åben Uddannelse)

The form and content of the course is described in The Course Base

Type of The Course: Lectures (in english) and excercises.
Location: IT-C, Glentevej 65-67, 2400 København NV.
Lectures:: Mondays 16.00 - 18.30. Lectures are held Glentevej 65 in auditorium 0.10.

The starttime of the lectures will appear on the Lectureplan see below - changes MAY occur.

Excercises - Internet Technology: Mondays 13 - 16: Excercises with instructor Anders Ejlev, (anders@ejlev.dk). Please note, excercises will be on the material form the lecture held the previous monday! first time february 11 2002. Held in rooms 3.15 and 3.16.
Excercises - Single subject: Mondays 18.30 - 21.15: Excercises with instructor Sune Kloppenborg Jeppesen, (jaervosz@it-c.dk). Excercises will be based on the material covered in the lecture held from 16.00 to 18.30. First time is February 4, 2002. Held in rooms 3.15 and 3.16.
Question Session: Date and time will be fixed at the last lecture, see the bottom of this plan.
Examn: 20 minutes oral examn using the danish 13-scale. More information on this in April 2002.
Main Litterature: Book: Computer Networking: A top-Down Approach Featuring the Internet by James F. Kurose and Keith W. Ross, Addison Wesley, 2001. May be bought at Samfundslitteratur, who will be at IT-C,room 1.05 on February 6 and 7 from 11.00 to 15.00.

Kan også købes i Universitetsbogladens afdeling på August Krogh Insitutet som hedder Naturfagsbogladen og som ligger på Universitetsparken lige syd for Zoologisk Museum, hvor den kan bestilles on-line og tilsendes gratis. NB: Studerende plejer at kunne få 10% kontant rabat ved personlig afhentning. NB: Bogen kan også købes hos Internet boghandlere fx www.webhut.dk, www.myboox.com, www.bokus.com, www.amazon.com. Der kan ofte spares penge, men vær opmærksom på forsendelsesomkostninger og (særligt) leveringstid.

Notes: RFC's for Network Protocols (www.faqs.org/rfcs/np.html)
Powerpoint Presentations: 1. Introduction, February 4, 2002.
2. Application Layer, Februar 11, 2002.
3. Transport Layer TCP and UDP, February 18, 2002. Blackboard & Whiteboard only, i.e. no electronic matarial.
4. Transport Layer - congestion control, February 25, 2002. No electronic material.
5. Application Programming - Java and sockets, March 4, 2002. No eletronic material.
6. Network Layer - Internet Protocol (IP), March 11, 2002. No electronic material.
7. Network Layer - Routing, March 18, 2002. No electronic material.
8. Data Link Layer - Techniques, March 25, 2002. No electronic material.
9. Data Link Layer - Examples, April 8, 2002. CSMA/CD for Ethernet.
10. Multimedia Networking, April 15, 2002. No electronic material.
11. Network Security, April 22. No electronic material.
12. Network Management, April 29. No electronic material.
Solutions to Excercises: Review Question Solutions
Problem Solutions
Pensum: To be announced in April 2002.
Lecturers: KJK: Kåre Jelling Kristoffersen (kjk@it-c.dk), Assistant Professor, IT-C

PA: Peter Anglov (peter@anglov.dk)

Instructors: Anders Ejlev, (anders@ejlev.dk)

Sune Kloppenborg Jeppesen, (jaervosz@it-c.dk)

Lecture Plan:

(Final, but please note that changes for times of lectures and excercises MAY occur.

Important: Students on Internet Technology will do the excercises SEVEN DAYS AFTER the lecture, that is, the following monday.
Students on single subject (Åben Uddannelse), will do the excercises right after the lecture.
 
No Week Date Subject Lecturer Litterature Excercises
1
6
4/2 16.00
 Introduction KJK
 
 

 

 CN 1.  CN Review 1, 2, 3, 4, 5, 10, 12, 14. CN Problems 2. CN Discussion 2.
2

7

 11/2 16.00 Application Layer - intro and examples KJK CN 2.1 - 2.3 CN 2: review 3, 4, 5, 7. CN Problems: 1, 2, 3.
3
8
 18/2 16.00 Transport Layer - TCP and UDP KJK CN 3.1 - 3.5

CN 3: Review 2, 3, 4, 5, 6. Problems 2, 3, 4, 6, 7, (9), 16, 17, 22
4
9
 25/2 16.00 Transport Layer - congestion control KJK CN 3.6 - 3.7 CN 3: Review 7. Problems  25, Discussion: 1
5
10
 4/3 16.00 Application Programming - Java and sockets. KJK CN 2.4 - 2.8  CN 2: Review 12, 14, 19, 20. Problem 7, 9. Disc 4, 5.
6
11
11/3 16.00
 Network Layer - Internet Protocol (IP) KJK CN 4.1 - 4.4 New: Link state Algorithm corrected CN 4: Review: 1, 4. Problems: 3, 4, 7, 11.
7
12
 18/3 16.00 Network Layer - routnig KJK CN 4.5 - 4.8 CN 4: Review: 10, 12, 15, 16, 17, 18, 19, 20. Problems: 9. Discussion: 2, 3.
8 13 25/3 16.00 Link Layer - techniques KJK CN 5.1 - 5.4 CN 5: Review: 1, 2, 3, 4, 5, 6, 7, 8, 10, 11. Problems: 12, 1, 2, 5. Discussion: 1, 2, 4. Use the "arp" program to find pairs of IP-addr, MAC addr on IT-C's systems.
- 14 - Easter Holiday
9 15 8/4 16.00 Linklaget - examples KJK CN 5.5 - 5.10

CN 5: Review: 10, 13, 15. Problem: 14, 16, 19 (try finding prices in DKK on the Web, e.g., thru www.edbpriser.dk). Discussion: 3, 5
10 16 15/4 16.00 Multimedia KJK CN 6 CN 6: Review: 2, 4, 5, 11. Problem: 1, 3, 4, 6, 10, 15, 16. Discussion: 5.

 
11 17 22/4 16.00

Security

 PA CN 7

CN 7: Review: 1, 3, 5, 13. Problem: 4. Discussion: 1, 2.
12 18 29/4 16.00 Presentation of examn questions

Evaluation

Network Management		 KJK CN 8 (NONE)
SP ?? ??/5-2002 10-12 Spørgetime i 2.59(?) KJK All material covered (NONE)

This course is a part of Internet Technology which is administrated by af Thomas Hildebrandt, Assistant Professor, IT-C, tlf. 38 16 88 33, hilde@it-c.dk, and also a single subject education (Åben Uddannelse) which is administrated by Jens Christian Godskesen, Associate Professor, IT-C, tlf. 38 16 88 07, jcg@it-c.dk.

 

Date of examn:

June 3-4, and June 10 2002.

Examn questions, june 2002

  1. Explain what a protocol is. Use HTTP as an example.
  2. Explain those steps a browser (and a webserserver) go through to obtain a webpage from a web address.
  3. Explain the purpose of the transport Layer including its relation to the network Layer. Explain the difference between TCP and UDP.
  4. Explain the functionality of a sliding window protocol.
  5. Explain the principles of congestion control. Use TCP congestion control as an example.
  6. Explain the difference between congestion control and flow control.
  7. Explain the difference between Link State Routing and Distance Vector Routing. You are welcome to use examples.
  8. Explain the individual fields in a TCP segment. Give detailed explanantions for the most important fields.
  9. Explain how IPv4 packets may be fragmented during the way through the network. Similarly for IPv6.
  10. Explain the difference between symmetric and assymetric encryption. Use PGP as an example.
  11. Explain the individual fields in a IPv4 packet. Give a detailed explanation for the most important fields.
  12. Explain the difference between an IPv4 packet and an IPv6 packet. Further, explain how to move from IPv4 to IPv6, including what tunneling means.
  13. Explain the difference between bit-level error detection and bit-level error correction - provide examples.
  14. Explain the difference between Slotted ALOHA and the original ALOHA. Compare to Ethernet.
  15. Explain the difference between Ethernet 802.3 LAN and IEEE 802.11 LAN.
  16. Explain the purpose of ARP and how it works. Provide examples.
  17. Explain the function of the Ethernet Protocol, especially how collisions are detected and what can be done about it.
  18. Explain the differences between a hub, a repeater a switch and a bridge.
  19. Explain the fundamental challenges in running Multimedia over the internet. Use examples.
  20. Explain how client and server use sockets to communicate. What is a TCP connection. Explain the difference between a stream oriented socket and a datagram oriented socket.

Question Session: (Spørgetime)

Monday May 27, 2002, 16:00 - 18:00 Room 0.10.

Eksamensrækkefølge (Timetables of examn):

(This is for the moment in danish - sorry for that!! For an english version please ask your best dansih friend to translate it for you!)

På eksamensdagene vil der være 3 eksaminander per time. Kort efter udløbet af afmeldingsfristen (som er 27. maj), dvs. omkring 10 dage før eksamen vil der her stå det omtrentlige eksamenstidspunktet for alle tilmeldte (skulle du mod forventning mangle på listen, så kontakt straks Kåre). Mødetid er 1 time før dette tidspunkt, dog sådan at de første tre om morgenen blot skal møde et kvarter før første eksamen. Desuden skal de første tre om eftermiddagen efter frokostpausen også blot møde et kvarter før eksamen genoptages efter frokosten. Mundtlige eksaminer kan trække ud, så vær forberedt på ventetid. Omvendt er der altid nogen, som ikke møder op, så vær forberedt på at kunne komme op op til en time før (det er bl.a. herfor mødetiden er en time før). HVIS du ikke møder op eller bliver forhindret eller syg, så kontakt straks Kåre - du må gerne ringe til mobil nr. 22 46 74 46 - 24 timer i døgnet - læg besked, hvis jeg ikke svarer.

Såfremt du har særlige ønsker til hvornår du vil op, så send e-mail til Kåre med dine ønsker, fx "helst ikke allertidligst om morgenen" eller "gerne den første eksamensdag". Jeg vil så vidt muligt imødekomme sådanne ønsker - ved tidligere eksaminer er alle sådanne ønsker stort set imødekommet. Mærk posten med subject: "EKSAMENSDATO". Jeg vil kvittere for din e-post - hvis du ikke hører fra mig indenfor få dage efter afsendelsen, da send ønsket igen - helst helt enslydende, så jeg klart kan se, at du genfremsender ønsket. Husk at skrive dit NAVN og CPR nr. i forespørgslen.

Nedenfor vil eksamensplanen kunne ses en ugestid før eksamen. Har du fået en tid, som ikke passer dig, så må du prøve at bytte med en anden. Alle bytninger SKAL meddeles skriftligt til Kåre, inden den første af de to involverede tider. De fleste ønsker har kunnet imødekommes.

HUSK HUSK HUSK spørgetime den 27. maj 2002 kl. 16-18 - lokale 0.10.

Project Proposal: Comparing Shortest Path Algorithms
Implement Dijkstra's Shortest Path algorithm and the Distance Vector shortest path algorithm in JAVA. Compare the two approaches on a number of graphs with nodes and edges which have costs. Which algorithm seems to be the best? Carry out an analysis of the complexity og the two algorithms. Send me an email (kjk@it-c.dk) or drop in at my office (2.09) if you are interested and wish to know more about this project.

Project Proposal: Network Management, Wireless LAN, Public key encryption and digital signatures.

It will be possible to do a project within the three abovementioned areas using the ressources of the IT-C LinuxLab, see LinuxLab homepage.

A (short) translation to english follows:

Network Management (Netværksovervågning): This project is about helping IT-C to find a good set of software tools for network management and network supervision. This includes (but is not limited to) trying out the tools listed (BigBrother, BigSister, etc). You can try to check out some of these tools yourself for a start.

Wireless LAN (Trådløst netværk): IT-C wish a complete coverage with wireless LAN (IEEE802.11). At this point we need to know more about the technology before buying equipment . The project could investigate the current products on the market, and seek to come up with a proposal for a solution.

Public Key Systems (Public Key Systemer): The project seek an evaluation of the possibilities for a fast and simple establishment of support for public key encryption and digital signatures in the IT-infrastructure of the IT University.

You may also contact Hanne Munkholm (hm@it-c.dk) and Keld K. Jensen (kkj@it-c.dk) from LinuxLab directly to learn more about these projects.

Timetable for Examn.:

 
Tid Mandag 3/6-2002, Room 2.63.
9.10 Fawzia Devantier
9.30 Torben Stephen Nowicki
9.50 Ali Al-Rubaie
10.20 Jens Kjær Schødt
10.40 Sadegh Eghbal
11.00 Hai Son Nguyen
11.20 Addallah Osman Mohammed
11.40 Adel Abu-Shark
13.00 Jan Bjørn Dalsgaard
13.20 Mads-Jørn Nørgaard
13.40 Kasper Juel Wolf
14.00 Saif Abduljabbar M. Al Ghanemi
14.30 Ahmed Abdellatif Karoub
14.50 Alberto Gueda
15.10 Firas Ali Aziz
15.30 Jens H. Hagemann-Petersen
16.00 An Kim Phan
16.20 Henrik B. Willumsen
16.40 Hamdy Youssef I. Y. Hassan

 
Tid Tirsdag 4/6-2002, Room 2.63.
9.10 Lone Gram Larsen
9.30 Emad El-Dean El-Akehal
9.50 Anders K. Rosengreen
10.20 Morten Kølby Pedersen
10.40 Mads Blume Dam
11.00 Jakob Vangkilde Hansen
11.20 Jan Erik Q. Højer
11.40
13.00 Rune Steen Johnsson
13.20 Kia Skouw Christensen
13.40 Nikolai Winch Kristensen
14.00 Ian Paul Realf
14.30 Jes Kromann
14.50 René Lund Jensen
15.10 Poul Mølbjerg Jeppesen
15.30 Wajiha Rehman
16.00 Ole Søren Ferling
16.20 Alkovik Rouslan
16.40 Shouket Iqbal
17.00
Tid Mandag 10/6-2002, Room 2.47.
8.50 Assi Hervé
9.10 Tina Ronæs Dreyer
9.30 Michael Lund
9.50 Lars Gyldenkærne
10.20 Michael Christoffersen
10.40 Kim Eichen
11.00 Samair Tamur Mirza
11.20 Lars Georg Bengtsson
11.40 Simon Kohrtz
13.00 Peter Ulrik Rindal
13.20 Araz Assif Kaczmarek
13.40 Nabila Mohamad Hejazi
14.00 Peter Lorentzen
14.30 Søren Haubjerg Mortensen
14.50 Mussawar Munir
15.20 Henrik Andersen
15.50 Robert K. A. Owusu
16.20 Nadeem Ahmad

 

Updates:
2002-01-24: Kåre Kristoffersen: Hjemmeside oprettet
2002-02-05: Kåre Kristoffersen: Homepage in english
2002-03-07: Kåre Kristoffersen: Temporary list of Examn questions (see above)
2002-03-11: Kåre Kristoffersen: Corrected version of linkstate algorithm, see Section 4.2.
2002-03-25: Kåre Kristoffersen: Project Proposal: Comparing Shortest Path Algorithms (see above).
2002-04-10: Kåre Kristoffersen: Project Proposals: Network Management, Wireless LAN, Public key encryption and digital signatures.
2002-04-29: Kåre Kristoffersen: Examn Questions.
2002-05-17: Kåre Kristoffersen: Information about examn in June 2002.
2002-05-28: Kåre Kristoffersen: Timetable for examn June 2002.

opdateret 2001-02-22
Autogenerated
til top