Nt1330 Unit 5 Algorithm

3.1 Basic Concept
The need for computers of networks with guaranteed quality of service is widely recognized today. Unlike todays best effort networks like the Internet, where the user has no guarantee on the performing it may expect from the network, Quality of service networks guarantee the end user application a certain level of performance. Jitter measures the fluctuating of delay of packets in the given stream for packets, which is an important property for much application. Ideally, packets should be delivered in a completely periodic fashion; however, even if the source establish an evenly spaced stream, unavoidable jitter is displayed by the network due to the different queuing and propagation delays, and packets reach the destination with a wide range of inter-arrival times[36]. We need to achievement the QoS with the best performance thus the suggestion to combine two algorithms, the first algorithm simple switching spanning tree, and second algorithm multipath and must be using the Queue to set in switching. The first method design to learning the all switches about the location of the host in switch and then avoid any loop by using some codes, and second method design to send the packets to all path to decrease the
Also, applying the original function that is preventing the loop, it is used as a means to secure redundancy of network to automatically switch the path in case of a network failure. There is various kind of spanning tree, including STP, RSTP, PVST, and MSTP. In this section, we will take a look at an implementation of the most basic of STP. Spanning Tree Protocol (STP: IEEE 802.1D) handles a network as a logical tree and by setting all ports for each switch (sometimes called a bridge in this section) to transfer frame or not it suppresses occurrence of broadcast streams packets in a network having a loop structure, figure