|
Personnel
Syllabus
Lecture
Slides
Labs
Homework
Textbook Slides
Academic
Integrity Policy
|
Assignments
| Assignment |
Chapters (questions from Problems section of chapters) |
Solutions |
Due Date |
Max Credit |
Mean Score |
| Homework 1 |
Ch 1: 5, 6, 7, 8, 13; Ch 2: 13, 17 |
Sol Set 1 |
2/17/06 |
50 |
41 |
| Homework 2 |
Ch 3: 10, 11, 16, 19, 20, 27, 28 |
Sol Set 2 |
3/3/06 |
50 |
46.3 |
| Homework 3 |
Ch 4: 2, 14, 18, 24, 25, 26, 29 Give a
"count-to-infinity" scenario involving three routers that
can't be solved by the poison reverse approach. |
Sol Set 3 |
4/14/06 |
50 |
46.4 |
| Homework 4 |
1) In class, we mainly focused on wide area multicast
algorithms, and ignored some interesting details like
multicast addressing and Ethernet multicast. Please do some
independent reading, and answer the following
questions:
a) What defines an IP multicast address? What is the scope
of such an
address?
b) What prevents two different IP multicast groups (or
applications) from
picking the same multicast address?
c) Ethernet is a pervasive link technology, and it has
native support for
multicast.
- Given an IP multicast address, how is the corresponding
Ethernet
multicast address determined? What is the advantage of such
an address
mapping technique?
- Discuss how IGMP works to maintain multicast group
membership in a
broadcast LAN, including Ethernet.
- Describe how an Ethernet multicast packet can be correctly
delivered to
all the subscribing interfaces without transmitting multiple
copies of
the packet.
2) (a) Describe how loops in paths can be detected in BGP.
(b) What is AS path prepending? How can it be used for the
purpose of traffic engineering?
3) K & R, Chapter 4, Problems 32, 34.
4) K & R, Chapter 5, Problems 5, 11, 13.
|
|
4/26/06 |
50 |
|
|