0% found this document useful (0 votes)
123 views2 pages

Effective Data Rate in CSMA/CD LAN

Uploaded by

2021ucp1377
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
123 views2 pages

Effective Data Rate in CSMA/CD LAN

Uploaded by

2021ucp1377
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Assignment – II

Due date: 30/11/2023

1. For each one of the following subnet addresses, give an example of an IP address that can be
assigned to that subnet, and one that can not
subnet IP address IP address in subnet outside subnet
[Link]/16
[Link]/30
[Link]/25
[Link]/16
[Link]/16
[Link]/28
[Link]/8
[Link]/12
[Link]/24
[Link]/18

2. Router has output interfaces with a buffer (queue) that can hold up to 64 packets and with links
each capable of transmitting up to 10000 packets per second. The router has 4 input interfaces,
each one receiving an average of 6000 packets per second. Suppose that at some point, and for
a long period of time, all traffic happens to be forwarded to the same output interface.
a. Assuming that both input ports and switch fabric are capable of handling the input flow, is
the router congested during this period? If so, what is the probability that a packet be
dropped? Assume the router uses a “drop-tail” policy. Justify your answer.
b. Assume that each input port is capable of receiving and processing 10000 packets per
second, and that the switching fabric can process 20000 packets per second. Assume also
that the router processes packets in a first-come first-served manner. What is he expected
latency during this period? Justify your answer.
3. The minimal size of an Ethernet packet is 64 bytes (header plus payload). Explain the need for
a minimal-size requirement, as well as the specific value of 64 bytes. In your explanation,
assume that the maximum length of an Ethernet segment is 2500 meters, possibly including
multiple sub-segments connected by repeaters, that the round-trip delay is 51μs, and that the
transmission speed is 10Mbit/s, as in the 10BASE5 version of the Ethernet standard.
4. A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/μsec.
Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of
header, checksum, and other overhead. The first bit slot after a successful transmission is
reserved for the receiver to capture the channel in order to send a 32-bit acknowledgement
frame. What is the effective data rate, excluding overhead, assuming that there are no
collisions?
5. A group of N stations share a 56-kbps pure ALOHA channel. Each station outputs a 1000-bit
frame on average once every 100 sec, even if the previous one has not yet been sent (e.g., the
stations can buffer outgoing frames). What is the maximum value of N?
6. A computer on a 6-Mbps network is regulated by a token bucket. The token bucket is filled at
a rate of 1 Mbps. It is initially filled to capacity with 8 megabits. How long can the computer
transmit at the full 6 Mbps?
7. Suppose you purchase a wireless router and connect it to your cable modem. Also suppose that
your ISP dynamically assigns your connected device (that is, your wireless router) one IP
address. Also suppose that you have five PCs at home that use 802.11 to wirelessly connect to
your wireless router. How are IP addresses assigned to the five PCs? Does the wireless router
use NAT? Why or why not?
8. Consider again the SDN OpenFlow network shown in Figure 4.30. Suppose that the desired
forwarding behaviour for datagrams arriving from hosts h3 or h4 at s2 is as follows:
• Any datagrams arriving from host h3 and destined for h1, h2, h5 or h6 should be
forwarded in a clockwise direction in the network;
• Any datagrams arriving from host h4 and destined for h1, h2, h5 or h6 should be
forwarded in a counter-clockwise direction in the network.

9. Consider the following AS-level topology and the given allocation of addresses in the above
figure. Write all the BGP route advertisements produced by each one of the autonomous
systems. For each advertisement write only destination and AS path. Assume that autonomous
systems are always willing to accept and forward route advertisements. (Hint: remember that
addresses should be combined in router advertisements.)
10. Suppose nodes A and B are on the same 12 Mbps broadcast channel, and the propagation delay
between the two nodes is 316 bit times. Suppose CSMA/CD and Ethernet packets are used for
this broadcast channel. Suppose node A begins transmitting a frame and, before it finishes, node
B begins transmitting a frame. Can A finish transmitting before it detects that B has transmitted?
Why or why not? If the answer is yes, then A incorrectly believes that its frame was successful
transmitted without a collision. Hint: Suppose at time t = 0 bits, A begins transmitting a frame.
In the worst case, A transmits a minimum-sized frame of 512 + 64 bit times. So A would finish
transmitting the frame at t = 512 + 64 bit times. Thus, the answer is no, if B’s signal reaches A
before bit time t = 512 + 64 bits. In the worst case, when does B’s signal reach A?

Common questions

Powered by AI

Using SDN for distinct paths enhances traffic management and minimizes conflict between flows. If datagrams from host h3 are directed clockwise and those from h4 are counter-clockwise, it prevents potential collision zones, optimizes path utilization, and ensures balanced load across the network. This reduces congestion and allows for predictable traffic patterns, enhancing overall network reliability and agility .

The effective data rate is calculated by subtracting the overhead from the total data transmission capacity. With a propagation speed of 200 m/μsec and a frame length of 256 bits, 32 bits are overhead. Thus, the net data is 224 bits per frame. The channel's bit time is derived from its length and speed, resulting in a high utilization ratio in the absence of collisions. Assuming no collisions, the remaining 224 bits of useful data constitute the effective throughput: (224/256) * 10 Mbps = 8.75 Mbps .

The router's input bandwidth cumulatively (6000 packets/second across 4 interfaces) exceeds the output bandwidth (10000 packets/second). A 'drop-tail' policy means packets arriving when the buffer is full are dropped. Given the buffer can hold 64 packets, the rate of arrival surpasses processing ability (24,000 packets per second in, 10,000 out) leading to a consistent overfilling of the buffer. Thus, the probability of dropping packets is effectively 1, as the circumstances guarantee a full queue frequently .

In CSMA/CD, if node A begins transmitting at t = 0, for a no-collision scenario, node B must detect A's transmission faster than its own transmit start. Given a minimum frame is 576 bits (512 + 64), A finishes at 576 bits time. B's signal must reach A before then to acknowledge collision. If propagation delay exceeds this time frame, a collision-free transmission is falsely presumed, compromising network integrity. As B's delay is defined by a 316-bit time, and A's transmission finishes by 576, B's signal will reach A in time to recognize and handle the collision, preventing completion of A's transmission error-free .

In a setup where an ISP dynamically assigns a single IP address for a home router, NAT allows multiple devices to share this IP address by translating private local network addresses to the single public address. The router assigns private IP addresses to each connected PC, facilitating independent network access while using NAT to manage outgoing and incoming traffic. NAT ensures all devices can access the Internet under one public IP, supporting network address sharing and enhancing security .

In a CSMA/CD network, the absence of repeaters limits the network to shorter distances due to signal attenuation over long cables, resulting in reduced transmission power and increased collision instances. This diminishes effective throughput since signals might not propagate reliably across long spans, thus necessitating smaller network segments to maintain collision efficiency. As data without repeaters is not amplified, the risk of collision escalates with distance, thus affecting the data rate adversely, despite hardware capability .

The token bucket regulates data transmission by controlling the amount of data that can be sent. Initially filled with 8 megabits and refilled at 1 Mbps, the computer can transmit at the full 6 Mbps until the bucket depletes. Given the initial capacity and refill rate, the duration for uninterrupted full-speed transmission is the time taken to consume the initial tokens at 5 Mbps (6 Mbps transmission rate minus 1 Mbps refill rate): 8 megabits / (6 - 1) Mbps = 1.6 seconds .

Under pure ALOHA, the maximum throughput is 18.4% of the channel capacity. Given a frame is 1000 bits and sent once every 100 seconds, each station effectively uses 10 bps of bandwidth. Thus, to support N stations, N*10 bps ≤ 56 kbps * 18.4% needs to be satisfied. This equates to N ≤ (56 * 0.184)/0.01 ≈ 104 stations, accounting for both channel limitation and ALOHA efficiency factors .

Router congestion occurs when the demand for data transfer on an output interface exceeds its capacity, causing packet queueing and potential packet loss. In the scenario described, the router's output interface transmits up to 10,000 packets per second, while 4 input interfaces each receive 6,000 packets per second, summing up to 24,000 incoming packets per second. Since the switching fabric can only handle 20,000 packets per second, but not 24,000, the router becomes congested. Under a 'drop-tail' policy, any incoming packet that finds a full buffer is dropped. Given the probability of packet arrival in excess of capacity, congestion is certain .

The 64-byte minimum size ensures collision detection can occur before transmission of the entire frame ends in a 10 Mbps classic Ethernet. With a maximum segment length of 2500 meters and a round-trip delay of 51 microseconds, a smaller frame might finish transmitting before a collision can be detected by all involved, hampering effective collision handling. In this setup, the time to send a 64-byte packet matches the round-trip delay time for collision detection, ensuring efficiency and reliability .

You might also like