2010 22nd International Teletraffic Congress (lTC 22)最新文献

{"title":"Balancing SRPT prioritization vs opportunistic gain in wireless systems with flow dynamics","authors":"B. Sadiq, G. Veciana","doi":"10.1109/ITC.2010.5608716","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608716","url":null,"abstract":"The problem of scheduling best effort flows from a dynamic population sharing a time varying wireless channel, with the objective of minimizing mean sojourn time is considered. The key tradeoff involved is between prioritizing flows with short residual sizes and maximizing opportunistic capacity gain by selecting flows that currently see good channels. This tradeoff is explicitly characterized by introducing a new queueing model that involves servers with state-dependent capacity regions. In the transient case and for (bounding) polymatroid capacity regions, the optimal scheduler is given and used to obtain sub-optimality bounds for various heuristics. Using a mix of analysis and simulation two regimes are described: one where fully exploiting opportunistic gain is sufficient and further using residual flow sizes for scheduling will result in only minimal reduction in mean sojourn time, and the other, where the use of this information can indeed offer significant reduction. A new scheduler is proposed which performs well in both regimes.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128481249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Can multipath mitigate power law delays? - Effects of parallelism on tail performance","authors":"Jian Tan, Wei Wei, Bo Jiang, N. Shroff, D. Towsley","doi":"10.1145/1811039.1811097","DOIUrl":"https://doi.org/10.1145/1811039.1811097","url":null,"abstract":"Parallelism has often been used to improve the reliability and efficiency of a variety of different engineering systems. In this paper, we quantify the efficiency of parallelism in systems that are prone to failures and exhibit power law processing durations. We focus on the context of transmitting a data unit in communication networks, where parallelism can be achieved by multipath transmission (e.g., multipath routing). We investigate two types of transmission schemes: redundant and split transmission techniques. We find that the power-law transmission delay phenomenon still persists with multipath transmission. In particular, we show that when the transmission delays of each path are characterized by the same power law, redundant multipath transmission can only result in a constant factor performance gain, while order gains are possible when the delays are light tailed. We further compare the performance of redundant transmission and split transmission, and show that there is no clear winner. Depending on the packet size distribution properties and the manner in which splitting is performed, one scheme results in greater performance over the other. Specifically, split transmission is effective in mitigating power law delays if the absolute value of the logarithm of the packet size probability tail is regularly varying with positive index, and becomes ineffective if the above quantity is slowly varying. Based on our analysis, we develop an optimal split transmission strategy, and show that this strategy always outperforms redundant transmission.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121694725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Inferring applications at the network layer using collective traffic statistics","authors":"Yu Jin, N. Duffield, P. Haffner, S. Sen, Zhi-Li Zhang","doi":"10.1145/1811039.1811082","DOIUrl":"https://doi.org/10.1145/1811039.1811082","url":null,"abstract":"Operating, managing and securing networks require a thorough understanding of the demands placed on the network by the endpoints it interconnects, the characteristics of the traffic the endpoints generate, and the distribution of that traffic over the resources of the network infrastructure. A major differentiator in the types of resource required by traffic is the class of endpoint application that generates it. Service providers determine the application mix present in traffic via measurements, e.g., flow measurements furnished by routers. Previous work has shown that a fairly accurate determination of application type can be made from this data. However, protocol level information, such as TCP/UDP ports and other parts of the transport header, and also parts of the network header in some cases, may not be accessible due to the use of encryption or tunneling protocols by endpoints or gateways. Furthermore, the utility of ports as signifiers of application type has some limitations due to abuse and non-standard usage, amongst other reasons. These factors reduce the classification accuracy. In this paper, we propose a novel technique for inferring the distribution of application classes present in the aggregated traffic flows between endpoints, that exploits both the measured statistics of the traffic flows, and the spatial distribution of those flows across the network. Our method employs a two-step supervised model, where the bootstrapping step provides initial (inaccurate) inference on the traffic application classes, and the graph-based calibration step adjusts the initial inference through the collective spatial traffic distribution. In evaluations using real traffic flow measurements from a large ISP, we show how our method can accurately classify application types within aggregate traffic between endpoints, even without knowledge of ports and other traffic features. While the bootstrap estimate classifies the aggregates with 80% accuracy, incorporating spatial distributions through calibration increases the accuracy to 92%, i.e., roughly halving the number of errors.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130089888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Traffic capacity of large WDM passive optical networks","authors":"Nelson Antunes, C. Fricker, P. Robert, James W. Roberts","doi":"10.1109/ITC.2010.5608742","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608742","url":null,"abstract":"As passive optical networks (PON) are increasingly deployed to provide high speed Internet access, it is important to understand their fundamental traffic capacity limits. The paper discusses performance models applicable to wavelength division multiplexing (WDM) EPONs and GPONs under the assumption that users access the fibre via optical network units equipped with tunable transmitters. The considered stochastic models are based on multiserver polling systems for which explicit analytical results are not known. A large system asymptotic, mean-field approximation is used to derive closed form solutions of these complex systems. Convergence of the mean field dynamics is proved in the case of a simple network configuration. Simulation results show that, for a realistic sized PON, the mean field approximation is accurate.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"154 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131362623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On resource aware algorithms in epidemic live streaming","authors":"F. Mathieu, Diego Perino","doi":"10.1109/ITC.2010.5608724","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608724","url":null,"abstract":"Epidemic-style diffusion schemes have been previously proposed for achieving peer-to-peer live streaming. Their performance trade-offs have been extensively studied for homogeneous systems, where all peers have the same upload capacity. However, epidemic schemes designed for heterogeneous systems have not been completely understood yet.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114616970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}