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

Congestion avoidance in S-CSCF selection in an IMS network IMS网络中S-CSCF选择的拥塞避免

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

Plarent Tirana, D. Medhi

引用次数: 2

Optimal concurrent access strategies in mobile communication networks 移动通信网络中的最优并发访问策略

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

S. Bhulai, G. Hoekstra, R. Mei

引用次数: 2

Out of my way - evaluating Low Extra Delay Background Transport in an ADSL access network 在ADSL接入网中评估低额外延迟背景传输

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

J. Schneider, Jörg Wagner, R. Winter, H. Kolbe

{"title":"Out of my way - evaluating Low Extra Delay Background Transport in an ADSL access network","authors":"J. Schneider, Jörg Wagner, R. Winter, H. Kolbe","doi":"10.1109/ITC.2010.5608714","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608714","url":null,"abstract":"The most common broadband access technology today is the (Asymmetric) Digital Subscriber Line (A)DSL. As the name implies, ADSL allocates the bandwidth of upstream and downstream asymmetrically, significantly favoring the downstream direction. Popular applications that serve content over these networks in the upstream direction, such as peer-to-peer (P2P) applications, efficiently utilize the comparably small uplink capacity but potentially disturb inelastic traffic (e.g. voice or games) with an intolerable delay penalty. Effectively, this can render these applications useless. In order to solve this problem, a new delay-based congestion control for this type of P2P background traffic has been proposed. It attempts to utilize the full upstream capacity in the absence of other traffic, otherwise yields to that traffic. This paper describes an implementation and analysis of this new congestion control algorithm in a realistic DSL laboratory setup using a production Multiservice Access Node (MSAN). Using a variety of DSL modems and settings, this worse-than-best-effort transport protocol is further compared to alternative means solving the same problem.","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":"116447960","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}

引用次数: 36

Estimating the access link quality by active measurements 通过主动测量估计接入链路质量

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

Roberto G. Cascella, C. Barakat

{"title":"Estimating the access link quality by active measurements","authors":"Roberto G. Cascella, C. Barakat","doi":"10.1109/ITC.2010.5608738","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608738","url":null,"abstract":"The access link quality experienced by the end users depends on the amount of traffic and on the presence of network anomalies. Different techniques exist to detect anomalies, but little attention has been devoted to quantify the access link quality and to which extent network anomalies affect the end user's access link experience. We refer to this aspect as the impact factor of the anomaly, that we define as the percentage of affected destinations. In the ideal case, a node should continuously monitor all possible routes to detect any degradation in performance, but this is not practical in reality. In this paper we show how a node can estimate the quality of Internet access through a limited set of measurements. We initially study the user's access network to understand the typical features of its connectivity tree. Then, we define an unbiased estimator for the quality of access and we compute the minimum number of paths to monitor, so that the estimator achieves a desirable accuracy without knowing the underlying topology. We use real data to construct a network graph and we validate our solution by causing a large number of anomalies and by comparing the real and the estimated quality of access for all available end hosts. Our results show that the impact factor is a meaningful metric to evaluate the quality of Internet access.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"30 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":"133028278","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}

引用次数: 1

Optimum packet length masking 最佳包长掩码

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

Alfonso Iacovazzi, A. Baiocchi

引用次数: 23

Efficient computation of queueing delay at a network port from output link packet traces 从输出链路数据包轨迹有效地计算网络端口的排队延迟

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

M. F. Habib, M. Molle

{"title":"Efficient computation of queueing delay at a network port from output link packet traces","authors":"M. F. Habib, M. Molle","doi":"10.1109/ITC.2010.5608732","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608732","url":null,"abstract":"Current Internet core routers provide enough buffer capacity at each output port to keep the link busy for 250 msec. to avoid disrupting TCP flows because of dropped packets. Since link speeds are rising much more quickly than the availability and cost-effectiveness of large high-speed memories, there is now significant interest in reducing these buffers. Queue inferencing (QI) — a passive, external method for calculating the time-dependent queue lengths and waiting times using start/end service event timestamps — is an ideal tool for studying the effects of such buffer size reductions because it can be applied in situ to packet traces collected from existing equipment carrying live traffic without any service disruptions. Although existing QI algorithms are too computationally expensive for this purpose, we observe that packet-sizes in a typical network trace are skewed towards a few “favored” sizes, and introduce two different methods for exploiting this property. First, since the output of a QI algorithm is a deterministic function of the service time sequence in a busy period, and our traces contain many repetitions of common packet-size sequences, we cache the output of the QI algorithm for later reuse. Second, we develop a new incremental QI algorithm, which can start from cached results for any prefix of the current busy period. Combining both methods leads us to structure the cache as a decision tree. Using network traces from WIDE project backbone to evaluate our method, we found that both the frequency of occurrence for particular busy periods and for busy-period lengths follow a decreasing power law, where busy periods lengths greater than 20 were very rare and none were greater than 70. Moreover, although we found that the size of the complete decision tree grows linearly with the length of the trace, we can restrict the tree to a finite number of “active” nodes (i.e., those nodes for which the probability of a visit is above some threshold) and use simple constant-time bounds to handle the rare exceptional cases.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"80 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":"124869834","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}

引用次数: 0

How to share the cost of cooperating queues in a tandem network? 如何在串联网络中分担协作队列的成本?

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

J. Timmer, W. Scheinhardt

引用次数: 15

Network protection against worms and cascading failures using modularity partitioning 使用模块化分区防止蠕虫和级联故障的网络保护

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

Jasmina Omic, Javier Martín Hernández, P. Mieghem

引用次数: 19

Performance analysis of traffic surges in multi-class communication networks 多类通信网络中流量激增的性能分析

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

M. Jonckheere, R. N. Queija, B. Prabhu

{"title":"Performance analysis of traffic surges in multi-class communication networks","authors":"M. Jonckheere, R. N. Queija, B. Prabhu","doi":"10.1109/ITC.2010.5608726","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608726","url":null,"abstract":"In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms allowing the conservation of the quality of service experienced by the affected classes, while ensuring that the temporarily unstable class is not entirely neglected. In this paper, we examine - for a suitably-scaled set of parameters - the complex interaction occurring between several classes of traffic when an unstable class is penalized proportionally to its level of congestion. We characterize the evolution of the performance measures of the network from the moment the initial surge takes place until the system reaches its equilibrium. We show that, using a time-space-transition-scaling, the trajectories of the temporarily unstable class can be described by a differential equation, while those of the stable classes retain their stochastic nature. In particular, we show that the temporarily unstable class evolves at a time-scale which is much slower than that of the stable classes. Although the time-scales decouple, the dynamics of the temporarily unstable and the stable classes continue to influence one another. We further proceed to characterize the obtained differential equations for several simple network examples. In particular, the macroscopic asymptotic behavior of the unstable class allows us to gain important qualitative insights on how the bandwidth allocation affects performance.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"33 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":"124465607","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}

引用次数: 6

QoS and channel aware packet bundling for VoIP and data traffic in multi-carrier cellular networks 多载波蜂窝网络中用于VoIP和数据流量的QoS和信道感知分组捆绑

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

C. Beard, Baek-Young Choi, Hyungbae Park

{"title":"QoS and channel aware packet bundling for VoIP and data traffic in multi-carrier cellular networks","authors":"C. Beard, Baek-Young Choi, Hyungbae Park","doi":"10.1109/ITC.2010.5608743","DOIUrl":"https://doi.org/10.1109/ITC.2010.5608743","url":null,"abstract":"We study the problem of multiple packet bundling in multi-carrier cellular networks for VoIP and data traffic. In a time-slotted system such as the cdma2000 1xEV-DO downlink, part of a time-slot may not be fully utilized, if the packet sizes are small, as in the case of real-time VoIP traffic. Packet bundling can alleviate such a problem by sharing a time slot among multiple users, as proposed in the EV-DO Revision A system. A recent revision, EV-DO Revision B, enables further increased system capacity through multiple carriers. However, the efficacy of packet bundling, especially across multiple carriers, is not well understood. When packets are bundled, the packet with the lowest channel quality dictates the modulation and coding format of the entire bundle, possibly wasting significant slot space due to unnecessary coding bits for the other packets. We first present how multiple carriers, together with packet bundling, improve spectral efficiency, but lose some of that benefit in realistic channel scenarios. Then we propose an effective heuristic algorithm to effectively exploit the multi-carrier with bundling system. We consider QoS requirements as well as time-varying and user-dependent channel conditions, and then show how channel utilization can be significantly improved while keeping delays of real-time packets limited.","PeriodicalId":110216,"journal":{"name":"2010 22nd International Teletraffic Congress (lTC 22)","volume":"14 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":"129100694","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}

引用次数: 3