Proceedings of the 2013 25th International Teletraffic Congress (ITC)最新文献

Pareto-optimal resilient controller placement in SDN-based core networks 基于sdn核心网络的pareto最优弹性控制器配置

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2014-05-05 DOI: 10.1109/NOMS.2014.6838275

D. Hock, Steffen Gebert, Matthias Hartmann, T. Zinner, P. Tran-Gia

{"title":"Pareto-optimal resilient controller placement in SDN-based core networks","authors":"D. Hock, Steffen Gebert, Matthias Hartmann, T. Zinner, P. Tran-Gia","doi":"10.1109/NOMS.2014.6838275","DOIUrl":"https://doi.org/10.1109/NOMS.2014.6838275","url":null,"abstract":"With the introduction of Software Defined Networking (SDN), the concept of an external and optionally centralized network control plane, i.e. controller, is drawing the attention of researchers and industry. A particularly important task in the SDN context is the placement of such external resources in the network. In this paper, we discuss important aspects of the controller placement problem with a focus on SDN-based core networks, including different types of resilience and failure tolerance. When several performance and resilience metrics are considered, there is usually no single best controller placement solution, but a trade-off between these metrics. We introduce our framework for resilient Pareto-based Optimal COntroller-placement (POCO) that provides the operator of a network with all Pareto-optimal placements. The ideas and mechanisms are illustrated using the Internet2 OS3E topology and further evaluated on more than 140 topologies of the Topology Zoo. In particular, our findings reveal that for most of the topologies more than 20% of all nodes need to be controllers to assure a continuous connection of all nodes to one of the controllers in any arbitrary double link or node failure scenario.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114170230","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}

引用次数: 254

Load balancing of elastic data traffic in heterogeneous wireless networks 异构无线网络中弹性数据流量的负载均衡

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662943

Abdul Khalid, P. Lassila, S. Aalto

{"title":"Load balancing of elastic data traffic in heterogeneous wireless networks","authors":"Abdul Khalid, P. Lassila, S. Aalto","doi":"10.1109/ITC.2013.6662943","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662943","url":null,"abstract":"Heterogeneous wireless networks have been introduced to enable cellular networks to handle the continuously increasing amount of mobile data traffic. In heterogeneous networks, the deployment of macrocells is accompanied by the use of low power pico and femtocells (referred to as microcells) in hotspot areas inside the macrocell, which increases the data rate per unit area. In this paper, we study the load balancing problem of elastic data traffic in heterogeneous wireless networks focusing on a single macrocell that is supported by a number of microcells. This results in a parallel queueing system where individual cells are modelled as single server processor sharing queues. Both static and dynamic load balancing schemes are developed to balance the data flows between the macrocell and the microcells so that the mean flow-level delay is minimized. The performance of static policies is evaluated by analytical and numerical methods, whereas for the dynamic policies, we need to resort to simulations. Our numerical experiments indicate that all dynamic policies can significantly improve the flow-level delay performance compared to the optimal static policy. Among the implemented policies, the so-called myopic policy appears to be systematically the best. However, also a much simpler policy with respect to the required state information, the modified join-the-shortest-queue policy, is able to achieve almost the same performance. In addition, we observe that the performance gain of most of the dynamic polices (including the myopic one) is at least approximately insensitive with respect to the flow size distribution.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129178312","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}

引用次数: 9

Incentive mechanisms based on Minority Games in heterogeneous Delay Tolerant Networks 异构容忍延迟网络中基于少数派博弈的激励机制

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662956

Wissam Chahin, Habib B. A. Sidi, R. E. Azouzi, F. Pellegrini, J. Walrand

{"title":"Incentive mechanisms based on Minority Games in heterogeneous Delay Tolerant Networks","authors":"Wissam Chahin, Habib B. A. Sidi, R. E. Azouzi, F. Pellegrini, J. Walrand","doi":"10.1109/ITC.2013.6662956","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662956","url":null,"abstract":"In this paper we design an incentive mechanism for heterogeneous Delay Tolerant Networks (DTNs). The proposed mechanism tackles a core problem of such systems: how to induce coordination of DTN relays in order to achieve a target performance figure, e.g., delivery probability or end-to-end delay, under a given constraint in term of network resources, e.g., number of active nodes or energy consumption. Also, we account for the realistic case when the cost for taking part in the forwarding process varies with the devices' technology or the users' habits. Finally, the scheme is truly applicable to DTNs since it works with no need for end-to-end connectivity. In this context, we first introduce the basic coordination mechanism leveraging the notion of a Minority Game. In this game, relays compete to be in the population minority and their utility is defined in combination with a rewarding mechanism. The rewards in turn configure as a control by which the network operator controls the desired operating point for the DTN. To this aim, we provide a full characterization of the equilibria of the game in the case of heterogeneous DTNs. Finally, a learning algorithm based on stochastic approximations provably drives the system to the equilibrium solution without requiring perfect state information at relay nodes or at the source node and without using end-to-end communications to implement the rewarding scheme. We provide extensive numerical results to validate the proposed scheme.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121153123","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

Analysis of continuous feedback Markov fluid queues and its applications to modeling Optical Burst Switching 连续反馈马尔可夫流队列分析及其在光突发交换建模中的应用

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662952

Mehmet Akif Yazici, N. Akar

引用次数: 7

Maximizing streaming flows based on a novel video streaming framework 基于新型视频流框架的流流量最大化

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662969

Tian Wang, W. Jia, Bineng Zhong

引用次数: 1

Adaptive routing in IP networks using SNMP link counts 基于SNMP链路数的IP网络自适应路由

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662964

Josselin Vallet, O. Brun

引用次数: 1

Information exchange surrogates for approximation of blocking probabilities in overflow loss systems 在溢出损失系统中，信息交换代替了阻塞概率的近似

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662932

E. Wong, Jun Guo, W. Moran, M. Zukerman

{"title":"Information exchange surrogates for approximation of blocking probabilities in overflow loss systems","authors":"E. Wong, Jun Guo, W. Moran, M. Zukerman","doi":"10.1109/ITC.2013.6662932","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662932","url":null,"abstract":"Overflow loss systems are an important class of teletraffic models. Evaluation of blocking probabilities in such systems involving mutual overflow effects is a difficult problem. In the literature, decoupling a given system into independent subsystems is typically regarded as a scalable, though non-robust, approach to the problem. This paper presents a new method that is based on a radically different idea from that of the conventional approach. Firstly a surrogate model that, in a systematic way, approximately captures the state dependencies due to the overflow model is designed. Secondly it is observed that approximation of the blocking probability of the surrogate model provides a good approximation to the blocking probability in the original model. We introduce important concepts underpinning this surrogate-based approximation method, and demonstrate its effectiveness by applying it to an overflow model that incorporates mutual overflow effects common to various applications of overflow loss systems. Unlike the conventional approach that requires a fixed-point solution of the blocking probability with no guarantee of the convergence and uniqueness, our new method provides a unique solution in a fixed number of iterations. Extensive and statistically reliable experiments demonstrate that the new method yields significantly and consistently better results compared to the conventional approach, improving the accuracy by orders of magnitude in many instances and yet requiring less computational effort.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114258156","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}

引用次数: 13

Optimal wake-up mechanism for single base station with sleep mode 具有睡眠模式的单个基站的最佳唤醒机制

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662947

Xueying Guo, Sheng Zhou, Z. Niu, P. Kumar

引用次数: 31

A hybrid analytical/simulation optimization of Generalized Processor Sharing 通用处理器共享的混合分析/仿真优化

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662960

Jasper Vanlerberghe, T. Maertens, J. Walraevens, S. D. Vuyst, H. Bruneel

引用次数: 5

A game theoretic approach for the association problem in two-tier HetNets 两层HetNets关联问题的博弈论方法

Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662962

Majed Haddad, P. Więcek, E. Altman, Habib B. A. Sidi

{"title":"A game theoretic approach for the association problem in two-tier HetNets","authors":"Majed Haddad, P. Więcek, E. Altman, Habib B. A. Sidi","doi":"10.1109/ITC.2013.6662962","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662962","url":null,"abstract":"This paper addresses a Bayesian game theoretic framework for determining the association rules that decide to which cell a given mobile user should associate in LTE two-tier Heterogeneous Networks (HetNets). Users are assumed to compete to maximize their throughput by picking the best locally serving cell with respect to their own measurement, their demand and a partial statistical channel state information (CSI) of other users. In particular, we investigate the properties of a hierarchical game, in which the macro-cell BS is a player on its own. We derive analytically the utilities related to the channel quality perceived by users to obtain the equilibria. We show by means of a Stackelberg formulation, how the operator, by dynamically choosing the offset about the state of the channel, can optimize its global utility while end-users maximize their individual utilities. The proposed hierarchical decision approach for wireless networks can reach a good trade-off between the global network performance at the equilibrium and the requested amount of signaling. Typically, it is shown that when the network goal is orthogonal to user's goal, this can lead the users to a misleading association problem. Numerical results validate the expectation from the theoretical analysis and illustrate the advantages of the proposed approach.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132999316","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}

引用次数: 8