Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma

Marcin Wiczanowski; Holger Boche; Sławomir Stańczak

doi:10.1109/ISIT.2007.4557218

Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma

Marcin Wiczanowski, Holger Boche, Sławomir Stańczak

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.

Original language	English
Title of host publication	Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages	146-150
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2007.4557218
State	Published - 2007
Externally published	Yes
Event	2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France Duration: 24 Jun 2007 → 29 Jun 2007

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Conference

Conference	2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/Territory	France
City	Nice
Period	24/06/07 → 29/06/07

Access to Document

10.1109/ISIT.2007.4557218

Cite this

Wiczanowski, M., Boche, H., & Stańczak, S. (2007). Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma. In Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007 (pp. 146-150). Article 4557218 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2007.4557218

@inproceedings{594eeb3f95f94de4b8c89544f2a64b0c,

title = "Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma",

abstract = "In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.",

author = "Marcin Wiczanowski and Holger Boche and S{\l}awomir Sta{\'n}czak",

year = "2007",

doi = "10.1109/ISIT.2007.4557218",

language = "English",

isbn = "1424414296",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "146--150",

booktitle = "Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007",

note = "2007 IEEE International Symposium on Information Theory, ISIT 2007 ; Conference date: 24-06-2007 Through 29-06-2007",

}

Wiczanowski, M, Boche, H & Stańczak, S 2007, Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma. in Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007., 4557218, IEEE International Symposium on Information Theory - Proceedings, pp. 146-150, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 24/06/07. https://doi.org/10.1109/ISIT.2007.4557218

Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma. / Wiczanowski, Marcin; Boche, Holger; Stańczak, Sławomir.
Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007. 2007. p. 146-150 4557218 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma

AU - Wiczanowski, Marcin

AU - Boche, Holger

AU - Stańczak, Sławomir

PY - 2007

Y1 - 2007

N2 - In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.

AB - In this work, we provide asymptotically almost sure lower and upper bounds on the max-min fair performance in large single-hop networks with arbitrary channel fading. Our results are asymptotic in nature and we consider two cases of the limiting regime where the number of links (users) tends to infinity. The provided bounds apply to orthogonal networks as well as to a special class of nonorthogonal networks.

UR - http://www.scopus.com/inward/record.url?scp=51649086948&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2007.4557218

DO - 10.1109/ISIT.2007.4557218

M3 - Conference contribution

AN - SCOPUS:51649086948

SN - 1424414296

SN - 9781424414291

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 146

EP - 150

BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007

T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007

Y2 - 24 June 2007 through 29 June 2007

ER -

Characterization of max-min fair performance in large networks via Szemeredi's regularity lemma

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this