2010 22nd International Teletraffic Congress (lTC 22)最新文献_第2页

Design and analysis of multi-carrier multiple access systems without feedback 无反馈多载波多址系统的设计与分析

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608721

G. Peeters, B. V. Houdt

引用次数: 4

Mobile data traffic analysis: How do you prefer watching videos? 移动数据流量分析:你喜欢如何观看视频?

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608719

Louis Plissonneau, Guillaume Vu Brugier

{"title":"Mobile data traffic analysis: How do you prefer watching videos?","authors":"Louis Plissonneau, Guillaume Vu Brugier","doi":"10.1109/ITC.2010.5608719","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608719","url":null,"abstract":"In this paper, we analyze an anonymized packet trace of mobile handset data traffic from a major European mobile Internet Service Provider (ISP). Our goal is to understand the effect of the differences between this traffic and the traffic in wired residential networks. This knowledge can be useful for adapting the network to specific mobile usage. We show that, compared to wired users, mobile users exchange data with fewer servers. We then evaluate the performance at flow level, and study the influence of the access type (2G or 3G). In particular, we quantify the improvement provided by a 3G access in terms of delays and throughput. To figure out the user experience, we focus on a popular usage: media streaming. We measure performance metrics for the two main content diffusion techniques: ISP-managed live TV and progressive download (PDL, e.g. YouTube or Deezer). We observe that live TV streams only suffer from moderate packet losses thanks to conservative encoding bitrates chosen according to the radio access type. As for progressive download, while audio streams generally cope well with mobile networks, only 3G users experience smooth video playback. Through the analysis of session durations, we determine the effect of the Radio Access Type on the user experience.We notably show that users react to impaired network conditions by aborting their streaming sessions. We also highlight usage differences between live TV and PDL.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129466628","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}

引用次数: 15

Application-based feature selection for Internet traffic classification 基于应用的互联网流量分类特征选择

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608734

T. En-Najjary, G. Urvoy-Keller, M. Pietrzyk, Jean-Laurent Costeux

{"title":"Application-based feature selection for Internet traffic classification","authors":"T. En-Najjary, G. Urvoy-Keller, M. Pietrzyk, Jean-Laurent Costeux","doi":"10.1109/ITC.2010.5608734","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608734","url":null,"abstract":"Recently, several statistical techniques using flow features have been proposed to address the problem of traffic classification. These methods achieve in general high recognition rates of the dominant applications and more random results for less popular ones. This stems from the selection process of the flow features, used as inputs of the statistical algorithm, which is biased toward those dominant applications. As a consequence, existing methods are difficult to adapt to the changing needs of network administrators that might want to quickly identify dominant applications like p2p or HTTP based applications or to zoom on specific less popular (in terms of bytes or flows) applications on a given site, which could be HTTP streaming or Gnutella for instance. We propose a new approach, aimed to address the above mentioned issues, based on logistic regression. Our technique can automatically select distinct, per-application features that best separate each application from the rest of the traffic. In addition, it has a low computation cost and needs only to inspect the first few packets of a flow to classify it, which means that it can be implemented in real time. We exemplify our method using two recent traces collected on two ADSL platforms of a large ISP.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114730553","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}

引用次数: 22

Improvements to LISP Mobile Node LISP移动节点的改进

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608725

M. Menth, D. Klein, Matthias Hartmann

引用次数: 39

DiffServ pricing games in multi-class queueing network models 多类别排队网络模型中的diffserver定价博弈

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608737

Parijat Dube, R. Jain

引用次数: 3

Efficiency of caches for content distribution on the Internet Internet上内容分发的缓存效率

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608730

G. Haßlinger, O. Hohlfeld

{"title":"Efficiency of caches for content distribution on the Internet","authors":"G. Haßlinger, O. Hohlfeld","doi":"10.1109/ITC.2010.5608730","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608730","url":null,"abstract":"Traffic engineering and an economical provisioning of bandwidth is crucial for network providers in times of high competition in broadband access networks. We investigate the efficiency of caching as an option to shorten end-to-end paths and delays while at the same time reducing traffic loads. The portion of HTTP based distribution of cacheable content on the Internet is increasing in recent time. In addition, the favourable effect of Zipf-like access pattern on caches is also confirmed for currently most popular web sites with user generated content. Content delivery (CDN) and peer-to-peer (P2P) networks are distributing a major portion of IP traffic with different impact on caching. P2P traffic is subject to long transport paths although appropriate for caching in principle. CDNs are based on server infrastructures allowing for shorter paths on a global scale on top of network provider platforms. We give a brief overview of the options for deploying caches by content and network providers at different points in the interconnection, backbone or aggregation. The main part of the work focuses on the analysis of replacement strategies with regard to Zipf-like and fixed or slowly varying access pattern. A comparative evaluation shows that least recently used (LRU) essentially differs from caching strategies based on access statistics in terms of the achievable hit rates.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115317658","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}

引用次数: 27

Tunable privacy for access controlled data in peer-to-peer systems 点对点系统中访问控制数据的可调隐私

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608723

Rammohan Narendula, Thanasis G. Papaioannou, Z. Miklós, K. Aberer

{"title":"Tunable privacy for access controlled data in peer-to-peer systems","authors":"Rammohan Narendula, Thanasis G. Papaioannou, Z. Miklós, K. Aberer","doi":"10.1109/ITC.2010.5608723","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608723","url":null,"abstract":"Peer-to-peer paradigm is increasingly employed for organizing distributed resources for various applications, e.g. content distribution, open storage grid etc. In open environments, even when proper access control mechanisms supervise the access to the resources, privacy issues may arise depending on the application. In this paper, we introduce, PANACEA, a system that offers high and tunable privacy based on an innovative resource indexing approach. In our case, privacy has two aspects: the deducibility of a resource's existence/non-existence and the discovery of the provider of the resource. We systematically study the privacy that can be provided by the proposed system and compare its effectiveness as related to conventional P2P systems. Employing both probabilistic and information-theoretic approaches, we analytically derive that PANACEA can offer high privacy, while preserving high search efficiency for authorized users. Our analysis and the effectiveness of the approach have been experimentally verified. Moreover, the privacy offered by the proposed system can be tuned according to the specific application needs, which is illustrated with a detailed simulation study.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128579232","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}

引用次数: 4

Wireless multi-hop networks with stealing: Large buffer asymptotics 带窃取的无线多跳网络:大缓冲区渐近性

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608735

F. Guillemin, C. Knessl, J. V. Leeuwaarden

引用次数: 4

Using concurrent multipath transmission for Transport Virtualization: Analyzing path selection 在传输虚拟化中使用并发多路径传输:路径选择分析

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608711

T. Zinner, K. Tutschku, A. Nakao, P. Tran-Gia

引用次数: 21

On the bias of BFS (Breadth First Search) 关于广度优先搜索的偏差

2010 22nd International Teletraffic Congress (lTC 22) Pub Date : 2010-10-25 DOI: 10.1109/ITC.2010.5608727

M. Kurant, A. Markopoulou, Patrick Thiran

{"title":"On the bias of BFS (Breadth First Search)","authors":"M. Kurant, A. Markopoulou, Patrick Thiran","doi":"10.1109/ITC.2010.5608727","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608727","url":null,"abstract":"Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empirically observed that incomplete BFS is biased toward high degree nodes. In contrast to more studied sampling techniques, such as random walks, the bias of BFS has not been characterized to date. In this paper, we quantify the degree bias of BFS sampling. In particular, we calculate the node degree distribution expected to be observed by BFS as a function of the fraction of covered nodes, in a random graph RG(pk) with a given (and arbitrary) degree distribution pk. Furthermore, we also show that, for RG(pk), all commonly used graph traversal techniques (BFS, DFS, Forest Fire, and Snowball Sampling) lead to the same bias, and we show how to correct for this bias. To give a broader perspective, we compare this class of exploration techniques to random walks that are well-studied and easier to analyze. Next, we study by simulation the effect of graph properties not captured directly by our model. We find that the bias gets amplified in graphs with strong positive assortativity. Finally, we demonstrate the above results by sampling the Facebook social network, and we provide some practical guidelines for graph sampling in practice.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122233321","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}

引用次数: 152