Please use this identifier to cite or link to this item: https://ktisis.cut.ac.cy/handle/10488/13876
DC FieldValueLanguage
dc.contributor.authorPsounis, Konstantinos-
dc.contributor.authorPapadopoulos, Fragkiskos-
dc.date.accessioned2019-05-31T08:27:20Z-
dc.date.available2019-05-31T08:27:20Z-
dc.date.issued2007-12-01-
dc.identifier.citation2007 Information Theory and Applications Workshopen_US
dc.identifier.isbn978-0-615-15314-8-
dc.description.abstractIn our earlier work [1], [2] we have presented two methods to scale down the topology of the Internet, while preserving important performance metrics. We have shown that the methods can be used to greatly simplify and expedite performance prediction. The key insight that we have leveraged is that only the congested links along the path of each flow introduce sizable queueing delays and dependencies among flows. Based on this, we have shown that it is possible to infer the performance of the larger Internet by creating and observing a suitably scaled-down replica, consisting of the congested links only. However, two main assumptions of our approach were that uncongested links are known in advance, and that the queueing delays imposed by such links are negligible. In this paper we provide rules that can be used to identify uncongested links when these are not known, and we theoretically establish the conditions under which the negligible queueing delay assumption is valid. In particular, we first identify scenarios under which one can easily deduce whether a link imposes negligible queueing by inspecting the network topology. Then, we identify scenarios in which this is not possible and use known results based on the large deviations theory to approximate the queue length distribution. Finally, we use this approximation to decide which links are uncongested, and show that in the many-sources limit the queueing delays of uncongested links are indeed negligible. Our results are verified using simulations with TCP traffic.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.titleApplication of the many sources asymptotic in downscaling Internet-like networksen_US
dc.typeConference Papersen_US
dc.collaborationUniversity of Southern Californiaen_US
dc.subject.categoryElectrical Engineering - Electronic Engineering - Information Engineeringen_US
dc.countryUSAen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
dc.relation.conferenceInformation Theory and Applications Workshopen_US
dc.identifier.doi10.1109/ITA.2007.4357597en_US
dc.identifier.scopus2-s2.0-48049086951en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/48049086951en
dc.contributor.orcid#NODATA#en
dc.contributor.orcid#NODATA#en
cut.common.academicyear2007-2008en_US
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.languageiso639-1other-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-4072-5781-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers
Show simple item record

Page view(s)

17
Last Week
0
Last month
1
checked on Sep 22, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.