Có 20+ tài liệu thuộc chủ đề "bài giảng mạng máy tính"
tailieu.vn Xem trực tuyến Tải xuống
Gv : Nguyễn Văn Tẩn [email protected]. THỰ TH ỰC H C H ÀNH M À NH MẠ ẠNG M NG M Á Á Y TÍ Y T Í NH NH. Bà B ài i thự th ực c hà h ành nh 1 1. Giới thiệu kỹ thuật bấm Thực hiện bấm cáp thẳng Thực hiện bấm cáp chéo Kiểm...
tailieu.vn Xem trực tuyến Tải xuống
MẠNG MÁY TÍNH. Giới thiệu chung về mạng máy tính. Tầng liên kết dữ liệu. Mục đích của mạng máy tính:. Dùng chung các tài nguyên như thiết bị, chương trình, dữ liệu;. Tăng độ tin cậy của hệ thống nhờ khả năng thay thế khi xảy ra sự cố đối với một máy tính nào đó;. Lịch sử phát...
tailieu.vn Xem trực tuyến Tải xuống
1.4.3 Ch c n ng c a m i t ng. Ch ng 2 NG V T LÝ 16. Ch ng 3 NG LIÊN K T D LI U 22. 3.2.1 Cung c p d ch v cho t ng m ng. Ch ng 4 NG C C B 37. 4.1.3 M ng d ng vòng (Ring Topology) ...38. 4.1.4...
tailieu.vn Xem trực tuyến Tải xuống
Computer Networks:. I have learnt computer networks from some of the great teachers. You can then decide whether you want to take the course. If you stay:. What do I mean by “computer networks”?. What do computer networks do?. What do computer networks look like?. Why study computer networks?. What is this course about?. What is the course workload, grading...
tailieu.vn Xem trực tuyến Tải xuống
Sharing Networks: “Packets” and “Flows”. Why “packets” and “flows”?. propagation delay: ~0.1ms
tailieu.vn Xem trực tuyến Tải xuống
“Packets” and “Flows”. Today’s lecture is going to be one of the hardest lectures. Why “packets” and “flows”?. Getting rid of the challenges. Packet size / Transmission rate of the link. How long does it take to move one bit from one end of the link to other?. Finding a path to the destination: Routing. Sending data to the destination:...
tailieu.vn Xem trực tuyến Tải xuống
Today’s lecture is going to be one of the hardest lectures. An end-to-end view. Time taken to move one bit from one end of the link to other. Dive into end-to-end: from source to destination. First look into network stack: sockets, ports, “the stack”. First look into end-to-end. End-to-end: what mechanisms do we need?. Locating the destination: Naming, addressing. Finding...
tailieu.vn Xem trực tuyến Tải xuống
End-to-end working of the Internet. Today: Lay the foundation for rest of the course. End-to-end principle. First time I learnt these, I said — what the. Maps name of the web site to its address using DNS. Recap: the end-to-end story. End-to-End Principle. Fate-Sharing. Breakdown end-to-end functionality into tasks. Transport (L4): (Reliable) end-to-end delivery. An end-to-end view of the layers....
tailieu.vn Xem trực tuyến Tải xuống
Data Link Layer. Link Layer (~1 week). Today: Link layer. Link layer:. CSMA/CD. Point-to-point. The high-level ideas discussed so far were for point-to-point. Original design of Link layer protocols. More recent versions have moved to point-to-point. Point-to-Point vs. Point-to-point: dedicated pairwise communication. E.g., Point-to-point link between two routers. Data Link Layer: Broadcast (until ~2000s). How do we design a link-layer...
tailieu.vn Xem trực tuyến Tải xuống
Finish CSMA/CD. Spanning Tree Protocol. CSMA/CD. CSMA/CD (Collision Detection). Limits on CSMA/CD Network Length. Limits on CSMA/CD Network Length and Frame Size. CSMA/CD in one slide!. CSMA/CD (Collision Detection): An example. Performance of CSMA/CD: Why frames?. Link Layer on top of Physical Layer. If following bit is 0, this is the start of the frame. If following bit is 1,...
tailieu.vn Xem trực tuyến Tải xuống
Spanning Tree Protocol Internet Protocol. Lets get back to the graph representation!. Build spanning tree. Links not in the spanning tree are not used in forwarding frames. A Spanning Tree. Another Spanning Tree. Yet Another Spanning Tree. Spanning Tree Protocol. Protocol by which bridges construct a spanning tree. Compute the shortest paths to the root. Ethernet’s spanning tree construction does...
tailieu.vn Xem trực tuyến Tải xuống
Spanning Tree Protocol Fundamentals of Rou:ng Spring 2018. Quick Review: Spanning Tree Protocol (+Failures). Why not just use spanning tree protocol?. Recap: Spanning Tree Protocol (failures on later slides). Lets run the Spanning Tree Protocol on this example. After Round 5: We have our Spanning Tree. Spanning Tree Protocol. New spanning tree!. Step 1: Ignore the links not belonging to...
tailieu.vn Xem trực tuyến Tải xuống
Link State (Global view). Distance Vector (Local view). advertising a distance d to Y. Add 1 to the shortest distance received from a neighbor. If root changed OR shortest distance to the root changed, send all neighbors updated message (Y,d+1,X). No routing tables needed!. Recap: Routing via Routing Tables. Routing state: collection of routing tables across all nodes. Recap: Routing...
tailieu.vn Xem trực tuyến Tải xuống
Distance Vector Rou2ng. Distance Vector (Local view). E.g., Distance vector. advertising a distance d to Y. If root changed OR shortest distance to the root changed, send all neighbors updated message (Y,d+1,X). Distance-vector: just the distance (and next hop) to each destination. We will focus on distance-vector for now. Towards Distance Vector Protocol (with no failures). If current_distance_to_Y >. update...
tailieu.vn Xem trực tuyến Tải xuống
Must be done quickly (nano seconds). Nontrivial part: packet “header”. Get the packet to the destination. Get responses to the packet back to source. Tell host what to do with the packet once arrived. Specify any special network handling of the packet. Where the the packet end?. Getting to the Destination. And what’s the difference?. How would the source know...
tailieu.vn Xem trực tuyến Tải xuống
Continue with design of THE Internet Protocol (IP). Unique identifiers hardcoded in the hardware. Puts destination’s and its own MAC address in the header. Must use MAC address as part of the address. Assign each end-host an addresses of the form — Switch:MAC. Puts destination’s and its own Switch:MAC address in the header. Switches forward the packet using first part...
tailieu.vn Xem trực tuyến Tải xuống
“Border Routers”. AS A can be AS B’s provider. AS A can be AS B’s peer. “best” route it hears advertised for a prefix. “d: path (B,A)” “d: path (A)”. “d: path (2,1)” “d: path (1)”. What Does “speak BGP” Mean?. Specifies what messages to exchange with other BGP “speakers”. Route Attributes. Route Attributes (3. 1 advertises its path 1...
tailieu.vn Xem trực tuyến Tải xuống
Longest Prefix match (scalability). Longest Prefix match. Find the entry with matching “longest prefix” with destination address. Longest Prefix Match. Longest Prefix Match in Real Routers. Longest prefix match lookup on destinations address (harder). Longest Prefix Matching. Longest prefix matching
tailieu.vn Xem trực tuyến Tải xuống
E.g., www.cnn.com. Need to convert name (e.g., www.cnn.com) to an IP address. User asks DNS: what is the IP address for www.cnn.com. Move www.cnn.com to . www.cnn.com to multiple replicas to the Web site. E.g., www.cnn.com and cnn.com should map to same IP addresses. Hierarchical Infrastructure: hierarchy of DNS servers. .edu, cornell.edu, cs.cornell.edu. systems.cs.cornell.edu. Cornell controls *.cornell.edu. CS controls *.cs.cornell.edu....
tailieu.vn Xem trực tuyến Tải xuống
Using core’s IP address. Network Security. My definition of “network security”. “network security