CIS 777 Telecommunications NetworksSlide Number 2Slide Number 3GradingFrequently Asked QuestionsText BookSupplementary TextsPrerequisite: CIS677Prerequisites (Cont)Schedule (Tentative)Schedule (Cont)Office HoursSummaryQuiz 0: PrerequisitesHomework 1Homework 1 (Cont)Homework 2Homework 2 (Cont)Raj JainThe Ohio State University1CIS 777CIS 777 Telecommunications Telecommunications NetworksNetworksRaj Jain The Ohio State University Columbus, OH 43210 [email protected] slides are available at:http://www.cse.ohio-state.edu/~jain/cis777-99/Raj JainThe Ohio State University2 How  What When WhyOverviewRaj JainThe Ohio State University3 How am I going to grade you? What are we going to cover? When are you going to do it?  Why you should not take this course?OverviewRaj JainThe Ohio State University4GradingGrading Quizzes (Best 2 of 3) 50% Class participation 10% Homeworks+Labs 40%  The division of grades between homeworks and labs will depend on the number of labs Most likely it will be 20% for homeworks and 20% for labs.Raj JainThe Ohio State University5Frequently Asked QuestionsFrequently Asked Questions Yes, I do use “curve”. Your grade depends upon the performance of the rest of the class. All homeworks are due at the beginning of the next class. All late submissions must be preapproved. All quizes are open-book and extremely time limited. Quizes consist of numerical as well as multiple-choice (true-false) questions. There is negative grading on incorrect multiple-choice questions. Everyone including the graduating seniors are graded the same way.Raj JainThe Ohio State University6Text BookText Book U. Black, "Emerging Communications Technologies," Prentice-Hall, 2nd Ed, 1997, ISBN 0-13-742834-0, 458 pp. G. Sackett and C. Y. Metz, “ATM and Multiprotocol Networking,” McGraw-Hill, 1997, ISBN 0-07-057724-2, 342 pp.Raj JainThe Ohio State University7Supplementary TextsSupplementary Texts W. Stallings, "ISDN and Broadband ISDN with Frame Relay and ATM," 3rd Ed., Prentice-Hall, 1995, ISBN 0-02-415513-6, 581 pp.  H. J. R. Dutton and P. Lenhard, "Asynchronous Transfer Mode (ATM): Technical Overview," 2nd Ed, Prentice-Hall, 1995, ISBN 0-13-520446-1. B. Dorling, et al, “Internetworking over ATM,” Prentice-Hall, 1996.Raj JainThe Ohio State University8Prerequisite: CIS677Prerequisite: CIS677 Protocol Layers: ISO/OSI reference model Physical Layer: Coding, Manchester Transmission Media: UTP, Cat 5, Microwave, Radio Data Communication: Asynchronous vs synchronous, Baud, bit, and Hz, Half-Duplex vs Full-duplex, Modulation/Demodulation Packet Transmissions: Framing, Bit stuffing, byte stuffing Flow Control: On-Off, Window Error Detection: Parity, Checksum, Cyclic Redundancy CheckRaj JainThe Ohio State University9Prerequisites (Cont)Prerequisites (Cont) Error Recovery: Start and Stop, Go back n, Selective Reject LANs: Aloha, CSMA/CD, Ethernet, IEEE 802.3, Token Ring/IEEE 802.5, FDDI LAN Addressing: Unicast vs multicast, Local vs Global LAN wiring: 10Base5, 10Base2, 10Base-T, 100Base- T4, 100Base-TX, 100Base-FX Extended LANs: Hubs, Bridges, Routers, Switches Routing: Distance Vector vs Link State, Spanning tree, source routing Network Layer: Connectionless vs connection orientedRaj JainThe Ohio State University10Schedule (Tentative)Schedule (Tentative)3/30/99 Overview4/1/99 A Review of Networking Concepts4/6/99 Fundamentals of Telecommunications4/8/99 X.254/13/99 Frame Relay4/15/99 Quiz 14/20/99 Frame Relay Congestion Control4/22/99 ISDN4/27/99 SONETRaj JainThe Ohio State University11Schedule (Cont)Schedule (Cont)4/29/99 Introduction to ATM5/4/99 ATM Traffic Management5/6/99 Quiz 25/11/99 IP Over ATM5/13/99 PNNI: Routing in ATM Networks5/18/99 ATM Signaling5/20/99 Wireless Data Networking 15/25/99 Wireless Data Networking 25/27/99 Quiz 36/1/99 Graduating Seniors’ grades dueRaj JainThe Ohio State University12Office HoursOffice Hours Tuesday: 2:00 to 2:30 PM Thursday: 2:00 to 2:30 PM Office: 297 Dreese Lab, 2015 Neil Ave GTA: Arian Durresi, DL299 [email protected] MWF 11:30-12:30Raj JainThe Ohio State University13SummarySummary There will be a lot of self-reading Goal: To prepare you for a career in networking Get ready to work hardRaj JainThe Ohio State University14Quiz 0: PrerequisitesQuiz 0: PrerequisitesTrue or False?T FDatalink refers to the 2nd layer in the ISO/OSI reference modelCategory 5 unshielded twisted pair cable is better than category 3 cable.Finding path from one node to another in a large network is a transport layer function.It is impossible to send 3000 bits/second through a wire which has a bandwidth of 1000 Hz.Bit stuffing is used so that characters used for framing do not occur in the data part of the frame.For long delay paths, on-off flow control is better than window flow control.Ethernet uses a CSMA/CD access method.10Base2 runs at 2 Mbps.The packets sent in a connection-oriented network are called datagrams.Spanning tree algorithm is used to find a loop free path in a network. Marks = Correct Answers _____ - Incorrect Answers _____ = ______Raj JainThe Ohio State University15Homework 1Homework 1 From Tanenbaum’s book, review sections 1.2, 1.3, 1.4, 2.1, 2.2, 2.3, 3.1, 3.2, 3.3, 3.4, 3.6.1or  From Stallings’ book, review sections 1.4, 15.2, 15.3, 2.3, 3.1, 4.1, 6.1-6.4, 9.2 Submit answers to exercises on the next slide Due Date: Tuesday, April 6, 1999.Raj JainThe Ohio State University16Homework 1 (Cont)Homework 1 (Cont) A system has n layer protocol hierarchy. Applications generated messages of length M bytes. At each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled with headers.  If the bit string 011101111101111110 is bit stuffed, what is the output string (on wire). Two stations communicate via a 1-Mbps satellite link with a propagation delay of 270 ms. Using HDLC frames of 1024 bits with 3-bit sequence numbers, what is the maximum possible data throughput (excluding the overhead bits)?Raj JainThe Ohio State University17Homework 2Homework 2 From Tanenbaum’s book, review sections 4.3, 4.4, 4.5, 5.2, 5.5.1, 5.5.2, 5.5.3, 6.4or  From Stallings’ book, review sections 12.1-12.4, 13.1, 13.2, 14.1, 14.2, 15.3, 16.3, 17.3,