Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
nonselective fading and selective fading nonselective fading is a fading in which all frequency methods of the received signal fluctuate in the
differentiate between fast fading and slow fadingfast fading refers to changes in signal strength among a transmitter and receiver as the distance
microcellsas cells become smaller antennas move from the tops of tall buildings or hills to the tops of small buildings or the sides of large
state about the cell sectoringwith cell sectoring a cell is separated into a number of wedge-shaped sectors each with its own set of channels
cell splitting in practice the distribution of traffic and topographic features is not uniform and this shows opportunities of capacity enhance
what is frequency borrowingin the simplest case frequencies are taken from adjacent cells by congested cellsthe frequencies can also be assigned to
explain the term- congestionthe average queue size over the last cycle and the current cycle is calculated this value is the threshold by averaging
enumerate about the traffic policingtraffic policing happens when a flow of data is regulated so that cells or frames or packets that exceed a
explain the forward congestion avoidance processnotifies the user that congestion avoidance process should be initiated where applicable for traffic
state the congestion avoidance processnotifies the source that congestion avoidance process should be initiated where applicable for traffic in the
what is explicit congestion signallingin general way for explicit congestion avoidance the network alerts end systems to growing congestion within
define choke packet and implicit congestion signallingchoke packet a choke packet is a control packet produced at a congested node and transmitted
explain the technique- backpressurethis technique produces an effect same to backpressure in fluids flowing down a pipe it includes link-by-link use
determine about unique least-cost pathif there is a unique least-cost path the two algorithms will yield the similar result because they are both
illustrate the bellman-ford algorithmthe bellman-ford algorithm uses only on information from its neighbours and knowledge of its link costs to
explain the cost of a path between two nodesgiven a network of nodes linked by bidirectional links where every link has a cost associated with it in
state the disadvantages of adaptive routing process 1 the routing decision is more difficult thus the processing burden on network nodes enhances2
what are the advantages of adaptive routing 1 an adaptive routing method can improve performance as realised by the network user2 an adaptive
describe the static routing process a static routing method does not adapt to changing conditions on the network but uses a fixed method developed
suppose there are exactly five packet switches figure 4 between a sending host and a receiving host connected by a virtual circuit line shown as
what is piggybacked ackthe protocol will be incorrect suppose that 3-bit sequence numbers we are using consider following situationa just send frame
what is crcthe crc is computed while transmission and appended to output stream as soon as last bit goes out onto wire if the crc were in header it
how receiver detects errorthe frame is 10011101 the generator is 1001 the message after appending the three zeros is 10011101000 the reminder on
what is horizontal and vertical parity a single error can cause both horizontal and vertical parity checks to be wrong two errors can also be easily
concept of connection between the pc and the cable modemeven if downstream channel works at 27 mbps user interface is nearly always 10-mbps ethernet