VCSVC: Vector Core Stateless Virtual Clock
Meilin Shi · Journal of Chinese Computer Systems · 2006
Proposed a new core stateless packet scheduling algorithm that can allocate accurate reserved bandwidth to each flow at each traversed node,called VCSVC(Vector Core Stateless Virtual Clock).This algorithm lays the foundation for implementing core stateless fair queuing in deterministic ways that those existing core stateless algorithms can′t guarantee.In VCSVC,the ingress node will compute virtual delays for each injected packet at every node along its path and encode them as a virtual delay vector into the packet header.All core nodes serve packets according to their virtual delays.Core nodes don′t perform per flow management,and therefore have high scalability.The distance granularity approach was presented to bound the encoding length of the virtual delay vector and the extra delay brought by this method was analyzed.