1. Advanced Operating Systems - Spring 2009 Lecture 22 – Wednesday April 8st, 2009
Dan C. Marinescu
Office: HEC 439 B.
Office hours: M, Wd 3 – 4:30 PM.
TA: Chen Yu
Office: HEC 354.
Office hours: M, Wd – 3:00 PM.

2. Last, Current, Next Lecture
Last time:
Andrew File System
Network and Distributed Operating Systems
Multiple Access Networks
Today
Communication Networks.
Local and Wide Area Networks
Local Area Networks. Multiple access algorithms
Scheduled and non-scheduled access for Multiple Access Channels.
Aloha.
Random tree algorithm of Capetanakis.
The FCFS.
The stack algorithm.
A splitting algorithm for communication with timing constraints.
Token passing rings.
Next time:
Communication Networks

3. Network taxonomy

4. Packet switching

5. Internet growth

6. Internet core

7. Inter and Intra AS Routers

8. Internetworking

9. Multiplexing/de-multiplexing in packet-switched networks

10. Internet router

11. Integrated service router

12. Internet Protocols

13. Hourglass model of Internet architecture

14. Protocol stack

15. Sockets

16. Application requirements

17. Decisions in the Internet

18. Bandwidth and latency

19. Speed and utilization in collision based methods for multiple access

20. First Come First Served (FCFS)

21. Stack algorithm

22. Token passing ring