A composable service model with loss and a scheduling algorithm

We show the composability of a new service model that we propose, which incorporates packet loss. The new model is based on guaranteeing at least a certain fraction of the all packets of a flow, which is to be served through a network element, to meet their deadlines assigned, via a service curve. We also propose a scheduling algorithm to deliver the services as specified by the new service model at a multiplexer. The correctness of the proposed algorithm is also shown

[1]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[2]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[3]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[4]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[5]  Jon Crowcroft,et al.  Analysis of Burstiness and Jitter in Real-Time Communications , 1993, SIGCOMM.

[6]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[7]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[8]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[9]  Madhu Sudan,et al.  Priority encoding transmission , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  P. Hall.  On Representatives of Subsets , 1935 .

[11]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[13]  Rene L. Cruz,et al.  A service-curve model with loss and a multiplexing problem , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[14]  Rene L. Cruz,et al.  Feasibility of serving packet streams with delay and loss requirements , 2001 .

[15]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[16]  George C. Polyzos,et al.  A service-curve approach to performance guarantees in integrated-service networks , 1996 .

[17]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[18]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.