TY - JOUR
T1 - A new deterministic traffic model for core-stateless scheduling
AU - Cheng, Gang
AU - Zhu, Li
AU - Ansari, Nirwan
N1 - Funding Information:
Paper approved by A. Pattavina, the Editor for Switching Architecture Performance of the IEEE Communications Society. Manuscript received August 5, 2003; revised October 8, 2004, and September 25, 2005. This work was supported in part by the New Jersey Commission on Higher Education via the NJ I-TOWER Project and the New Jersey Commission on Science and Technology via the NJ Center for Wireless Networks and Internet Security. This paper was presented in part at the IEEE GLOBECOM, San Francisco, CA, 2003.
PY - 2006/4
Y1 - 2006/4
N2 - Core-stateless scheduling algorithms have been proposed in the literature to overcome the scalability problem of the stateful approach. Instead of maintaining per-flow information or performing per-packet flow classification at core routers, packets are scheduled according to the information (time stamps) carried in their headers. They can hence provision quality of service (QoS) and achieve high scalability. In this paper, which came from our observation that it is more convenient to evaluate a packet's delay in a core-stateless network with reference to its time stamp than to the real time, we propose a new traffic model and derive its properties. Based on this model, a novel time-stamp encoding scheme, which is theoretically proven to be able to minimize the end-to-end worst case delay in a core-stateless network, is presented. With our proposed traffic model, performance analysis in core-stateless networks becomes straightforward.
AB - Core-stateless scheduling algorithms have been proposed in the literature to overcome the scalability problem of the stateful approach. Instead of maintaining per-flow information or performing per-packet flow classification at core routers, packets are scheduled according to the information (time stamps) carried in their headers. They can hence provision quality of service (QoS) and achieve high scalability. In this paper, which came from our observation that it is more convenient to evaluate a packet's delay in a core-stateless network with reference to its time stamp than to the real time, we propose a new traffic model and derive its properties. Based on this model, a novel time-stamp encoding scheme, which is theoretically proven to be able to minimize the end-to-end worst case delay in a core-stateless network, is presented. With our proposed traffic model, performance analysis in core-stateless networks becomes straightforward.
KW - Core-stateless network
KW - Quality of service (QoS)
KW - Traffic model
KW - Traffic scheduling
UR - http://www.scopus.com/inward/record.url?scp=33645990299&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645990299&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2006.873091
DO - 10.1109/TCOMM.2006.873091
M3 - Article
AN - SCOPUS:33645990299
SN - 0090-6778
VL - 54
SP - 704
EP - 713
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 4
ER -