MIME represents Multi-Purpose Internet Mail Extensions. It is a development to the Internet email protocol that enables its users to exchange several kinds of data files over the Internet, including images, audio, and video.The MIME is required if the text in character sets other than the American Standard Code for Information Interchange (ASCII). Virtually, all human-written Internet email and a fairly large proportion of automated email is transmitted via Simple Mail Transfer Protocol (SMTP) in MIME format.MIME was designed mainly for SMTP, but the content types defined by MIME standards are important also in communication protocols outside of email, such ... Read More

ATM transfers data in fixed-size units are known as cells. Each cell includes 53 octets or bytes, as shown in the figure. The first 5 bytes contain cell-header data, and the remaining 48 include the payload (user information).Small, fixed-length cells are well appropriated to transfer voice and video traffic due to such traffic is biased to delays that result from having to wait for a huge data packet to download, among other things.HeaderPayload5 Bytes48 BytesATM Cell FormatAn ATM cell header can be two formats, such as User Network Interface (UNI) or Network to Network Interface (NNI). The UNI header can ... Read More

Following are some of the services offered by the Transmission Control Protocol (TCP) to the processes at the application layer:Stream Delivery Service.Sending and Receiving Buffers.Bytes and Segments.Full Duplex ServiceConnection Oriented Service.Reliable Service.All the above mentioned TCP services are explained below in detail.Stream Delivery ServiceTCP is a stream-oriented protocol. It enables the sending process to deliver data as a stream of bytes and the receiving process to acquire data as a stream of bytes.TCP creates a working environment so that the sending and receiving procedures are connected by an imaginary "tube", as shown in the figure below:Sending and Receiving BuffersThe sending ... Read More

In this post, we will understand the difference between Time Sharing and Real-Time Operating System −Time Sharing Operating SystemIn this type of operating system, a quick response is required to be given when a request comes in.It has a switching method.Any kind of modifications can be done to the program.The resources of the computer are shared externally.It deals with multiple processes and applications simultaneously.The response to a user request is given within seconds of time.Real-Time Operating SystemIn this operating system, the computation tasks are required to be given more importance before its nominative point.It doesn’t have a switching method.No modification ... Read More

In this post, we will understand the difference between network operating system and a distributed operating system.Network Operating SystemThe main object of this system is to provide local services to remote clients.The communication takes place depending on the files.It is more scalable in comparison to Distributed Operating System.It has less fault tolerance.The rate of autonomy in a network operating system is high.It is easy to implement.The nodes of a network operating system can have different operating system.Distributed Operating SystemThe main objective of this system is to manage the resources of the hardware.The communication takes place depending on messages and shared ... Read More

DefinitionIn computer science and mathematics, a directed acyclic graph (DAG) refers to a directed graph which has no directed cycles.ExplanationIn graph theory, a graph refers to a set of vertices which are connected by lines called edges. In a directed graph or a digraph, each edge is associated with a direction from a start vertex to an end vertex. If we traverse along the direction of the edges and we find that no closed loops are formed along any path, we say that there are no directed cycles. The graph formed is a directed acyclic graph.A DAG is always topologically ... Read More

DefinitionThe Dijkstra’s algorithm finds the shortest path from a particular node, called the source node to every other node in a connected graph. It produces a shortest path tree with the source node as the root. It is profoundly used in computer networks to generate optimal routes with the aim of minimizing routing costs.Dijkstra’s AlgorithmInput − A graph representing the network; and a source node, sOutput − A shortest path tree, spt[], with s as the root node.Initializations −An array of distances dist[] of size |V| (number of nodes), where dist[s] = 0 and dist[u] = ∞ (infinite), where u ... Read More

Routing Algorithms − A routing algorithm is a procedure that lays down the route or path to transfer data packets from source to the destination. There can be many paths from the source to the destination; routing algorithm mathematically computes the best path, i.e. “least – cost path”. Routing algorithms are broadly classified into adaptive and non-adaptive routing algorithms.Adaptive Routing Algorithms − Also known as dynamic routing algorithms, they makes routing decisions dynamically depending on the network conditions. It constructs the routing table depending upon the network traffic and topology.Non-Adaptive Routing Algorithms − Also known as static routing algorithms, they ... Read More

DefinitionSink trees of a given node in a computer network is a tree formed by connecting the node with all the other nodes of in the network with the optimal path, or more precisely the shortest path. Or, in other words, a sink tree is a minimal cost tree formed with the given node as the destination and all other nodes as sources. A popular measure for the path or the cost is the number of hops.ExplanationThe sink tree follows from the optimality principle. According to it, in a network of routers for data transmission, if a router ‘J’ lies ... Read More

Adaptive routing algorithms, also known as dynamic routing algorithms, makes routing decisions dynamically while transferring data packets from the source to the destination. These algorithms constructs routing tables depending on the network conditions like network traffic and topology. They try to compute computes the best path, i.e. “least – cost path”, depending upon the hop count, transit time and distance.Types of Adaptive Routing AlgorithmsThe three popular types of adaptive routing algorithms are shown in the following diagram −Centralized algorithm − In centralized routing, one centralized node has the total network information and takes the routing decisions. It finds the least-cost ... Read More