The reduction in the quality of service that occurs when a network node or a link carries more data than it can handle is called “Network Congestion”. The congestion in the network can lead to effects like packet loss or even blocking of new connections.Therefore, Congestion in networks can be defined as, “A state that occurs in network layers because of the heavy message traffic that results in slowing down the network response time is called congestion”.Effects of CongestionFollowing are the effects of Congestion −Because of the increase in the response time, the overall performance is reduced.Also, in worst situations, ... Read More

The reduction in the quality of service that occurs when a network node or a link carries more data than it can handle is called “Network Congestion”. The congestion in the network can lead to effects like packet loss or even blocking of new connections.Therefore, congestion in networks can be defined as, “A state that occurs in network layers because of the heavy message traffic that results in slowing down the network response time is called congestion”.Effects of CongestionFollowing are the effects of Congestion −Because of the increase in the response time, the overall performance is reduced.Also, in worst situations, ... Read More

The Stream Control Transmission Protocol (SCTP) is a new transport protocol at the same layer as TCP and UDP. It provides functions for association management, sequence delivery, message chunk building, packet validation, and path management. SCTP is a new reliable, message-oriented transport layer protocol. It is mostly designed for Internet applications that have recently been introduced.These new applications such as IUA (ISDN over IP), M2UA and M3UA (Telephony Signalling), H.248 (Media Gateway Control), H.323 (IP telephony), and SIP (IP Telephony), need a more sophisticated service than TCP can provide.Stream Control Transmission ProtocolIt is a transport layer protocol and is used ... Read More

The User Datagram Protocol (UDP) is a transport layer protocol defined for use with the IP network layer protocol. UDP does not provide any reliability.ExplanationLet us see the explanation of UDP in a stepwise manner.Step 1 − For example, it does not transmit any lost packets. Often, this is the main reason to consider UDP as a transport.Step 2 − Applications that do require reliable message delivery therefore need to implement appropriate protocol mechanisms in their application.Step 3 − UDP's best effort service does not protect against datagram duplication i.e an application may receive multiple copies of UDP datagram.Step 4 ... Read More

Internet protocol version 6(IPv6) allows data transfer to take place over the network. The need for IPv6 arises as this protocol can handle the packets more efficiently which thereby improve the performance and security. Most importantly it enables the service providers to reduce the size of their routing tables.Representation of IPv6IPv6 consists of 128 bits which are represented by eight groups of hexadecimal digits out of which each group is represented by 16 bits that are separated by colons.Example of IPv6 address2002:0db6:65a3:0000:0000:6a2e:0270:7443Types of IPv6They are broadly classified into three types namely −Unicast − From the name uni it’s so obvious ... Read More

In hierarchical routing, the routers are divided into regions. Each router has complete details about how to route packets to destinations within its own region. But it does not have any idea about the internal structure of other regions.As we know, in both LS and DV algorithms, every router needs to save some information about other routers. When network size is growing, the number of routers in the network will increase. Therefore, the size of routing table increases, then routers cannot handle network traffic as efficiently. To overcome this problem we are using hierarchical routing.In hierarchical routing, routers are classified ... Read More

Load-sensitive routing algorithms have been integrated into the Internet routing algorithms since the early days of ARPANET. The drawback of this condition leads to overreaction to changing network conditions and permanent oscillation effects finally caused the idea of load-adaptive routing to be dropped for some decades.There is a tremendous growth of interest in traffic engineering and in load-sensitive routing in general from the last year onwards.Many studies testify that with the stability mechanisms integrated these kinds of algorithms strongly outperform the traditional shortest-path IP routing.In the study of load-sensitive routing algorithms several emerging approaches to load-sensitive routing are presented and ... Read More

Dynamic routing is an adaptive routing algorithm, and it is a process where a router can forward data through a different route.The term is most associated with data networking to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, so if other path choices are available. Dynamic routing allows many routes to remain valid in response to the change.Systems that do not implement dynamic routing are usually preferred to static routing, because static routes through a network are described by fixed paths. If anything, those that take an ... Read More

Static routing algorithm is a form of routing which occurs when a router uses a manual configuration routing entry rather than dynamic entry.In different cases, static routes are manually configured by a network administrator by adding entries into the routing table. It is not possible in all cases. Static routes are fixed and do not change if the network is changed or reconfigured.Static and dynamic routing is not mutually exclusive. They are usually used on a router to maximise routing efficiency and to provide backups in the event that dynamic routing information fails to be exchanged.UsesThe different uses of Static ... Read More

Data link layer protocols are divided into two categories based on whether the transmission channel is noiseless or noisy. The data link layer protocol is diagrammatically represented below − Noiseless Channels There are two noiseless channels which are as follows − Simplex channel Stop & wait channel Let us consider an ideal channel where no frames are lost, duplicated, or corrupted. We introduce two protocols for this type of channel. These two protocols are as follows − Protocol that does not use flow control. Protocol that uses the ... Read More