Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
onstant length L-KRS, where K is the transmission rate of the channel and k is a large integer. Suppose there odes, each with an infinite number of frames to send. We also assume that dprop < S, so that all nodes can de ollision before the end of a slot time. The protocol is as follows: If, for a given slot, no node has possession hannel, all nodes contend for the channel; in particular, each node transmits in the slot with probability p. If ex ne node transmits in the slot, that node takes possession of the channel for the subsequent k1 slots and transm ntire frame. If some node has possession of the channel, all other nodes refrain from transmitting until the nod ossesses the channel has finished transmitting its frame. Once this node has transmitted its frame, all nodes co or the channel. Note that the channel alternates between two states: the productive state, which lasts exactly k nd the nonproductive state, which lasts for a random number of slots. Clearly, the channel efficiency is the ra /(k+x), where x is the expected number of consecutive unproductive slots. (a) For fixed N and p, determine the efficiency of this protocol. (b) For fixed N, determine the p that maximizes the efficiency. (c) Using the p (which is a function of N) found in (b), determine the efficiency as N approaches infinity. (d) Show that this efficiency approaches 1 as the frame length becomes large.

onstant length L-KRS, where K is the transmission rate of the channel and k is a large integer. Suppose there odes, each with an infinite number of frames to send. We also assume that dprop < S, so that all nodes can de ollision before the end of a slot time. The protocol is as follows: If, for a given slot, no node has possession hannel, all nodes contend for the channel; in particular, each node transmits in the slot with probability p. If ex ne node transmits in the slot, that node takes possession of the channel for the subsequent k1 slots and transm ntire frame. If some node has possession of the channel, all other nodes refrain from transmitting until the nod ossesses the channel has finished transmitting its frame. Once this node has transmitted its frame, all nodes co or the channel. Note that the channel alternates between two states: the productive state, which lasts exactly k nd the nonproductive state, which lasts for a random number of slots. Clearly, the channel efficiency is the ra /(k+x), where x is the expected number of consecutive unproductive slots. (a) For fixed N and p, determine the efficiency of this protocol. (b) For fixed N, determine the p that maximizes the efficiency. (c) Using the p (which is a function of N) found in (b), determine the efficiency as N approaches infinity. (d) Show that this efficiency approaches 1 as the frame length becomes large.

Database System Concepts
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
icon
Related questions
Question
constant length L=kRS, where R is the transmission rate of the channel and k is a large integer. Suppose there are N nodes, each with an infinite number of frames to send. We also assume that dprop < S, so that all nodes can detect a collision before the end of a slot time. The protocol is as follows: If, for a given slot, no node has possession of the channel, all nodes contend for the channel; in particular, each node transmits in the slot with probability p. If exactly one node transmits in the slot, that node takes possession of the channel for the subsequent k1 slots and transmits its entire frame. If some node has possession of the channel, all other nodes refrain from transmitting until the node that possesses the channel has finished transmitting its frame. Once this node has transmitted its frame, all nodes contend for the channel. Note that the channel alternates between two states: the productive state, which lasts exactly k slots, and the nonproductive state, which lasts for a random number of slots. Clearly, the channel efficiency is the ratio of k/(k+x), where x is the expected number of consecutive unproductive slots. (a) For fixed N and p, determine the efficiency of this protocol. (b) For fixed N, determine the p that maximizes the efficiency. (c) Using the p (which is a function of N) found in (b), determine the efficiency as N approaches infinity. (d) Show that this efficiency approaches 1 as the frame length becomes large.
Transcribed Image Text:constant length L=kRS, where R is the transmission rate of the channel and k is a large integer. Suppose there are N nodes, each with an infinite number of frames to send. We also assume that dprop < S, so that all nodes can detect a collision before the end of a slot time. The protocol is as follows: If, for a given slot, no node has possession of the channel, all nodes contend for the channel; in particular, each node transmits in the slot with probability p. If exactly one node transmits in the slot, that node takes possession of the channel for the subsequent k1 slots and transmits its entire frame. If some node has possession of the channel, all other nodes refrain from transmitting until the node that possesses the channel has finished transmitting its frame. Once this node has transmitted its frame, all nodes contend for the channel. Note that the channel alternates between two states: the productive state, which lasts exactly k slots, and the nonproductive state, which lasts for a random number of slots. Clearly, the channel efficiency is the ratio of k/(k+x), where x is the expected number of consecutive unproductive slots. (a) For fixed N and p, determine the efficiency of this protocol. (b) For fixed N, determine the p that maximizes the efficiency. (c) Using the p (which is a function of N) found in (b), determine the efficiency as N approaches infinity. (d) Show that this efficiency approaches 1 as the frame length becomes large.
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of
Transcribed Image Text:4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Network Transmission Cabling
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS