Switching via memory - network layer and routing , Computer Networking

Assignment Help:

Switching  via memory

Traditional  computers with switching  between  input and output  being  doen under  direct  control  of the CPU input and output  ports  functioned as traditional I/O devices in a traditional  operating systems. Aninput port with an arriving  packet first signalled the routing  processor. The packet  was then copied  from the  input   port into processor  memory. The routing  processor  then extract the destination address from the heard looked  up the appropriate output port in  the forwarding table and the packet to the output  buffers. Note  that if memory  bandwidth  is B packets per second  can be written into  or read from memory them the overall forwarding throughput ( the  total  rate at which  packets are transferred   from input  ports to output  ports ) must be  less than B/2.


Related Discussions:- Switching via memory - network layer and routing

Introduction-parallel algorithms, Introduction An algorithm is defined ...

Introduction An algorithm is defined as a series of computational steps required to accomplish an exact task. The algorithm works for a given input and will terminate in a well

Explain ethernet frame, Explain Ethernet Frame. The heart of Ethernet s...

Explain Ethernet Frame. The heart of Ethernet system is the Ethernet Frame, which is used to deliver information among the computers. The frame having of a set of bits organize

What is convergence time, Convergence time is slower for Distant Vector rou...

Convergence time is slower for Distant Vector routing and is faster for Link State routing.

Definition of csma/cd, Definition of CSMA/CD CSMA/CD (Carrier Sense Mu...

Definition of CSMA/CD CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is used to minimize collisions, coordinate traffic and maximize number of frames deliver

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Switching via an interconnection network, Switching  via an interconnectio...

Switching  via an interconnection network The switching  techniques  overcome the bandwidth  limitation of a single  shared bus. This technique use a more sophisticated interco

Fat tree, Fat tree It is a modified version of the tree network. In thi...

Fat tree It is a modified version of the tree network. In this group the bandwidth of edge (or the connecting wire among nodes) increases towards the root. It is a more practic

What is the multicast routing, Sending a message to a group multicast addre...

Sending a message to a group multicast address is known as multicasting, and its routing algorithm is known as multicast routing.

Local and wide area networking, A. Current setting A new bank has its he...

A. Current setting A new bank has its headquarters located in City A. Recently, the bank has opened its first branch in City B, and its data centre in City C. The three cities a

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