Vladimir Sukonnik
sukonnik@bu.edu
Boston University Metropolitan College
Computer Science Department
1-617-353-2566
Boston, MA
CS 635 Local Area Networks Spring 1999
Important Dates: (Check This Area Weekly - class cancellations will be posted here)
- Syllabus
- Errata File
Lecture Notes
- Introduction
- Protocol Architecture
- Logical Link Control
- HDLC
- CSMA/CD (Ethernet)
- Token Ring
- Token Bus
- FDDI
- Fibre Channel
- ATM
- Wireless
Homework
- Homework 1, read chapters 1,2 do Problem
- Homework 2, Read "An Introduction to Local
Area Networks", by David Clark, Ken Pogran, David Reed, Proceedings of the IEEE, Vol
66, No 11, November 1978
- Homework 3, Read chapter 3 do Problems: 1.3, 2.4, 3.1, 3.3;
- Homework 4, read chapter 5, do problems 5.2,5.4,5.7; Additional
Reading: Read about HDLC protocol either in Uyless Black, chapter 6 (on reserve) or
Tanenbaum Chapter 3.6.
- Homework 5, read chapter 6, do problem 6.2 Additional Reading "Ethernet: Distributed Packet Switching for Local Computer
Networks", Robert Metcalf, David Boggs, CACM, July 1976 Volume 19, Number 7, pp.
395-403, also reprinted in CACM January 1983, Volume 26, Number 1, pp90-95. Available on
reserve. (Hint: To answer this question you need to find out two things: 1) How
big is your slot (in seconds) and 2) How fast does a station need to pump the data out to
fill the slot as it flies by
- Homework 6, read chapter 8, do problems 6.8,8.2
- Homework 7, read chapter 10, do problems 10.1, 10.5. Additional Reading
"Measured
Capacity of an Ethernet"
- Homework 8. Consider an FDDI network with both synchronous and
asynchronous traffic. Prove that TRT <= 2xTTRT. Please provide convising demonstration.
- Homework 9. In FDDI ring, the station that initiates the claim
token process places the value of TTRT into the claim frame. Each station examines that
frame and either replaces it with the lower TTRT or seizes to send token frames (see
lecture 5-2 for more detail). Research and find out how this algorithm works in practice
and how a station figures out what value to put into the frame. Read "R. Jain, "Performance Analysis of FDDI Token Ring
Networks: Effect of Parameters and Guidelines for Setting TTRT," IEEE Lightwave
Telecommunication Systems, vol 20, no 2, May 1991"
- Homework 10. Read chapter 9 and papers on Fibre Channel Association
home page, do problems 9.1 and 9.2
- Homework 11. Read chapter 10, do problem 10.3.
- Homework 12. "A new virtual circuit is being set up in an ATM
network. Between the source and destination hosts klie three ATM switches. How many
messages (including acknowledgements) will be sent to establish the circuit?"
- Homework 13. Chapter 10, problem 10.4 - Due April 21, 1999
- Homework 14. Chapter 11, problems 11.4 and 11.5 - Due April 28, 1999
(send it electronically since there is no class)
- Homework 15. Chapter 12, problems 12.1, 12.2 - Due May 5, 1999
Technologies
- ATM Bookmarks and Tutorials
- Long list of ATM related sites
- Raj Jain's web site
- References to ATM and FDDI papers and books by a leading researcher
- Introduction to Distributed Queue Data Bus
- Brief description of DQDB technology
- DQDB Physical Layer
- High-level description of DQDB's Physical Layer
- Simulation study of DQDB
- Research Project of the Design and Implementation of a Distributed Queue Dual Bus
Network
- Digital Technical Journal: FDDI
- A number of articles about FDDI from DTJ: vol 3. no. 2
- Fibre Channel
Association
Computer Networks Track
- CS 535: Introduction to Computer Networks
- Syllabus, homework assignments, books, papers
-