Fairness in DQDB revisited: A new solution

Kurt Maly; Stephan Olariu; Liping Zhang; Nageswara Rao

Fairness in DQDB revisited: A new solution

Kurt Maly, Stephan Olariu, Liping Zhang, Nageswara Rao

Research output: Contribution to journal › Conference article › peer-review

Abstract

The main contribution of this work is to a new way of looking at fairness in a DQDB system. Our scheme is very simple and efficient to implement and compares favorably with the leading rate-controlled schemes proposed in the literature. In addition, simulation results show that in the presence of non-uniform loads, such as a file server being brought up, our scheme converges rapidly to a fair steady state.

Original language	English
Pages (from-to)	198-204
Number of pages	7
Journal	Conference Proceedings - International Phoenix Conference on Computers and Communications
State	Published - 1995
Externally published	Yes
Event	Proceedings of the 1995 IEEE 14th Annual International Phoenix Conference on Computers and Communications - Scottsdale, AZ, USA Duration: Mar 28 1995 → Mar 31 1995

Cite this

@article{41a3d382e89d4cb39972ab6f0f2cb9ac,

title = "Fairness in DQDB revisited: A new solution",

abstract = "The main contribution of this work is to a new way of looking at fairness in a DQDB system. Our scheme is very simple and efficient to implement and compares favorably with the leading rate-controlled schemes proposed in the literature. In addition, simulation results show that in the presence of non-uniform loads, such as a file server being brought up, our scheme converges rapidly to a fair steady state.",

author = "Kurt Maly and Stephan Olariu and Liping Zhang and Nageswara Rao",

year = "1995",

language = "English",

pages = "198--204",

journal = "Conference Proceedings - International Phoenix Conference on Computers and Communications",

issn = "0896-582X",

note = "Proceedings of the 1995 IEEE 14th Annual International Phoenix Conference on Computers and Communications ; Conference date: 28-03-1995 Through 31-03-1995",

}

TY - JOUR

T1 - Fairness in DQDB revisited

T2 - Proceedings of the 1995 IEEE 14th Annual International Phoenix Conference on Computers and Communications

AU - Maly, Kurt

AU - Olariu, Stephan

AU - Zhang, Liping

AU - Rao, Nageswara

PY - 1995

Y1 - 1995

N2 - The main contribution of this work is to a new way of looking at fairness in a DQDB system. Our scheme is very simple and efficient to implement and compares favorably with the leading rate-controlled schemes proposed in the literature. In addition, simulation results show that in the presence of non-uniform loads, such as a file server being brought up, our scheme converges rapidly to a fair steady state.

AB - The main contribution of this work is to a new way of looking at fairness in a DQDB system. Our scheme is very simple and efficient to implement and compares favorably with the leading rate-controlled schemes proposed in the literature. In addition, simulation results show that in the presence of non-uniform loads, such as a file server being brought up, our scheme converges rapidly to a fair steady state.

UR - https://www.scopus.com/pages/publications/0029234584

M3 - Conference article

AN - SCOPUS:0029234584

SN - 0896-582X

SP - 198

EP - 204

JO - Conference Proceedings - International Phoenix Conference on Computers and Communications

JF - Conference Proceedings - International Phoenix Conference on Computers and Communications

Y2 - 28 March 1995 through 31 March 1995

ER -

Fairness in DQDB revisited: A new solution

Abstract

Other files and links

Fingerprint

Cite this