Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Протокол за гранично прехвърляне (BGP)× | Open Shortest Path First (OSPF)× | Алгоритъм за ограничаване на скоростта с буфер за токени× | |
|---|---|---|---|
| Област | Телекомуникации | Телекомуникации | Телекомуникации |
| Семейство | Process / pipeline | Process / pipeline | Process / pipeline |
| Година на възникване≠ | 1989 | 1998 | 1986 |
| Създател≠ | IETF Routing Protocols Working Group | John Moy | Jon Turner |
| Тип≠ | path-vector routing protocol | link-state routing protocol | rate limiting algorithm |
| Основополагащ източник≠ | Rekhter, Y., Li, T., & Hares, S. (2006). A Border Gateway Protocol 4 (BGP-4). RFC 4271. link ↗ | Moy, J. T. (1998). OSPF Version 2. RFC 2328. link ↗ | Turner, J. S. (1986). New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24(10), 8-15. link ↗ |
| Други названия | exterior gateway protocol, inter-domain routing | link-state routing, intra-domain routing | traffic shaping, rate limiting |
| Свързани | 2 | 2 | 2 |
| Резюме≠ | BGP is the de facto standard routing protocol for interconnecting autonomous systems (ASs) on the Internet. Since its introduction in 1989, BGP has scaled the Internet to millions of routers and trillions of destinations. BGP is path-vector-based, using a flexible policy system to control route propagation and selection. While BGP convergence can be slow and policies complex, it remains the only viable protocol for Internet-scale inter-domain routing. | OSPF is a link-state interior gateway protocol (IGP) for routing within an autonomous system. Introduced by John Moy in 1998, OSPF converges faster than distance-vector protocols and supports equal-cost multipath (ECMP). It remains widely deployed in enterprise and ISP networks for intra-domain routing, though IS-IS is increasingly preferred in large backbones. | Token bucket is a simple and elegant algorithm for traffic shaping and rate limiting. A virtual bucket accumulates tokens at a fixed rate (the committed information rate). Incoming packets consume tokens (one token per byte); packets are transmitted only if sufficient tokens are available. If the bucket is full, excess tokens are discarded (no carry-over). Token bucket bounds peak rate and allows controlled bursts, making it ideal for traffic management in networks. |
| ScholarGateНабор от данни ↗ |
|
|
|