مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| سرویسهای متمایز (DiffServ)× | پروتکل دروازه مرزی (BGP)× | الگوریتم محدودسازی نرخ سطل توکن× | |
|---|---|---|---|
| حوزه | مخابرات | مخابرات | مخابرات |
| خانواده | Process / pipeline | Process / pipeline | Process / pipeline |
| سال پیدایش≠ | 1998 | 1989 | 1986 |
| پدیدآور≠ | IETF DiffServ Working Group | IETF Routing Protocols Working Group | Jon Turner |
| نوع≠ | QoS architecture | path-vector routing protocol | rate limiting algorithm |
| منبع بنیادین≠ | Blake, S., Black, D., Carlson, M., et al. (1998). An Architecture for Differentiated Services. RFC 2475. link ↗ | Rekhter, Y., Li, T., & Hares, S. (2006). A Border Gateway Protocol 4 (BGP-4). RFC 4271. link ↗ | Turner, J. S. (1986). New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24(10), 8-15. link ↗ |
| نامهای دیگر | quality of service, QoS architecture | exterior gateway protocol, inter-domain routing | traffic shaping, rate limiting |
| مرتبط≠ | 3 | 2 | 2 |
| خلاصه≠ | 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. | 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. | 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مجموعهداده ↗ |
|
|
|