In this course, we deal with the general issues regarding packet switching networks. We discuss packet networks from two perspectives. One perspective involves external view of the network, and is concerned with services that the network provides to the transport layer that operates above it at the end systems. The second perspective is concerned with the internal operation of a network, including approaches directing information across the network, addressing and routing procedures, as well as congestion control inside the network.
제공자:
About this Course
최근 조회 8,304회
100% 온라인
지금 바로 시작해 나만의 일정에 따라 학습을 진행하세요.
다음 전문 분야의 4개 강좌 중 3번째 강좌:
유동적 마감일
일정에 따라 마감일을 재설정합니다.
중급 단계
완료하는 데 약 6시간 필요
권장: 5 weeks of study, 2-5 hours/week
영어
자막: 영어
강의 계획 - 이 강좌에서 배울 내용
완료하는 데 4시간 필요
Frame Switching and Packet Switching
This module introduces LAN bridges and data link layer switching, and then focuses on packet switching at the network layer. It discusses datagram, one basic packet switching approaches.
완료하는 데 4시간 필요
4개 동영상 (총 21분), 5 readings, 2 quizzes
4개의 동영상
Welcome2m
Bridges and Data Link Layer Switching6m
Network Layer Services and Topology6m
Packet Switching: Datagrams5m
5개의 읽기 자료
Reference Books10m
Lecture Slide - Bridges and Data Link Layer Switching30m
Lecture Slide - Network Layer Services and Topology30m
Lecture Slide - Packet Switching: Datagrams30m
End-to-end argument in system design (Required)1h
2개 연습문제
Practice Assessment - Frame Switching and Packet Switching20m
Graded Assessment - Frame Switching and Packet Switching20m
완료하는 데 5시간 필요
Routing in Packet Networks
This module examines the other basic packet switching approach - virtual circuit, introduces basic approaches for selecting routes across the network, discusses the Bellman-ford algorithm for distance vector based shortest path routing.
완료하는 데 5시간 필요
3개 동영상 (총 18분), 4 readings, 2 quizzes
3개의 동영상
Routing in Packet Networks6m
Shortest Path Routing- Distance Vector5m
4개의 읽기 자료
Lecture Slide - Packet Switching: Virtual Circuits30m
Lecture Slide - Routing in Packet Networks30m
Lecture Slide - Shortest Path Routing: Distance Vector30m
The Network Layer (Required)2h
2개 연습문제
Practice Assessment - Routing in Packet Networks16m
Graded Assessment - Routing in Packet Networks20m
완료하는 데 3시간 필요
Shortest-Path Routing
This module introduces the link state routing, examines the Dijkstra algorithm for shortest-path routing, and discusses the applications of the distance vector and link state routing in real Internet protocols.
완료하는 데 3시간 필요
4개 동영상 (총 22분), 4 readings, 2 quizzes
4개의 동영상
Dijkstra Algorithm4m
Link State Routing, ATM Networks5m
RIP and OSPF6m
4개의 읽기 자료
Lecture Slide - Shortest Path Routing- Link State30m
Lecture Slide - Dijkstra Algorithm30m
Lecture Slide - Link State Routing, ATM Networks30m
Lecture Slide - RIP and OSPF30m
2개 연습문제
Practice Assessment - Shortest-Path Routing20m
Graded Assessment - Shortest-Path Routing20m
완료하는 데 4시간 필요
Traffic Management
This module discusses packet-level traffic management operating in a short time scale, continues with traffic management at the flow level operating in a medium time scale. Common approaches including scheduling, queuing, admission control, and congestion control are discussed.
완료하는 데 4시간 필요
4개 동영상 (총 24분), 5 readings, 2 quizzes
4개의 동영상
Packet level – Fair Queueing and RED6m
Flow level – Leaky Bucket Policing6m
Traffic Shaping by Token Bucket5m
5개의 읽기 자료
Lecture Slide - Packet level: Scheduling and QoS30m
Lecture Slide - Packet level: Fair Queueing and RED30m
Lecture Slide - Flow level: Leaky Bucket Policing30m
Lecture Slide - Traffic Shaping by Token Bucket30m
Random early detection gateways for congestion avoidance30m
2개 연습문제
Practice Assessment - Traffic Management30m
Graded Assessment - Traffic Management30m
콜로라도 대학교 정보
The University of Colorado is a recognized leader in higher education on the national and global stage. We collaborate to meet the diverse needs of our students and communities. We promote innovation, encourage discovery and support the extension of knowledge in ways unique to the state of Colorado and beyond.
Computer Communications 전문 분야 정보
This specialization is developed for seniors and fresh graduate students to understand fundamental network architecture concepts and their impacts on cyber security, to develop skills and techniques required for network protocol design, and prepare for a future of constant change through exposure to network design alternatives. Students will require a prior knowledge of C programming, an understanding of math probability and a computer science background is a plus.
자주 묻는 질문
강의 및 과제를 언제 이용할 수 있게 되나요?
강좌에 등록하면 바로 모든 비디오, 테스트 및 프로그래밍 과제(해당하는 경우)에 접근할 수 있습니다. 상호 첨삭 과제는 이 세션이 시작된 경우에만 제출하고 검토할 수 있습니다. 강좌를 구매하지 않고 살펴보기만 하면 특정 과제에 접근하지 못할 수 있습니다.
이 전문 분야를 구독하면 무엇을 이용할 수 있나요?
강좌를 등록하면 전문 분야의 모든 강좌에 접근할 수 있고 강좌를 완료하면 수료증을 취득할 수 있습니다. 전자 수료증이 성취도 페이지에 추가되며 해당 페이지에서 수료증을 인쇄하거나 LinkedIn 프로필에 수료증을 추가할 수 있습니다. 강좌 내용만 읽고 살펴보려면 해당 강좌를 무료로 청강할 수 있습니다.
환불 규정은 어떻게 되나요?
재정 지원을 받을 수 있나요?
궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.
