Data Centric Network (Unit 5)

-

 Data-Centric Network (Unit 5)

IP Services

IP Datagram


IP Header

  • Version - IPv4 or IPv6
  • Header Length - Storage of all required headers.
  • Identification - Finding the datagram.
  • Flags - Used under fragmentation.
  • TTL - The time before the packet will be dropped.
  • Protocol

  • Header Checksum - Integrity of the data maintained.
  • Options
  • Padding

IP Fragmentation


IPv4 Issues

  • No route aggregation - Minimize the routing table complexity.
  • Address space exhaustion
  • Lack of quality of service
  • Limited mobility
  • Security layer issue

IPv6

  • Version number
  • Flow label - Label packet requests handle by routers.
  • Traffic class - Identification and marking class types of packet.
  • Payload length
  • Next header
  • Hop limit
  • Source address
  • Destination address
  • Flow Label - Maintains a table with an entry and exit definition for the IPv6 routing.

IPv6 VS IPv4


Extension header types

  • Hop by Hop
  • Destination
  • Source Routing
  • Fragmentation
  • Authentication
  • ESP

MPLS




Link state routing & algorithms

  • OSPF - Link state routing protocol with Shortest Path First algorithm.
  • BGP - Exchange routing information for the internet.
  • EGP - Finding network path information.

Comments

Post a Comment

Popular posts from this blog

Design of Experiments (Unit 5)

-
Image
 Design of Experiments (Unit 5) Design of Experiments - Unit 5 - DOE - SRMIST Syllabus Types One-way ANOVA - 1 factor & at least 2 independent levels. Define NULL & Alternate hypothesis. State Alpha. Calculate DOF. State decision rule. Calculate the test statistic. State result. State conclusion. Two-way ANOVA - At least 2 factors that have dependent or independent levels. Three-way ANOVA Diagrammatic understanding. Assumptions of ANOVA Normality of sampling distribution of means I ndependent of errors Absence of outliers. Homogeneity of variances. Hypothesis of ANOVA H0 is the initial condition. H1 is the secondary condition. NOTE *Sums have been omitted in this article, this can be used for reference.
Read more

Data Centric Network (Unit 3)

-
Image
  Data-Centric Network (Unit 3) Server Architecture Network Attachment - Interface for the communication between server and client via the network. Network Interface Cards - Provide connectivity between hosts. DMA - Transfers data without involving the system processor. Interrupt coalescing - Reduces the number of interrupts hence reducing delay. Jumbo frames - Support bigger ethernet frames. Server Multihoming Fault tolerance - Only one port is active which upon failure would keep it on standby and the other port take up the load. Load balancing - One port receives all the traffic. Link aggregation - A bunch of ports looks like a single link with equivalent bandwidth. PCI & PCI-X Buses - Bandwidth allocation of 533 MBPS & 1.066 GBPS. Client Server Packet Processing - How the OS handles the processing of IP packets. User mode VS Kernel mode - Interrupt handling & system services etc. Ethernet Driver Server TCP/IP Sockets Listen - Length of  receive queue of...
Read more

Finding Factorial in C++ || Recursion

-
Image
 Finding Factorial in C++ || Recursion The logic and code are pretty simple for this. Considering that we don't have to do any exception handling. We get the input n. We return 1 if the input is 0 or 1. If the input is any other number (positive only) then we do recursion. The recursion is when we multiply the present number by the previous number and run the same function with this new result that we have. For example, try a dry run on your won for 5, See how it works for n=3 Iteration 1 in the function 3 != 1 or 0, so else case  return 3*factorial(2)    2 != 1 or 0, so else case return 3*2*(factorial(1))  1 == 1, so if-case return 3*2*1 = 6 So this is the logic behind the code. Here is the code, have fun, mess around and see what new things you can find in this.  #include<bits/stdc++.h> using namespace std ; int  factorial ( int  n ) {      if ( n== 1 ||n== 0 )          ...
Read more