1 / 10

Advanced Data Communication

Advanced Data Communication. Spring 2010, ECE 5652-41. Schedule. Fri 9:00-11:45am Room 21222. Synopsis.

len-schroeder
Download Presentation

Advanced Data Communication

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Advanced Data Communication Spring 2010, ECE 5652-41

  2. Schedule • Fri 9:00-11:45am • Room 21222

  3. Synopsis • A qualitative and quantitative study of issues in design, analysis, and operating of computer communication and telecommunication network as they evolve toward the integrated networks of the future, employing both packet and circuit-switching technology. Packet and circuit switching, the OSI standards for architecture and protocols, elementary queueing theory for performance evaluation, random access techniques, local area networks, reliability and error recovery, and integrated networks.

  4. Instructor • Dongsoo Stephen Kim • Associate Professor at Indiana University • Visiting/Research Professor at SKKU • Contacts • dskim@iupui.edu or dongsoo.s.kim@gmail.com • (031) 299-4642 • Office • Research Center II, Room 83345,

  5. Teaching Assistants • YeonjoonJeong • Contact • yjjeong83@skku.edu • 010-6778-5697 • Office Hours • TBA

  6. Textbook • Alberto Leon-Garcia and IndraWidjaja, “Communication Networks: Fundamental Concepts and Key Architecture (2nd ed.),” McGraw-Hill Higher Education, 2003, ISBN# 007246352X.

  7. Reference • Jim Pitman, “Probability,” 1999, Springer, ISBN# 0387979743. • G. Bolch, et.al. “Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications,” 2006, Wiley-Interscience, ISBN# 0471565253.

  8. Grading Policy • Exams 40% • Homework/Quiz 25% • Attendance 10% • Projects 25%

  9. Course Details • Assignments must be submitted at the beginning of the class on the due date. Late submissions will be accepted with 10% penalty per day up to 3 days. After those 3 days, late submission will not be accepted. • All exams are closed-book, closed-notes, and comprehensive to cover the material up to the point mentioned one week prior to the exam date. • You need have a computer access offered by the School or your own PC. • All submission in this class must be done individually. Anyone who copy other’swork and whose work to be copied will receive no credit for the submission. • The projects are group effort, but will be evaluated individually. Students will form a group of 5 persons. Each group submits one copy of the project report. Each team member must complete a “Peer Rating” form and submit it to the instructor confidentially.

  10. Topic Covered • Overview and introduction to communication networks and their topology • ISO/OSI 7-layer reference model, protocols and services • Digital transmission and media, Nyquist theorem, and Shannon capacity • Line coding and decoding, transmission media • Switching networks, circuit-switched, packet switching, switch architecture • Probability and queueing theory • Error detection and correction, framing, ARQ, flow control, • Multiple access, local area network, wireless LAN • SONET, WDM and circuit switching • Internet Protocol Suite, routing, and congestion control

More Related