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

Optimal routing in parallel, non-observable queues and the price of anarchy revisited 并行、不可观察队列的最优路由和无政府状态的代价

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

Jonatha Anselmi, B. Gaujal

{"title":"Optimal routing in parallel, non-observable queues and the price of anarchy revisited","authors":"Jonatha Anselmi, B. Gaujal","doi":"10.1109/ITC.2010.5608745","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608745","url":null,"abstract":"We consider a network of parallel, non-observable queues and analyze the “price of anarchy”, an index measuring the worst-case performance loss of a decentralized system with respect to its centralized counterpart in presence of non-cooperative users. Our analysis is undertaken from the new point of view where the router has the memory of previous dispatching choices, which significantly complicates the nature of the problem. In the regime where the demands proportionally grow with the network capacity, we provide a tight lower bound on the socially-optimal response time and a tight upper bound on the price of anarchy by means of convex programming. Then, we exploit this result to show, by simulation, that the billiard routing scheme yields a response time which is remarkably close to our lower bound, implying that billiards minimize response time. To study the added-value of non-Bernoulli routers, we introduce the “price of forgetting” and prove that it is bounded from above by two, which is tight in heavy-traffic. Finally, other structural properties are derived numerically for the price of forgetting. These claim that the benefit of having memory in the router is independent of the network size and heterogeneity, while monotonically depending on the network load only. These properties yield simple product-forms well-approximating the socially-optimal response time. 1","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"58 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":"128968084","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}

引用次数: 23

Quasi-stationary analysis for queues with temporary overload 具有临时过载的队列的拟平稳分析

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

S. K. Cheung, R. Boucherie, R. N. Queija

引用次数: 4

Using local search for traffic engineering in switched Ethernet networks 基于本地搜索的交换以太网流量工程

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

Ho Trong Viet, O. Bonaventure, Y. Deville, Pham Quang Dung, Pierre François

引用次数: 6

Optimal monitoring in large networks by Successive c-optimal Designs 连续c-最优设计在大型网络中的最优监测

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

G. Sagnol, S. Gaubert, M. Bouhtou

引用次数: 13

On the impact of sampling on traffic monitoring and analysis 浅谈采样对交通监控的影响及分析

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

A. Pescapé, D. Rossi, D. Tammaro, S. Valenti

{"title":"On the impact of sampling on traffic monitoring and analysis","authors":"A. Pescapé, D. Rossi, D. Tammaro, S. Valenti","doi":"10.1109/ITC.2010.5608718","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608718","url":null,"abstract":"Due to significant advances in transmission technology and to the corresponding increase of link rates, traffic sampling is becoming a normal way of operation in traffic monitoring. Given this trend, in this paper we aim to assess the impact of the sampling on a wide range of tasks which are typical of an operational network. We follow an experimental approach, exploiting passive analysis of network traffic flows, taking into account different sampling policies (e.g., systematic, uniform and stratified) and different sampling rates. To quantify the amount of degradation and bias that sampling introduces with respect to the unsampled traffic we use well-known statistical measures (i.e., Hellinger Distance, Fleiss Chi-Square). Unlike previous work, we consider a very large set of “features” (i.e., any kind of properties characterizing traffic flows, from packet size and inter-arrival time, to Round Trip Time, TCP congestion window size, number of out-of-order packets, etc.) which are typically exploited by a rather wide class of applications, such as traffic monitoring, analysis, accounting, and classification. Using three real traffic traces, representative of different operational networks, we find that (i) a significant degradation affects a wide number of features; (ii) the set of features less degraded is consistent across the three datasets; (iii) at the same time, some artifacts may arise, resulting in lower distortion scores at higher sampling rates, which are tied to both the specific metric, as well as the way in which the feature is computed (e.g., binning); (iv) no significant reduction of the estimation bias can be obtained by merely tweaking the sampling policy - which partly contrasts earlier observations concerning the better quality achievable with stratified sampling.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"22 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":"131278217","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}

引用次数: 21

Fastrack for taming burstiness and saving power in multi-tiered systems 在多层系统中控制突发性和节省电力的快速通道

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

Andrew Caniff, Lei Lu, N. Mi, L. Cherkasova, E. Smirni

引用次数: 24

Quality of signalling: A new concept for evaluating the performance of non-INVITE SIP transactions 信令质量:评估非invite SIP事务性能的新概念

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

Marco Happenhofer, Christoph Egger, P. Reichl

引用次数: 16

A value-based framework for internet peering agreements 基于价值的互联网对等协议框架

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

A. Dhamdhere, C. Dovrolis, Pierre François

{"title":"A value-based framework for internet peering agreements","authors":"A. Dhamdhere, C. Dovrolis, Pierre François","doi":"10.1109/ITC.2010.5608736","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608736","url":null,"abstract":"Internet Service Providers (ISPs) use complex peering policies, stipulating various rules for peering with other networks. Peering strategy is often considered a “black art” rather than science, and the outcome of a peering negotiation can depend on factors that are neither technical nor economic. Consequently, ISPs do not have a clear idea of the networks they should peer with, and the price they should demand/offer to ensure a stable peering link. We propose a quantitative framework for settlement-free and paid-peering links, based on the “value” of a peering link, i.e., the benefit that networks see from that link. We first study a solution where a centralized oracle determines a provably stable, optimal and fair price for a paid-peering link, based on perfect knowledge of the revenues and costs of each network. We next show that with perfect knowledge, the centralized solution can be implemented individually by the peering networks. We then study the effects of inaccurate estimation of peering value by the peering networks. Finally, we examine how value-based peering affects the density of peering links, the nature of end-to-end paths, and the profitability of various network types in the global Internet.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"29 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":"132591052","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}

引用次数: 44

Segmented P2P video-on-demand: Modeling and performance 分段P2P视频点播:建模与性能

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

S. Aalto, P. Lassila, Petri Savolainen, S. Tarkoma

引用次数: 3

Distributed radio resource allocation for the downlink of multi-cell OFDMA radio systems 多小区OFDMA无线电系统下行链路的分布式无线电资源分配

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

M. Moretti, A. Todini, A. Baiocchi

引用次数: 8