Reference no: EM1379592
Question: The teacher went over the following trouble in class. However, I do not understand how he describes the work. He skips too many steps and jumps around. I have the final answer but I need a clear and complete explanation on how this problem is solved:
Let A and B be two stations attempting to transmit on an Ethernet. Each has a steady queue of frames ready to send; A's frames will be numbered A1, A2, so on, and B's similarly. Let T = 51.2 microseconds be exponential backoff base unit. Suppose A and B simultaneously attempt to send frame 1, collide and happen to chose backoff times of 0xT and 1xT, respectively, meaning A wins the race and transmits A1 while B waits. At the end of this transmission, B will attempt to restransmit B1 while A will attempt to transmit A2. These first attempts will collide, but now A backs off for either 0xT or 1xT, while B backs off for time equal to one of 0xT,...3xT.
a) Give the probability that A wins this second backoff race immediately after this first collision; that is, A's first choice of backoff time k x 51.2 is less than B's.
b) Assume A wins this second backoff race. A transmits A3, and when it is finished, A and B collide again as A tries to transmit A4 and B tries once more to transmit B1. Give the probability that A wins this third backoff race immediately after the first collision.
c) Give a reasonable lower bound for the probability that A wins all the remaining backoff races.
d) What then happens to the frame B1?
|
Network security related question
: Assume we want to use Kerberos for securing electronic mail. The obvious way of accomplishing this is for Alice, when sending a message to Bob,
|
|
Develop and manage internet usage
: Discuss how does management in business or education develop and manage Internet usage as it relates to research, supplemental resources and functional support? Explain your answer with examples.
|
|
Question about big oh relationship
: Provide witnesses n0 and c that can be used to prove the relationship. Select your witnesses to be minimal, in the sense that n0-1 and c are not witnesses, and if d
|
|
Frequency definition of bandwidth
: In data communication we often use term "bandwidth" when we refer to capacity of a link. Strictly speaking, however, bandwidth refers to range of frequencies that can be carried on a link.
|
|
Question about Ethernet capture effect
: The teacher went over the following trouble in class. However, I do not understand how he describes the work. He skips too many steps and jumps around.
|
|
Roles of network managers
: In Many development companies and universities network managers must oversee a network that has several computers connected to it that are used through developers for design and product development reason.
|
|
Protecting the company data
: Suppose you work for a small, one office loan business. Your data is critical, and a fire or other disaster could destroy all of your computer documents.
|
|
Procedure that adds 2 words together
: Create a small procedure that adds two words together and stores the results in CX and DX. Call the procedure from a program that loads the words to be added together in registers BX and AX
|
|
Relational database architecture from a network
: Determine what would make a corporation or organization migrate to a relational database architecture from a network or hierarchical architecture?
|