131:" interface (an interface that frequently changes its state between "up" and "down") might cause conflicting information to propagate throughout the network so the routers never agree on its current state. Under certain circumstances it might be desirable to withhold detailed routing information from parts of the network via
80:
When a routing protocol process is enabled, every participating router will attempt to exchange information about the topology of the network. The extent of this information exchange, the way it is sent and received, and the type of information required vary widely depending on the routing protocol
119:
RIP is a routing protocol that converges so slowly that even a network of a few routers can take a couple of minutes to converge. In case of a new route being advertised, triggered updates can speed up RIP's convergence but to flush a route that previously existed takes longer due to the
53:, the information they gathered must not contradict any other router's topology information in the set, and it must reflect the real state of the network. In other words: in a converged network all routers "agree" on what the network topology looks like.
116:, which should implement a mechanism that allows all routers running the protocol to quickly and reliably converge. Of course, the size of the network also plays an important role. A larger network will converge more slowly than a smaller one.
96:
A state of convergence is achieved once all routing protocol-specific information has been distributed to all routers participating in the routing protocol process. Any change in the network that affects
19:
This article is about the convergence of topology information in a set of routers. For the combined transport of voice, video, and data over the same network infrastructure, see
261:
112:
is a measure of how fast a group of routers reach the state of convergence. It is one of the main design goals and an important performance indicator for
124:
timers in use. OSPF is an example of a fast-converging routing protocol. A network of a few OSPF routers can converge in a matter of seconds.
245:
269:
206:
296:
165:
82:
65:
24:
101:
will break the convergence temporarily until this change has been successfully communicated to all other routers.
61:
170:
86:
64:
rely on convergence to function properly. "To have, or be, converged" is the normal state of an operational
180:
127:
Certain configuration and hardware conditions will prevent a network from ever converging. For instance, a "
90:
72:
typically never converges because the
Internet is too big for changes to be communicated fast enough.
20:
49:, they must have collected all available topology information from each other via the implemented
150:
34:
237:
227:
241:
132:
301:
155:
113:
50:
38:
160:
57:
135:, thereby speeding up convergence of the topological information shared by all routers.
185:
128:
290:
265:
98:
42:
233:
121:
145:
56:
Convergence is an important notion for a set of routers that engage in
175:
16:
Agreement of a set of routers on the surrounding network topology
69:
207:"Understanding the protocols underlying dynamic routing"
45:
in which they operate. For a set of routers to have
8:
68:. The Exterior Gateway Routing Protocol
229:CCNP 1 Advanced Routing Companion Guide
198:
7:
262:"Networking Protocol Configurations"
209:. CNET Networks, Inc. 24 July 2001
14:
1:
166:Routing Information Protocol
318:
62:interior gateway protocols
18:
33:is the state of a set of
171:Open Shortest Path First
181:Border Gateway Protocol
41:information about the
23:. For other uses, see
297:Computer networking
76:Convergence process
37:that have the same
21:Network convergence
236:. 2004. pp.
133:route aggregation
114:routing protocols
81:in use, see e.g.
66:autonomous system
309:
281:
280:
278:
277:
268:. Archived from
258:
252:
251:
232:. Indianapolis:
224:
218:
217:
215:
214:
203:
156:Routing protocol
110:Convergence time
105:Convergence time
51:routing protocol
317:
316:
312:
311:
310:
308:
307:
306:
287:
286:
285:
284:
275:
273:
260:
259:
255:
248:
226:
225:
221:
212:
210:
205:
204:
200:
195:
190:
161:Dynamic routing
141:
107:
78:
58:dynamic routing
28:
17:
12:
11:
5:
315:
313:
305:
304:
299:
289:
288:
283:
282:
253:
246:
219:
197:
196:
194:
191:
189:
188:
186:Route flapping
183:
178:
173:
168:
163:
158:
153:
148:
142:
140:
137:
106:
103:
99:routing tables
77:
74:
15:
13:
10:
9:
6:
4:
3:
2:
314:
303:
300:
298:
295:
294:
292:
272:on 2007-05-27
271:
267:
266:Cisco Systems
263:
257:
254:
249:
247:1-58713-135-8
243:
239:
235:
231:
230:
223:
220:
208:
202:
199:
192:
187:
184:
182:
179:
177:
174:
172:
169:
167:
164:
162:
159:
157:
154:
152:
149:
147:
144:
143:
138:
136:
134:
130:
125:
123:
117:
115:
111:
104:
102:
100:
94:
92:
88:
84:
75:
73:
71:
67:
63:
59:
54:
52:
48:
44:
40:
36:
32:
26:
22:
274:. Retrieved
270:the original
256:
228:
222:
211:. Retrieved
201:
126:
118:
109:
108:
95:
79:
55:
46:
43:internetwork
30:
29:
234:Cisco Press
39:topological
31:Convergence
25:Convergence
291:Categories
276:2008-10-16
213:2014-11-26
193:References
47:converged
139:See also
129:flapping
122:holddown
302:Routing
146:Routing
35:routers
244:
151:Router
60:. All
176:IS-IS
242:ISBN
91:BGP4
87:OSPF
238:93f
83:RIP
70:BGP
293::
264:.
240:.
93:.
89:,
85:,
279:.
250:.
216:.
27:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.