part 3 Flashcards
station
Device that interfaces a user to a network
node
Device that allows 1 or more stations to access the physical network and is a transfer point for passing info through a network (often a router or telephone switch)
sub-network (network cloud)
Underlying connection of nodes and telecommunication links
Factors of Choosing a Routing Method
Method/algorithm chosen must be:
- Optimal
- Fair
- Robust, but not too robust
Least Cost Routing Algorithm
- Finds all possible paths between 2 locations
- By identifying all, also identifies least cost path
- Determines least cost path between any pair of nodes
Flooding Routing
- Traffic grows quickly when every node floods
- To limit, each packet has a hop count that increments every time the packet hops
if (hopCount == networkHopLimit) -> discard packet
Centralized Routing
- One routing table is kept at a “central” node
- If a node needs a routing decision, central node is consulted
- To survive central node failure, routing table should be kept at a backup location
- Central node should be designed to support a high amount of routing requests
Distributed Routing
- Each node has own routing table
- Each node has to share info with other nodes so individual routing tables can be created
- ** Individual routing tables may hold inaccurate information
Adaptive vs. Static Routing
Adaptive:
- Routing tables can change to reflect changes in network
Static:
- Routing tables cannot change
- Simpler but does not adapt to network congestion or failures
Routing Information Protocol (RIP)
- Form of distance vector routing; adaptive and distributed
- Each node has own table and exchanged routing information with its neighbors
network congestion
When a network or part of a network becomes so saturated with data packets that packet transfer is noticeably impeded
Causes of Network Congestion
- Node and link failures
- High traffic
- Improper network planning
Possible Solutions to Network Congestion
- Implicit congestion control: An application can observe its own traffic and notice if packets are disappearing
- Explicit congestion control: The network can inform its applications that congestion has occurred and applications can take action
* Forward Explicit Congestion Notification (FECN)
* Backward Explicit Congestion Notification (BECN) - Slow control: Flow control at a datalink layer allows 2 adjacent nodes to control the amount of traffic passing between them
- **Congestion avoidance: Using buffer preallocation and connection admission control
buffer preallocation
Before a node sends packets, sending node inquires in advance whether receiving node has enough buffer space
** node asks nicely before sending hehe
connection admission control
Before making a connection, user requests how much bandwith is needed, or if connection needs to be real-time
Example: Asynchronous transfer mode
Internet Control Message Protocol (ICMP)
Performs error reporting repeating for the Internet protocol (i.e. invalid IP address)
User Datagram Protocol (UDP)
- Transport layer protocol used in place of TCP
- Used with connectionless applications as opposed to connection-oriented like in TCP
- Encapsulates a header onto an application packet but the header is much simpler than TCP
Multiprotocol Label Switching
- Additional label/s encapsulated onto the front of an IP packet
- Used to move Internet packets more quickly through routers
Address Resolution Protocol (ARP)
- Translates IP address into MAC so frame can be delivered to proper workstation
- Allows packet to find right destination workstation since LAN does not use IP addresses to deliver frames, uses MAC instead
Tunneling Protocols and Virtual Private Networks (VPNs)
- Creates secure connection through internet by using a tunneling protocol and security procedures
- Two types: Point-to-point TP (PPTP), IPSEC
Point-to-Point TP (PPTP)
Extension of point-to-point protocol, used for communication between 2 computers using a serial connection
IPSEC
Set of protocols developed to support the secure exchange of data packets at IP layer
Asynchronous Transfer Mode (ATM)
- Sends data in small packets called “cells”
- Virtual circuit/connection must be established before the 2 end points can exchange data
- 4 classes of service: Constant Bit Rate Service (CBR), Variable Bit Rate (VBR), Available Bit Rate (ABR), Unspecified Bit Rate (UBR)
Constant Bit Rate Service (CBR)
Delivers high speed, continuous data stream that can be used with transition-intensive applications
Variable Bit Rate (VBR)
Used for real-time applications (i.e. compressed interactive radio) and non-real-time (i.e. sending email with large, multimedia attachments)
Available Bit Rate (ABR)
Used for “bursty” traffic that does not need to be transmitted immediately
Unspecified Bit Rate (UBR)
For lower rate traffic that may get held up, may even be discarded part way through transmission if congestion occurs