IEEE802, Computer Engineering

Assignment Help:

1. (a) Given a baseband bus with station 1 located at 10m, station 2 located at 1000m, and station 3 located at 1010 meters (see diagram above). If the data rate of the bus is 10 Mbps, and the propagation speed of the medium is 200 m/microsecond, how long would it take to send a packet of 100 bits:

(1) between stations 3 and 2?

(2) between stations 3 and 1?

(b) Given a broaband bus with station 1 located at 10m, station 2 located at 1000m, and station 3 located at 1010 meters, and the headend is located at A (see diagram above). If the data rate of the bus is 10 Mbps, and the propagation speed of the medium is 200 m/microsecond, how long would it take to send a packet of 100 bits:

(1) between stations 3 and 2?

(2) between stations 3 and 1?



2. Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assume a 16 bit address size for the token bus LAN.

(a) Show, in the correct order, each of the MAC control frames that would be sent over the token bus when station 100 attempts to add new station(s) to the ring.

(b) Show, in the correct order, each of the MAC control frames that would be sent over the token bus when station 50 attempts to add new station(s) to the ring.

Use the frame format show below to identify the MAC control frames being sent:



3. Consider a five station token bus network. Calculate the number of frames sent, and the token rotation time (TRTC) for each station, for 5 complete rotations of the token. The priorities of the stations are as follows:

Station Address

Priority

1

6

2

4

3

4

4

4

5

6



Assume the following conditions for the network:

• Time is measured in octet times

• The time to pass the token is 20

• All stations have an unlimited number of frames to send

• The token holding time (THT) for sending priority 6 frames is 400

• The target token rotation time for the priority 4 frames (TRT4) is fixed at a value of 1400

• The frame length is the same fixed value for each station and equal to 100 octets

• The stations are ordered by decreasing station address number

Related Discussions:- IEEE802

Truth tables - artificial intelligence, Truth Tables - artificial intellige...

Truth Tables - artificial intelligence: In propositional logic, where we are limited to expressing sentences where propositions are true or false - we can check whether a speci

Discuss different routing plan adopted in telephone network, Discuss differ...

Discuss different Routing plan adopted in a Telephone network. Hierarchical networks are able of handing heavy traffic where needed, and at similar time use minimal number of t

What is cache memory, Q. What is Cache Memory? Cache memory is a very f...

Q. What is Cache Memory? Cache memory is a very fast and small memory between CPU and main memory whose access time is closer to processing speed of CPU. It behaves as a high-s

What is visibility give uml notation, What is visibility give UML notation?...

What is visibility give UML notation? Visibility refers to the ability of a process to reference a feature from another class and has possible valued of public, private, protec

Explain the main tags of wireless markup language, Discuss the main tags of...

Discuss the main tags of WML. Tag Definition of Wireless Markup Language: This defines the starting and the ending of the page, as .   this explains

Describe how a mobile terminating call, Problem: (a) Describe how a Mob...

Problem: (a) Describe how a Mobile Terminating call, from a PSTN phone, is processed in a GSM network. Illustrate your answer with a diagram. (b) What is a GPRS Support node

Deta sturcture, algorithm of travalling salesman problam

algorithm of travalling salesman problam

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd