Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Open Shortest Path First (OSPF)× | Algoritmo de limitación de tasa de cubo de tokens× | |
|---|---|---|
| Campo | Telecomunicaciones | Telecomunicaciones |
| Familia | Process / pipeline | Process / pipeline |
| Año de origen≠ | 1998 | 1986 |
| Autor original≠ | John Moy | Jon Turner |
| Tipo≠ | link-state routing protocol | rate limiting algorithm |
| Fuente seminal≠ | 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 ↗ |
| Alias | link-state routing, intra-domain routing | traffic shaping, rate limiting |
| Relacionados | 2 | 2 |
| Resumen≠ | 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. |
| ScholarGateConjunto de datos ↗ |
|
|