利用Szemeredi正则引理表征大型网络中最大最小公平性能

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI:10.1109/ISIT.2007.4557218

M. Wiczanowski, H. Boche, S. Stańczak

{"title":"利用Szemeredi正则引理表征大型网络中最大最小公平性能","authors":"M. Wiczanowski, H. Boche, S. Stańczak","doi":"10.1109/ISIT.2007.4557218","DOIUrl":null,"url":null,"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.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Characterization of max-min fair performance in large networks via Szemeredi's Regularity Lemma\",\"authors\":\"M. Wiczanowski, H. Boche, S. Stańczak\",\"doi\":\"10.1109/ISIT.2007.4557218\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在本文中，我们给出了具有任意信道衰落的大型单跳网络的最大最小公平性能的渐近几乎确定的下界和上界。我们的结果在本质上是渐近的，我们考虑了链接(用户)的数量趋于无穷大的两种极限情况。所提供的界既适用于正交网络，也适用于一类特殊的非正交网络。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Characterization of max-min fair performance in large networks via Szemeredi's Regularity Lemma

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE International Symposium on Information Theory

自引率

0.00%

发文量