Metropolitan Area Networks
Metropolitan Area Networks
Metropolitan Area Networks
Introduction
As we have seen, a local area network covers a room, a building or a campus.
A metropolitan area network (MAN) covers a city or a region of a city. A wide area network (WAN) covers multiple cities, states, countries, and even the solar system.
8/6/2012
M. Eyadat
8/6/2012
M. Eyadat
8/6/2012
M. Eyadat
SONET is based upon T-1 rates and does not fit nicely into 1 Mbps, 10 Mbps, 100 Mbps, 1000 Mbps chunks, like Ethernet systems do. Ethernet MANs have high failover times.
8/6/2012
M. Eyadat
8/6/2012
M. Eyadat
8/6/2012
M. Eyadat
8/6/2012
M. Eyadat
One form of packet switched network is the datagram. With a datagram, each packet is on its own and may follow its own path.
Virtual circuit packet-switched network create a logical path through the subnet and all packets from one connection follow this path.
8/6/2012 M. Eyadat 9
8/6/2012
M. Eyadat
10
8/6/2012
M. Eyadat
11
8/6/2012
M. Eyadat
13
Routing
Each node in a WAN is a router that accepts an input packet, examines the destination address, and forwards the packet on to a particular telecommunications line. How does a router decide which line to transmit on? A router must select the one transmission line that will best provide a path to the destination and in an optimal manner. Often many possible routes exist between sender and receiver.
8/6/2012
M. Eyadat
14
Routing
The subnet with its nodes and telecommunication links is essentially a weighted network graph. The edges, or telecommunication links, between nodes have a cost associated with them.
The cost could be a delay cost, a queue size cost, a limiting speed, or simply a dollar amount for using that link.
8/6/2012
M. Eyadat
15
Routing
The routing method, or algorithm, chosen to move packets through a network should be: Optimal, so the least cost can be found. Fair, so all packets are treated equally. Robust, in case link or node failures occur and the network has to reroute traffic. Not too robust so that the chosen paths do not oscillate too quickly between troubled spots.
8/6/2012
M. Eyadat
16
8/6/2012
M. Eyadat
17
Flooding
When a packet arrives at a node, the node sends a copy of the packet out every link except the link the packet arrived on. Traffic grows very quickly when every node floods the packet.
To limit uncontrolled growth, each packet has a hop count. Every time a packet hops, its hop count is incremented. When a packets hop count equals a global hop limit, the packet is discarded.
8/6/2012
M. Eyadat
18
Centralized Routing
One routing table is kept at a central node.
8/6/2012
M. Eyadat
19
Distributed Routing
Each node maintains its own routing table.
No central site holds a global table. Somehow each node has to share information with other nodes so that the individual routing tables can be created. Possible problem with individual routing tables holding inaccurate information.
8/6/2012
M. Eyadat
20
Isolated Routing
Each node uses only local information to create its own routing table. Advantage - routing information does not have to be passed around the network. Disadvantage - a nodes individual routing information could be inaccurate, or out of date.
8/6/2012
M. Eyadat
21
8/6/2012
M. Eyadat
22
Network Congestion
When a network or a part of a network becomes so saturated with data packets that packet transfer is noticeably impeded, network congestion occurs. Preventive measures include providing backup nodes and links and preallocation of resources. To handle network congestion, you can perform buffer preallocation, choke packets, or permit systems.
Quality of Service
Before making a connection, user requests how much bandwidth is needed, or if connection needs to be real-time.
Network checks to see if it can satisfy user request.
8/6/2012
M. Eyadat
24
8/6/2012
M. Eyadat
25
8/6/2012
M. Eyadat
26