6.3B-4. Multiple Access protocols (4). Consider the figure below, which shows the arrival of 6 messages for transmission at different multiple access wireless nodes at times t=0.1, 0.8, 1.35, 2.6, 3.9, 4.2. Each transmission requires exactly one time unit. t=0.0 1 U U 1 2 3 4 Again consider the CSMA protocol (without collision detection), indicate those packets where the channel is sensed busy and therefore, under CSMA, that message transmission is not attempted. [Again, you should assume that it takes .2 time units for a signal to propagate from one node to each of the other nodes. You can assume that if a packet experiences a collision or senses the channel busy and that that node will not attempt a retransmission of that packet until sometime after t=5. Hint: consider propagation times carefully here]. 5 23 6 t=1.0 t=2.0 t-3.0 5 6 t=4.0 t=5.0

6.3B-4. Multiple Access protocols (4). Consider the figure below, which shows the arrival of 6 messages for transmission at different multiple access wireless nodes at times t=0.1, 0.8, 1.35, 2.6, 3.9, 4.2. Each transmission requires exactly one time unit. t=0.0 1 U U 1 2 3 4 Again consider the CSMA protocol (without collision detection), indicate those packets where the channel is sensed busy and therefore, under CSMA, that message transmission is not attempted. [Again, you should assume that it takes .2 time units for a signal to propagate from one node to each of the other nodes. You can assume that if a packet experiences a collision or senses the channel busy and that that node will not attempt a retransmission of that packet until sometime after t=5. Hint: consider propagation times carefully here]. 5 23 6 t=1.0 t=2.0 t-3.0 5 6 t=4.0 t=5.0

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Can someone help me with this question please? ASAP??!!! 6. Consider a packet of length L which begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let di, si, and Ri denote the length, propagation speed, and the transmission rate of link i, for i = 1, 2, 3. The packet switch delays each packet by dproc. a. Assuming no queuing delays, in terms of di, si, Ri, (i = 1,2,3), and L, what is the total end-to-end delay for the packet? (10 Points) b. Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5×108 m/s, the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? (15 Points)
Using 130.42.0.0/16, I want to create a subnetting scheme that will allow 12 subnets each of which should support up to 500 IP addresses. Given that the number of bits needed for the subnetting scheme, what will be the subnet mask for the subnets?
a) Answer the questions below with reference to the Layered Model (max 300 words): i) Explain what a communication protocol is and why it is necessary in computer networks. ii) Explain Internet packet encapsulation AND use a unique example of your own to exemplify encapsulation. iii) Discuss different example scenarios where error detection and error correction at layer 2 is necessary and when it is not. iv) What will the Frame Check Sequence (FCS) field hold when an Internet Checksum is computed for the following hexadecimal data unit: 42 43 44 45 46 47 ?
Consider the following diagram: A,B,C and D are subnets, R1, R2, and R3 are routers. Default signifies theentire rest of the internet. All 4 subnets each contain the same number of hosts.Consider the following routing table at R3: CIDR Mask Link 0.0.0.0/0 L4 128.4.6.0/24 L3 128.4.8.0/24 L5 1. If 128.4.6.0 is in A, what is the routing table at R1? 2. The ISP that owns all these networks is short on IP addresses, so theyuse a NAT router for R2. How many public IP addresses will C andD use together assuming they use as many private 10.X IP addresses asthey can? How many total public IP addresses will be used by the entirenetwork? Why doesn’t the ISP care about how many private IP addressesare used? 3. Fix R3’s routing table now that we are using NAT: 4. A node in C is given the IP address 10.0.0.1 and only sends and receivespackets on port 1234. A packet destined for this node reaches R2 witha source of (IP=128.4.6.6, Port=3000) and destination of (IP=128.4.8.0,Port=10000).…
please answer with proper explanation and step by step solution. Question: Consider a fictional six-layer protocol hierarchy where layer 1 is the lowest layer, and layer 6 is the highest layer. Therefore, an application sends a message M by passing it to layer 6. All the even-numbered layers attach a trailer Ti (i = 2, 4, 6) to their payload, and all the odd-numbered layers attach a header Hi (i = 1, 3, 5) to their payload. Draw the headers, trailers, and original message M in the order they are sent out.
Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100,000 bits long, and packets containing only control (e.g., ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer
q no 5: In the above network diagram, IP and MAC addresses are given for network nodes. Suppose Host1 (Shahid) sends a datagram to Host2 (Khalid). What IP and MAC addresses (source and destination) will be written in IP and Data link layer headers respectively, for the following intermediate points from Host1 to Host2? Host1 to Router1 (R1) Router1 to Router2 (R2) Router2 to Host2
Consider a scenario in which Host A and Host B want to send messages to Host C. Hosts A and C are connected by a channel that can lose and corrupt (but not reorder) messages. Hosts B and C are connected by another channel (independent of the channel connecting A and C) with the same properties. The transport layer at Host C should alternate in delivering messages from A and B to the layer above (that is, it should first deliver the data from a packet from A, then the data from a packet from B, and so on). Design a stop-and-wait-like error-control protocol for reliably transferring packets from A and B to C, with alternating delivery at C as described above. Give FSM descriptions of A and C.
1.4.12.2 End-to-end Delay. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps (i.e., 100 x 106 bits per second), and each packet is 1 Mbit (106 bits) in size. Assume that the propagation delay is 1 msec per link. What is the end-to-end delay of a packet from when it first begins transmission at the sender, until it is received in full by the server at the end of the rightmost link. Assume store-and forward packet transmission. You can assume the queueing delay is zero. Answer choices: A. 2 x 106 msec b. 2.01 msec C. 1.1 msec D. 2.02 msec 1.4.12.3 Maximum Throughput. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps Assume that the link R2 is fairly shared (as we've seen is done via TCP) between the two sessions. What is the maximum end-to-end throughput achieve by each session, assuming both sessions are sending at the maximum rate possible? Answer choices:…
3.1 An end device was given the IP address of 198.168.4.35/28. Consider this address and indicate: 3.1.1 The network ID/address to which the host belongs. 3.1.2 The network broadcast address to which the host belongs. 3.1.3 The total number of hosts available in the network. 3.1.4 The total number of networks. 3.2 Consider two neighbours, Alice and Bob. Each have wireless IPv4 routers with integrated NAT. Each neighbour connects their laptop to their own wireless router, and each uses appropriate utilities to examine the IP address of each laptop. They realise the laptops have the same IP address. 3.2.1 How is that possible? 3.2.2 Justify one reason that wide-spread deployment of IPv6 would remove the need for the NAT devices.
Q15: Assume a given institution with three main departments (sub-nets), which uses class B IP addresses. Department A (around214hosts ), departmentB( around26Hosts), andC( around 100 hosts ). Give the subnet mask for each departments in order to make a good utilization of the addressing space.
Answer the questions below with reference to Data Link Layer (max 250 words): i) A local Area Network (LAN) Medium Access Control (MAC) protocol aims to achieve fair and efficient access to a LAN transmission medium. Characterise the distinction between authorisation based (“taking turns”) and contention based (random access) MAC layer protocols and discuss the suitability of each protocol in light traffic and heavy traffic networks in terms of fairness and efficiency of access. ii) In CSMA/CD, after the fifth collision, what is the probability that a node chooses k=4. The result k=4 corresponds to a delay of how many seconds on a 10Mbps Ethernet?