Documente Academic
Documente Profesional
Documente Cultură
8.1 Circuit Switching Space-Division Switch Time-Division Switch TDM Bus Combinations
2
Blocking or Non-blocking
Blocking
A network is unable to connect stations because all paths are in use A blocking network allows this Used on voice systems
Short duration calls
Non-blocking
Permits all stations to connect (in pairs) at once Used for some data connections
5
10
11
12
13
Circuit-Switched Routing
Many connections will need paths through more than one switch Need to find a route
Efficiency Resilience
Alternate Routing
Possible routes between end offices predefined Originating switch selects appropriate route Routes listed in preference order Different sets of routes may be used at different times
15
16
Control Signals
18
Location of Signaling
Subscriber to network
Depends on subscriber device and switch
Within network
Management of subscriber calls and network ore complex
19
In Channel Signaling
Use same channel for signaling and call
Requires no additional transmission facilities
Inband
Uses same frequencies as voice signal Can go anywhere a voice signal can Impossible to set up a call on a faulty speech path
Out-of-band
Voice signals do not use full 4kHz bandwidth Narrow signal band within 4kHz used for control Can be sent whether or not voice signals are present Need extra electronics Slower signal rate (narrow bandwidth)
20
21
Disassociated Mode
Additional nodes (signal transfer points) Effectively two separate networks
22
23
Signaling Modes
24
25
SS7
SS7 network and protocol used for:
Basic call setup, management, tear down Wireless services such as PCS, roaming, authentication Toll free and toll (900) wireline services Enhanced features such as call forwarding, caller ID, 3-way calling Efficient and secure worldwide telecommunications
26
SS7
SS7 messages are exchanged between central offices and specialized databases via signal transfer points (packet switches). Control plane
Responsible for establishing and managing connections
Information plane
Once a connection is set up, info is transferred in the information plane
27
28
SS7
SCP
SCP
STP SSP
SSP
29
SS7 Characteristics
SSPs are telephone switches that send signaling messages to other SSPs to setup, manage, and release voice circuits An SSP may also send a query message to a centralized database (an SCP) to determine how to route a call (e.g. a toll-free number) Because the SS7 network is critical to call processing, SCPs and STPs are deployed in mated pair configurations in separate physical locations Links between signaling points are also in pairs
30
What if we don t want a dedicated call, or the data rate is bursty? You want packet switching!
31
Basic Operation
Data transmitted in small packets
Typically 1000 bytes Longer messages split into series of packets Each packet contains a portion of user data plus some control info (such as addressing info or packet type)
Packets are received, stored briefly (buffered) and passed on to the next node
Store and forward (only ATM does not do this)
32
Advantages
Line efficiency
Single node to node link can be shared by many packets over time Packets queued and transmitted as fast as possible
34
Datagram
Each packet treated independently Packets can take any practical route Packets may arrive out of order Packets may get lost or delayed Up to receiver to re-order packets and recover from missing packets
35
Virtual Circuit
Preplanned route established before any packets sent Call request and call accept packets establish connection (handshake) Each packet contains a virtual circuit identifier instead of destination address No routing decisions required for each packet Clear request to drop circuit Not a dedicated path
36
VCI is known only between two switches. (It is not a global address.)
37
38
39
A virtual circuit can be either switched or permanent. If permanent, an outgoing VCI is given to the source, and an incoming VCI is given to the destination. The source always uses this VCI to send frames to this particular destination. The destination knows that the frame is coming from that particular source if the frame carries the corresponding incoming VCI. If a duplex connection is needed, two virtual circuits are established.
40
A PVC has several drawbacks: 1. Always connected, so always paying 2. Connection is between two parties only. If you need a connection to another point, you need another PVC. Don t like these disadvantages? Use an SVC.
41
1 - Setup frame sent from A to Switch I. Note how the Outgoing VCI is not yet known.
42
As the acknowledgment frame goes back, the VCI number is placed into the Outgoing VCI entry in each table.
43
Less reliable
Loss of a node looses all circuits through that node
Datagram
No call setup phase
Better if few packets
More flexible
Routing can be used to avoid congested parts of the network
44
Packet Size
45
Event Timing
46
Routing
Complex, crucial aspect of packet switched networks Characteristics required
Correctness Simplicity Robustness Stability Fairness Optimality Efficiency
47
Performance Criteria
Used for selection of route Minimum hop Least cost
Dijkstra s algorithm most common Finds the least cost path from one starting node to all other nodes Algorithm can be repeated for each starting node
48
49
50
Place
Distributed
Made by each node
51
52
53
Flooding
No network info required Packet sent by node to every neighbor Incoming packets retransmitted on every link except incoming link Eventually a number of copies will arrive at destination Each packet is uniquely numbered so duplicates can be discarded Nodes can remember packets already forwarded to keep network load in bounds Can include a hop count in packets
54
Flooding Example
55
Properties of Flooding
All possible routes are tried
Very robust
At least one packet will have taken minimum hop count route
Can be used to set up virtual circuit
56
Adaptive Routing
Used by almost all packet switching networks Routing decisions change as conditions on the network change
Failure Congestion
Requires info about network Decisions more complex Tradeoff between quality of network info and overhead Reacting too quickly can cause oscillation Reacts too slow to be relevant
57
58
59
Chapter 21
In unicast routing, the router forwards the received packet through only one of its ports. Three basic unicast routing protocols: RIP, OSPF, BGP
61
R1, R2, R3 and R4 use an interior and exterior routing protocol. The other routers use only an interior protocol. RIP and OSPF are interior, BGP is exterior.
62
RIP
RIP (Routing Information Protocol) is an interior routing Protocol based on distance vector routing which uses the Bellman-Ford algorithm. Each router shares its routing knowledge with its neighbors, every 30 seconds. This shared information is used to update a routers routing table. An entry in the routing table consists of the destination network address, the shortest distance to reach the destination in hop count, and the next router to which the packet should be delivered. (see next slide)
63
163.5.0.0
5 4 6
64
65
66
OSPF
OSPF (Open Shortest Path First) protocol is another interior routing protocol for autonomous systems. Special routers called autonomous system boundary routers are responsible for dissipating information about other autonomous systems into the current system. To handle routing efficiently and in a timely manner, OSPF divides an autonomous system into areas.
67
68
OSPF
In OSPF, each router sends the state of its neighborhood to every other router in the area. It does this by flooding. The state of its neighborhood is only shared when there is new information. This generates much less traffic than does distance vector routing (RIP). OSPF keeps information on its links (the connection between two routers). There are 4 types of links: point-to-point, transient, stub, and virtual. To share information about their neighbors, each entity distributes link state advertisements (LSAs).
69
OSPF
There are 5 different types of LSAs: router link, network link, summary link to network, summary link to AS boundary router, and external link. Every router in an area receives the router link LSAs and network link LSAs from every other router and forms a link state database. Dijkstras least cost algorithm is applied to this link state database to create the routing table. The routing table shows the cost of reaching each network in the area.
70
BGP
RIP and OSPF have shortcomings. RIP (distance vector routing) is not always optimal because The smallest hop count is not always the optimal route. Plus, bad news moves slowly. OSPF (link state routing) has the shortcoming of a possibly huge routing table. To use link state routing for the whole internet would require each router to have a huge database. What about BGP (Border Gateway Protocol)? It is an interautonomous system routing protocol and is based on a routing method called path vector routing.
71