The Transmission Of Packets Computer Science Essay

In the web, there are certain undertakings that must be accomplished before a package is transmitted from the beginning node to the finish node. One of it is turn toing of the package – which involves encapsulating of the beginning and finish reference to enable the system cognize where the package is traveling. Another is the transmittal of the package from beginning to the finish node. That means directing package from the beginning to finish. There are several methods of turn toing and directing package over the web.

Packages can be differentiated from each other depending on the references they carry. The figure of finishs host can besides be used to find the manner of transmittal used.

There are three methods of transmittal of package in a web viz. ; unicast, broadcast and multicast. Unicast is a point-to-point method of transmittal. It involves turn toing a package to merely one node. Broadcast is a point-to-all method of transmittal. That is packet send by a node is received by all the nodes in the web.

Finally, multicasting is a point to multipoint method of transmittal. That is packet sent by a node is received by many other nodes.

Unicast is a one-to-one communicating method. The information packages are sends from a beginning node to a finish node. A typical illustration is a waiter and workstation in a web. Each transmittal session created involve one waiter and one receiver per clip. Although several nodes may be bespeaking for the same information at the same clip, the waiter watercourse or direct the information package to each node one after the other.

Top Writers
Verified expert
5 (339)
Verified expert
4.8 (756)
Prof. Laser
Verified expert
4.8 (435)
hire verified writer

Figure 1.0: Unicast Transmission Model

Figure 2.0 illustrates the web environment for unicast method of transmittal. It consists of a waiter and three terminal nodes connected to a web. Although the full nodes requested the same information at the same clip from the waiter, the waiter sends the informations independently utilizing their single references. That is the waiter encapsulates each package with end node reference and sends it distantly to three nodes. This method of transmittal is non scalable particularly when the figure of the nodes additions. It besides consumes web bandwidth as a consequence of redundant package transmitted on the same way. This transmittal method support several criterion applications like File Transfer Protocol, Hypertext Transfer Protocol ( HTTP ) , SSH, POP3 and Simple Mail Transfer protocol in aa‚¬A“IPaa‚¬A? web and Ethernet web.

2.1.2 Broadcasting Transmission Method

Broadcast is a one-to-all communicating method. The information packages are sends from a beginning to all the affiliated devices to the web. The beginning node sends a transcript of the information package and the routers duplicate and forwards the informations packages to the full connected nodes in the webs. For illustration, when a web node joins the web foremost ; a broadcast package is send by Address Resolution Protocol ( ARP ) to every node on the web for reference declaration and to denote it presence in the web. This transmittal mechanism floods the full web with broadcast package. Unlike unicast, and broadcast transmittal methods support Ethernet web. Broadcast is non scalable on the Internet because it leads to air storm and web congestion.

Figure 2.1: Showing Broadcast Transmission Model

Figure 2.1 illustrates a broadcast transmittal in a web environment. It consists of a waiter and three terminal nodes connected to a web. The waiter sends a transcript information package and the router duplicates the information package and forwards it to all the affiliated devices. The information packages are received by interested and uninterested terminal nodes in the web. These unrequested packages received by the end-nodes lead to waste of web resource and the implosion therapy mechanism of transmittal consume web bandwidth. Therefore, broadcast method transmittal is non appropriate for big webs like Internet.

2.1.3 Multicasting

Multicasting is much more different from the unicast and broadcast communicating methods. It is a one-to-many communicating method. The information packages are sends from a beginning to a group of finish nodes. That is a transcript of the information is send from the beginning host to all the members of the multicast group. Internet Protocol multicasting communicating method besides provides many-to-many transmittal method. That is group of nodes ( minimal one node ) can direct informations package to a group of receivers. The transmitters transmit informations package to a multicast reference that belongs to a peculiar multicast group. The information packages are duplicated by the multicast routers and forwarded on petition to the multicast group member that is interested in the information package. The interested end-nodes that want to have the information package have to fall in the multicast group. The kineticss enable informations package to be send merely to the interested receivers.

Figure 2.2: Showing Multicast Transmission Model.

Figure 2.2 illustrates a multicast transmittal in a web environment. It consists of a beginning waiter and three terminal nodes connected to a web. The beginning waiter sends a transcript information package to a multicast group reference and the router extras and forwards the information package merely to the multicast group members. It is merely the member that joins the group receives the information package, other nodes who are non member will non have the information package as demonstrated in figure 2.2.

2.2 IP Routing Protocol.

Apart from different methods of transmittal of informations package discussed above, another critical undertaking that must be accomplished before a package can be transmitted from a beginning host web to the finish host web is logical turn toing. This involves encapsulating the information package with the beginning and finish reference to enable the system to cognize where the information package traveling.

The logical addressing takes topographic point in the web bed of the OSI mention theoretical account. These logical addressing and routing informations packages are the primary map of devices in this bed e.g. , router. The router connects the little webs together to organize a big web that can cross metropoliss and the full universe as in the Internet web. This device forwards informations from one web to another and let host on the web to direct informations packages to one another even if the beginning host has no thought of the location of the finish host. Router attention less about the web host but merely cares about the web and best way to each web. To transport out these critical maps, there are set of regulations called routing protocol that enables the router to execute these maps.

This set of regulations enables the router to happen out the best path, and alternate path to every web, and uses this information to foul the router tabular array ( path to every web ) . For a web that are non straight connected to the router, the router must utilize several ways to detect how to acquire to the finish web: inactive ( input all web locations into the routing tabular array ) , default and dynamic routing.

2.2.1 Inactive Routing

Inactive routing occurs when the decision maker manually add paths to each routeraa‚¬a„?s routing tabular array. This routing is peculiarly economical, and there is no operating expense on the router cardinal processing unit. There is no bandwidth use among the routers, and it besides adds security to the system, because the decision maker prevents or allows entree to a web. However, it is non scalable in big webs, and demand reconfiguration of the full routers when there is a alteration in web topology.

2.2.2 Default Routing

Default routing occurs when informations package are send to remote web that is non in the routing tabular array to the next-hop router. Default routing is merely used web with one individual issue way of the web aa‚¬ ” stub web.

2.2.3 Dynamic Routing

Dynamic Routing is the used to protocol to turn up dynamically web finish and automatically update the routing tabular array. The router learns all the connected webs and other paths that lead to the distant web running the same protocol. The router will screen for the best path to the every distant utilizing the routing tabular arraies. The routing protocol will administer the best path information to every other router in the web utilizing the same protocol, thereby spread outing the routing information of the bing web and how it can be reached. This makes dynamic routing to accommodate to web topology alteration, nexus failure and device failure. This capableness makes direction, and care of dynamic routing simple comparison to default routing, and inactive routing.

Figure 2.3: Categorization of Unicast Routing Protocol from Internet Protocol ( IP )

There are two types of dynamic routing protocols runing in Internetwork: interior gateway protocol ( IGP ) and exterior gateway routing protocol ( EGP ) . IGP protocol uses dynamic routing to interchange routing updates within the same sphere, while EGP protocols uses dynamic routing mechanism to interchange routing updates between different spheres. These protocols runing in internetwork usage dynamic routing. In dynamic routing, router uses two basic methods to detect the devices, and the path to every device in the web. These methods include distance vector and nexus province protocols. There is besides another protocol, which is the combination of nexus and distance vector protocol named intercrossed protocol. A typical illustration of intercrossed protocol is EIGRP. We will discourse pros and cons of these protocols within a sphere ( IGP ) and between different spheres ( BGP ) in this subdivision. However, these routing protocols will be used in the simulation experiment in chapter 6. Interior Gateway Routing Protocol

Interior Gateway Routing is when the routing information is exchange among router within sphere. The Interior gateway protocol is categories base on the above routing mechanism viz. , distance vector, link province and intercrossed routing protocol. The illustration of these protocols includes Routing Information Protocol ( RIP ) , Open Shortest Path First and Enhance Interior Routing Protocol ( EIGRP ) . These protocols can farther be classified as category full and egalitarian routing protocols. Distance Vector Routing ( DVR )

Distance vector uses a distance and way to find it best way to remote web. The distance metric is estimated by the figure of the hop the package informations will pass through. The hop is any clip a package passes router. The DVR select it best way based on the path will the least figure of hop. The vector is the way the information package will pass through through the web. The DVR exchange it routing tabular array with merely straight connected router. Examples of distance vector are RIP and IGRP. This routing mechanism is besides called Bell-Ford algorithm. It is easy to configure with low computational operating expense and supportive to trouble-shoot. Link State Routing Protocol

Link province routing protocol, besides called shortest portion foremost works utilizing associate province algorithm. The protocol works by updating every router in the sphere about other routers and their straight connected webs. In other words, each router has a complete web image of that sphere web and can find the optimal way to all webs on its ain. The protocol enables the router to maintain path of information by keeping three separate tabular arraies. One of tabular arraies is for straight linking router, another for the full web topology, and one for best way ( routing tabular array ) . Alternatively of interchanging the full routing tabular array, nexus province merely exchange nexus updates to each other. Examples of nexus province protocols are OSPF and IS-IS. In the simulation experiment, in chapter 5 all routers in the sphere will be configured utilizing OSPF routing protocol. This protocol is scalable in big webs and complex in configuring compared to RIP routing protocol. Hybrid Routing Protocol

Hybrid Routing besides referred to as balance-routing makes usage of the nexus province and distance vector algorithm in routing in of informations package and in neighbour router relationship. It uses traditional distance vector to update routing information of straight connected web and combine it the cost of making them from the position of the advertisement router. It exchange full routing tabular array with the neighbouring router and direct routing update information merely when the web topology has changed. Balance-routing protocol converges quickly, requires less processing clip, and memory as comparison to associate province routing. Exterior Gateway Protocol

Exterior Gateway Routing protocol is a protocol that is design to execute routing map between different spheres. It can be describe as inter-domain routing protocol that exchange routing information between independent systems. An independent system ( sphere ) is a web or group of webs runing the same routing protocol and control from a common disposal. However, Internet web consists of several independent systems, and EGRP is the routing protocol used to route traffic between and through different the Internet Service Provider webs. Examples of EGRP are Border Gateway Protocol ( BGP ) . BGP use way vector mechanism in routing. Path vector routing mechanism enables the node talker in each independent system to make it routing table and exchange with neighbour talker node in another independent system.

2.3 Comparison to This Work:

Reliable multicasting and turning of Protocol Independent Multicasting is the popular country of research which rather complicated in a WAN environment. The web perform can be enhance by exchanging from Rendezvous Point to Shortest Path fir in multicast environment instead than turning PIM. Most simulation work in IP multicasting has centre on the comparing the unicast and multicast, demoing multicast processing of the unicast and a transcript being send in IP multicast. Little or no attending has been given to utilizing different unicast routing protocol which Protocol Independent Protocol used without making it routing table to compare the efficiency. This thesis simulation will be carried out that comparison RIP, OSPF and EIGPR and compare their efficiency with Protocol Independent Protocol.

Besides, many-to-many multicast has non been simulated in OPNET built theoretical account. This thesis will construct and imitate many beginnings directing multicast traffic to many receivers utilizing OPNET simulation tool. The exchanging from Rendezvous Pint to Shortest way Tree will be simulated and different multicast application. Failure of a device will show utilizing web page in OPNET simulation for easy apprehension and analysis of the consequence utilizing picture conferencing and voice application.

Cite this page

The Transmission Of Packets Computer Science Essay. (2020, Jun 02). Retrieved from

Are You on a Short Deadline? Let a Professional Expert Help You
Let’s chat?  We're online 24/7