Skip to document
Welcome to StudocuSign in to access the best study resources
Guest user
0followers
HomeMy LibraryAsk AI
  • You don't have any recent items yet.
My Library
  • You don't have any courses yet.
  • You don't have any books yet.
  • You don't have any Studylists yet.

Week11-Review Question Answer

Week11-Review Question Answer
Course

Networking Fundamentals (41092)

238 Documents
Students shared 238 documents in this course
Academic year: 2022/2023
Uploaded by:
hj
hobo joe
University of Technology Sydney
0followers
9Uploads
0upvotes

Recommended for you

Comments

Please sign in or register to post comments.

Students also viewed

Related documents

Preview text

41092 Network Fundamentals

Week 11. Review Question

Answer

  1. Encapsulate each network-layer datagram within a link-layer frame before transmission over the link.

  2. Although each link guarantees that an IP datagram sent over the link will be received at the other end of the link without errors, it is not guaranteed that IP datagrams will arrive at the ultimate destination in the proper order. With IP, datagrams in the same TCP connection can take different routes in the network, and therefore arrive out of order. TCP is still needed to provide the receiving end of the application the byte stream in the correct order. Also, IP can lose packets due to routing loops or equipment failures.

  3. Parity checks, checksumming, CRC code.

  4. There will be a collision in the sense that while a node is transmitting it will start to receive a packet from the other node.

  5. Slotted Aloha: 1, 2 and 4 (slotted ALOHA is only partially decentralized, since it requires the clocks in all nodes to be synchronized). Token ring: 1, 2, 3, 4.

  6. After the 5 th collision, the adapter chooses from {0, 1, 2,..., 31}. The probability that it chooses 4 is 1/32. It waits 204 microseconds.

  7. Each node uses a unique code to encode the data it sends, which the corresponding receiver also needs to know. If the codes are chosen carefully, CDMA can facilitate successful transmissions between several sender/receiver pairs simultaneously.

  8. When the bits transmitted by a node A have yet to reach another node B, the latter senses the channel idle and in accordance with the CSMA protocol begins transmitting its frame. A short time later, B’s transmission begins to interfere with A’s transmission.

  9. 248 MAC addresses; 2 32 IPv4 addresses; 2 128 IPv6 addresses.

  10. C’s adapter will process the frames, but the adapter will not pass the datagrams up the protocol stack. If the LAN broadcast address is used, then C’s adapter will both process the frames and pass the datagrams up the protocol stack.

  11. Since the MAC address is 48 bits long, each chunk contains 2 24 unique addresses. Since 2 24 / 1,000,000 , the chunk will almost last for 17 years.

Kurose & Keith, Computer Networking: A Top-Down Approach, 8th Edition. Pearson

1

41092 Network Fundamentals

  1. No it is not possible. Each LAN has its own distinct set of adapters attached to it, with each adapter having a unique LAN address.

Kurose & Keith, Computer Networking: A Top-Down Approach, 8th Edition. Pearson

2

Was this document helpful?

Week11-Review Question Answer

Course: Networking Fundamentals (41092)

238 Documents
Students shared 238 documents in this course

University: University of Technology Sydney

Was this document helpful?
41092 Network Fundamentals
Week 11. Review Question
Answer
1. Encapsulate each network-layer datagram within a link-layer frame before
transmission over the link.
2. Although each link guarantees that an IP datagram sent over the link will be
received at the other end of the link without errors, it is not guaranteed that IP
datagrams will arrive at the ultimate destination in the proper order. With IP, datagrams
in the same TCP connection can take different routes in the network, and therefore
arrive out of order. TCP is still needed to provide the receiving end of the application the
byte stream in the correct order. Also, IP can lose packets due to routing loops or
equipment failures.
3. Parity checks, checksumming, CRC code.
4. There will be a collision in the sense that while a node is transmitting it will
start to receive a packet from the other node.
5. Slotted Aloha: 1, 2 and 4 (slotted ALOHA is only partially decentralized, since
it requires the clocks in all nodes to be synchronized). Token ring: 1, 2, 3, 4.
6. After the 5th collision, the adapter chooses from {0, 1, 2,…, 31}. The
probability that it chooses 4 is 1/32. It waits 204.8 microseconds.
7. Each node uses a unique code to encode the data it sends, which the
corresponding receiver also needs to know. If the codes are chosen carefully, CDMA can
facilitate successful transmissions between several sender/receiver pairs simultaneously.
8. When the bits transmitted by a node A have yet to reach another node B, the
latter senses the channel idle and in accordance with the CSMA protocol begins
transmitting its frame. A short time later, B’s transmission begins to interfere with A’s
transmission.
9. 248 MAC addresses; 232 IPv4 addresses; 2128 IPv6 addresses.
10. C’s adapter will process the frames, but the adapter will not pass the
datagrams up the protocol stack. If the LAN broadcast address is used, then C’s adapter
will both process the frames and pass the datagrams up the protocol stack.
11. Since the MAC address is 48 bits long, each chunk contains 224 unique
addresses. Since 224 / 1,000,000 , the chunk will almost last for 17 years.
Kurose & Keith, Computer Networking: A Top-Down Approach, 8th Edition. Pearson
1

Students also viewed

Related documents