2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks)最新文献

Requirement modeling language for the dynamic node integration problem 针对动态节点集成问题的需求建模语言

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2017-12-01 DOI: 10.1587/TRANSCOM.2017EBP3248

Yu Nakayama, K. Sezaki

引用次数: 0

Network management based QoE estimation for adaptive streaming over HTTP 基于QoE估计的HTTP自适应流网络管理

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-11-21 DOI: 10.1109/NETWKS.2016.7751173

Tan Phan-Xuan, E. Kamioka

引用次数: 0

A coalitional game for femtocell clustering in OFDMA macro-femtocell networks OFDMA宏飞蜂窝网络中飞蜂窝聚类的联合对策

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751179

Katty Rohoden, Rebeca L. Estrada, H. Otrok, Z. Dziong

{"title":"A coalitional game for femtocell clustering in OFDMA macro-femtocell networks","authors":"Katty Rohoden, Rebeca L. Estrada, H. Otrok, Z. Dziong","doi":"10.1109/NETWKS.2016.7751179","DOIUrl":"https://doi.org/10.1109/NETWKS.2016.7751179","url":null,"abstract":"In this paper, we tackle the problem of resource management in macro-femtocell networks. Dense deployment of femtocells imposes several challenges for a cluster-based resource allocation. Some of those challenges are the trade-off between the level of offloaded traffic from macrocell and bandwidth allocated to femto-tier, the fair distribution of resources, and the mitigation of inter-cluster interference. To overcome these limitations, we propose a coalitional game to form clusters of femtocells that can reduce the resource allocation complexity. Stable clusters are formed based on the core model. Our proposal mainly consists of three components. Namely, a femtocell selection for public users, a coalitional game where cooperative femtocells are rewarded, and a Weighted Water Filling algorithm to allocate resources. Our solution is performed under a rewarding model, which is based on an ideal spectral efficiency and on an effective spectral efficiency. We compare the results of our rewarding model with a non-cooperative model, where femtocells work in closed access mode. Simulation results demonstrate that our proposal improves the femto-tier throughput and the satisfaction of femtocells subscribers.","PeriodicalId":239896,"journal":{"name":"2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123202875","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

Modeling and optimization of Content Delivery Networks with heuristics solutions for the Multidimensional Knapsack Problem 多维背包问题的启发式内容交付网络建模与优化

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751146

Veronica Quintuna, Maxime Laye

引用次数: 2

Aircraft harness measurement campaign and investigations on introducing one pair Ethernet 飞机线束测量运动及引入一对以太网的研究

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751177

A. Elefsiniotis, Sebastian Hahn

引用次数: 1

Reward-based online routing and spectrum assignment in flex-grid optical networks 柔性网格光网络中基于奖励的在线路由和频谱分配

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751160

R. Reyes, T. Bauschert

{"title":"Reward-based online routing and spectrum assignment in flex-grid optical networks","authors":"R. Reyes, T. Bauschert","doi":"10.1109/NETWKS.2016.7751160","DOIUrl":"https://doi.org/10.1109/NETWKS.2016.7751160","url":null,"abstract":"In this paper we propose an online, reward-based routing and spectrum assignment (RSA) method for multirate flex-grid optical networks. The method, denoted as MDP-RSA, is derived from a flex-grid optical link model based on the theory of Markov decision processes. Assuming that connections arrive randomly offering a reward to the system, the objective is to take the best decision on admission, routing and spectrum assignment for each incoming connection request, such that the rate of reward from the network is maximized. This is accomplished by only admitting connections that bring a positive reward gain to the network. For selected network scenarios, the reward loss (i.e. the ratio of the reward of rejected to offered connections) caused by the MDP-RSA is compared to that of an online scheme, which admits connections on the shortest path that fulfils the contiguity and continuity constraints. It is observed that the MDP-RSA yields a lower reward loss. Furthermore, it is shown how to provide grade of service control on individual connection classes. Compared to existing online RSA schemes, the MDP-RSA is much more flexible as the connection reward parameters can be tailored to different optimization objectives (e.g. maximization of either carried traffic or economic revenue).","PeriodicalId":239896,"journal":{"name":"2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125842724","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

Non-intentional mobility of data sessions across mobile networks while roaming because of operators' mobile DNS architecture 由于运营商的移动DNS架构，漫游时跨移动网络的数据会话的非故意移动性

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751158

G. Boulmier

引用次数: 0

Adaptive Bubble Burst (ABB): Mitigating DDoS attacks in Software-Defined Networks 自适应泡沫爆发(ABB):减轻软件定义网络中的DDoS攻击

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751152

Danish Sattar, A. Matrawy, Olufemi Adeojo

引用次数: 13

Embedding security and privacy into the development and operation of cloud applications and services 将安全和隐私嵌入到云应用程序和服务的开发和运营中

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751149

Tran Quang Thanh, S. Covaci, T. Magedanz, P. Gouvas, A. Zafeiropoulos

引用次数: 19

Virtual topologies for abstraction service for IP-VPNs ip - vpn抽象服务的虚拟拓扑

2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks) Pub Date : 2016-09-01 DOI: 10.1109/NETWKS.2016.7751178

Lavanya Sivakumar, Jayaram Balabaskaran, K. Thulasiraman, S. Arumugam

{"title":"Virtual topologies for abstraction service for IP-VPNs","authors":"Lavanya Sivakumar, Jayaram Balabaskaran, K. Thulasiraman, S. Arumugam","doi":"10.1109/NETWKS.2016.7751178","DOIUrl":"https://doi.org/10.1109/NETWKS.2016.7751178","url":null,"abstract":"VPN service providers(VSP) and IP-VPN customers have maintained service demarcation boundaries between their routing and signaling entities resulting in the VPN's viewing the VSP network as an opaque entity and therefore limiting interaction between the two. Ravi et. al in [1] introduced the notion of topology abstraction as a means for sharing the core topology information as abstract graphs associated with QoS metric information. This has been further studied in a series of papers [2], [9] and [4]. In the more recent work [4], three decentralized schemes to generate topology abstractions were proposed and evaluated through extensive simulations. These schemes used some very powerful tools from graph theory and combinatorial optimization. But the topology considered in [4] for abstraction is very simple and sparse. In this paper we continue this study and propose two new schemes for topology abstraction. Specifically, given a core network with node set V, and also given the node-to-node maximum flow matrix F = [f(u, v)] for any connected graph G = (V *,E) with V * a subset of V, we show how to assign capacities to the edges of G such that the maximum available flow between any pair of vertices u, v ∈ V * in G is at most the maximum available flow between u and v in the core network. Though this methodology is applicable to any graph, we seek abstract topologies with certain other desirable properties: low degree, number of edges being linear in the number of vertices, amenable to survivable logical topology routing in an IP over WDM optical networks etc. Chordal graphs have such properties. In this paper we show how to construct 2-vertex and 2-edge connected chordal graphs, starting from the Gomory-Hu tree of the flow matrix of the core network. Using the theory of graph augmentation presented in [10] one can develop other sparse virtual1 topologies possessing the properties demanded by an application.","PeriodicalId":239896,"journal":{"name":"2016 17th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130350761","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