Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Servicii Diferențiate (DiffServ)× | Open Shortest Path First (OSPF)× | Algoritmul Token Bucket pentru limitarea ratei× | |
|---|---|---|---|
| Domeniu | Telecomunicații | Telecomunicații | Telecomunicații |
| Familie | Process / pipeline | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1998 | 1998 | 1986 |
| Autorul original≠ | IETF DiffServ Working Group | John Moy | Jon Turner |
| Tip≠ | QoS architecture | link-state routing protocol | rate limiting algorithm |
| Sursa seminală≠ | Blake, S., Black, D., Carlson, M., et al. (1998). An Architecture for Differentiated Services. RFC 2475. 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 ↗ |
| Denumiri alternative | quality of service, QoS architecture | link-state routing, intra-domain routing | traffic shaping, rate limiting |
| Înrudite≠ | 3 | 2 | 2 |
| Rezumat≠ | DiffServ is a QoS architecture providing scalable, class-based service differentiation in networks. Introduced by IETF (1998), DiffServ marks packets with a Differentiated Services Code Point (DSCP) in the IP header, enabling routers to apply per-hop-behaviors (PHBs) based on markings. Unlike IntServ (which reserves resources per-flow), DiffServ is stateless and scalable to Internet scale. DiffServ remains the primary QoS mechanism in ISP and enterprise networks. | 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. |
| ScholarGateSet de date ↗ |
|
|
|