yar koi tou slution send kar dya karo
cs610 2 assign
Q1.XYZ is an organization and its network engineer wants to connect two segments with in a building, which device will be used for connectivity? What major tasks will perform this device in this scenario?View more random threads:
- Vuhelp Member request
- need help in guideline of preparation of fuji foudation...
- Solution required for CS402 assignment # 1 fall 2011
- eng201 assignment 4 due date 4/7/2012
- STA630 solution req
- mgt301 gdb 2
- need monthly subscription for a site as an advertiser...
- online tution for canadian people and students 2011
- Quiz#2 MGT211-Introdcution To Buisness (Last Date: 20...
- Upload your assignment to Vuhelp.net for Fall 2011 Semester...
Q2. ABC organization is using five switches in its network. They are providing video streaming in different countries, for this they have redundant links for a backup solution. Which algorithm will be used to avoid loops among all switches in this scenario? Describe functionality of that algorithm in few lines.
Sponsored Links
yar koi tou slution send kar dya karo
cs610 2 assign
[COLOR="rgb(0, 255, 255)"]yar koi tou slution send kar dya karo
cs610 2 assign[/COLOR]
yar koi tou slution send kar dya karo
cs610 2 assign
Definition: Spanning trees are a standard technique used in local area network (LAN) switching. Spanning tree algorithms were developed to prevent redundant transmission of data along intermediate hops between a source and destination host on a mesh network topology. Without spanning trees, a mesh network can be flooded and rendered unusable by messages circulating in an infinite loop between hosts.
The primary Spanning Tree Protocol (STP) is IEEE standard 802.1D, an algorithm commonly used on Ethernet networks. This algorithm works by limiting the paths messages can travel at any given time to a fully connected tree rather than a mesh. As hosts join and leave the network, this protocol dynamically updates the tree accordingly.
There are currently 1 users browsing this thread. (0 members and 1 guests)