Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract--Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach,
 

Summary: Abstract--Core-stateless scheduling algorithms can provide a
similar level of guaranteed services as the stateful approach,
while they do not need per-flow management. They hence possess
both the properties of Quality-of-Service (QoS) provisioning and
high scalability. In this paper, by showing the current existing
traffic models are not applicable to core-stateless networks, a new
and efficient traffic model for characterizing traffic in a core-
stateless network is proposed, and its properties are presented.
Index Terms-- Core-stateless network, traffic scheduling, QoS
I. INTRODUCTION
any integrated service architectures were proposed [1]-
[6] aiming to provide guaranteed services in packet-
switched networks. These architectures possess
properties of high flexibility and high degree of service
assurance. Since they need to maintain per-flow state and per-
packet classification, it is difficult to implement such solutions
in a scalable fashion.
In contrast to the integrated service model, the differentiated
service network architecture incorporates classification and
conditioning functions only at network boundaries, and all

  

Source: Ansari, Nirwan - Department of Electrical and Computer Engineering, New Jersey Institute of Technology

 

Collections: Engineering