Please enable JavaScript.

Coggle requires JavaScript to display documents.

Infrastructure Technology - Coggle Diagram

- - - - a Dot1Q trunk that is untagged
    - - Encapsulation mismatch: ISL or dot1q
      - trunking mode mismatch: trunk or access, auto or dynamic desirable
      - Allowed VLAN mismatch
        
        Default: allow all VLAN
        
        Pruning: Specifies VLANs to be allowed or denied
      - Native VLAN mismatch
  - - - Server
        
        Create/change/delete
      - Client
        
        Update VLAN database based on received advertisements
      - Transparent
        
        Forward received VTP message only
    - - Ver2
        
        Trans mode forward any VTP frame without checking domain or ver info
      - Ver3
        
        Extend VLAN to 4094
        
        Support: Private VLAN
        MST
        Primary Server
  - - - Change port piority
- - - - Dynamic Routing Protocol
        
        Exterior Gateway Protocol (EGP)
        
        Path-Vector : Extend of Distance-vector
        
        Before each router advertises a route to a neighbor, it will add its own AS to the AS path
        
        BGP
        
        Weight => Local Preference => Originate => AS path length
        
        iBGP: each update will not be sent to neighbors with the same AS => full mess connect
        
        eBGP: Discard update when see it own AS in AS path
        
        Interior Gateway Protocol (IGP)
        
        Link-State: Cost calculate from bandwith
        
        Link-state Advertisement (Router ID, Address, Cost, State) will be send (LSA flooding) to all direct connection to create LSA Database
        
        OSPF
        
        Neighborship Requirements
        
        Matching Area
        
        Matching Authentication
        
        Matching Subnet
        
        Matching Timers
        
        Matching Stub Flags
        
        Matching MTU
        
        IS-IS
        
        Neighbor table (adjacent database) will update LSA and use SPF (Shortest Path First) algorithm to create SPF tree (topology table)
        
        With Link-state, each Router have: Neighbor table + topology table + Routing table
        
        Distance-Vector: hop-count
        
        RIP
        
        Choose the best route based on the number of hops, regardless of bandwidth => not optimal when the links have different speeds
        
        IGRP
        
        Using bandwidth and latency to calculate WEIGHT but using only for CISCO devices
        
        Only exchange information with neighbors, can't grasp the entire network model
        
        Long convergence time when update routing table
        
        Loop issues
        
        Split horizon: no sending back in4 which received from
        
        Triggered update: imedieately update when error
        
        Poisoned route: auto set metric =16 (unreachable) to fail link
        
        Holddown timer: stay awhile to communicate with fail link
        
        Traffic flow changes according to the state of the network connection, the type of routing protocol
        
        Suitable for large, structured, multicast, load-balanced networks
      - Connected
        
        direct connection
      - Stactic Routing
        
        Manual to control traffic, adding a node or subnet have to update config to every node in the network => disadvantage
        
        Using in Flat Network Topo, with only unidirectional connections
    - - Classfull Routing Protocol
        
        Some routing protocols do not send the subnet mask of the interface when exchanging routing tables
        
        IGRP
        
        RIPv1
      - Classless Routing Protocol
        
        protocols send the subnet mask of the interface when exchanging routing tables
        
        RIPv2
        
        EIGRP
        
        OSPF
        
        IS-IS
        
        BGP
    - - Metrics: value that each routing protocol uses to choose the best path if there exist multiple paths to the same destination
      - Adminstrative Distance: Each protocol is assigned an AD value for priority classification. The smaller the AD, the more priority is given
      - Load Balance: By default, routing protocols allow load balancing across 4 paths, up to 6 paths (only 1 path with BGP)