2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)最新文献

{"title":"Cell planning for outdoor distributed antenna systems in dense urban areas","authors":"Syed Fahad Yunas, M. Valkama, Jarno Niemela","doi":"10.1109/NETWKS.2014.6959264","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959264","url":null,"abstract":"Provisioning of high rate mobile data services and increased network level capacities in mobile cellular systems require higher received signal levels and improved interference characteristics throughout the cell coverage area. Traditional macrocellular deployments, due to high associated path losses, are only able to provide peak bit rates to users near the base stations. Moreover, the situation is further degraded in dense urban areas due to fading and shadowing effects. Hence, operators are forced to bring the antenna installations closer to the users in order to reduce the link losses and increase the service availability. As such, two competing technologies have been identified as alternative solutions for provisioning of high speed data in the outdoor environment, (i) small cells and (ii) outdoor distributed antenna systems (ODAS). In this article we evaluate and analyze the performance of small cells and outdoor DAS based deployments in a dense urban environment. The analysis covers the performance evaluation in both outdoor and indoor settings while taking into account two key performance metrics: coverage and spectral efficiency. Furthermore, we study different deployment strategies for deploying the outdoor DAS network. Results indicate, that due to better interference management, ODAS deployments can provide improvements in outdoor cell level capacities, specifically cell edge capacity performance, as compared to stand-alone small cell deployments, however, due to comparatively lower frequency reuse factor than small cell scenario, the area capacity performance of ODAS is lower. For indoor receivers, the performance of all outdoor solutions are fairly low, mainly due to high associated building penetration loss. The findings strongly motivate the deployments towards heterogeneous network, where the indoor small cell solutions fulfill the exponentially increasing capacity demand of the indoor environment. For fulfilling the dynamic outdoor capacity demands, there is an inherent need of an advanced version of outdoor DAS solution that can dynamically configure the DAS nodes to act as a `single super micro-/DAS cell' or multiple independent small microcells, based on the outdoor traffic conditions.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114640602","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}

{"title":"Caching and capacity allocation game in self-managed content provider networks","authors":"D. Gasior, M. Drwal","doi":"10.1109/NETWKS.2014.6959258","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959258","url":null,"abstract":"In this paper we study the problem of distributed cache management in a self-managed network. We consider a set of autonomously operating edge routers, providing the wide-area connectivity for a local network. Each local network is equipped with a caching server, capable of storing copies of data objects. Objects can be either accessed from a special publisher server, or from any other cache that contains a copy. It is assumed that all data transmissions are carried trough links of limited bandwidth capacity. The problem consists of jointly deciding on the contents of all cache servers and setting appropriate transmission rates, so as the value of network utility is maximized. Due to the distributed nature of the considered system, we employ a game-theoretic analysis, and present how to compute efficiently solutions which constitute pure Nash equilibria. We introduce the concept of conditional equilibrium, which corresponds to a strategy of a game with restricted players' strategy space. Finally, an experimental study is presented, which consists of an application of the presented solution algorithm to existing wide-area network (Pionier optical network).","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278667","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}

{"title":"Just-in-time with enhanced fairness (JITef)","authors":"C. Santiago, R. Valadas","doi":"10.1109/NETWKS.2014.6959247","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959247","url":null,"abstract":"Optical Burst Switching (OBS) is an architecture proposed to support broadband traffic over WDM networks. In OBS packets with the same destination are aggregated in bursts and transported through a light path established by a control message sent ahead of the burst. OBS suffers from a well known fairness problem, in that bursts with longer paths have higher blocking probabilities. In this paper, we propose a new reservation protocol, called Just-In-Time with Enhanced Fairness (JITef), which builds upon JIT to improve fairness in OBS networks, through the use of a preemptive discard strategy. JITef is also seen to achieve better resource utilization than JIT. Our results are carried out through discrete-event simulation spanning a large number of scenarios.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128571376","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}

{"title":"Fast image file distribution with Fountain codes via a Wi-Fi ad-hoc network, using low power processors","authors":"C. Faneca, José M. N. Vieira, A. Zúquete","doi":"10.1109/NETWKS.2014.6959232","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959232","url":null,"abstract":"In this work we propose a system to efficiently broadcast large files at maximum Wi-Fi transmission speed over an ad-hoc network using Fountain codes. With this type of rateless encoding we were able to avoid the feedback channel from the receivers and the need to retransmit the lost packets. This way it is possible to take advantage of the full bandwidth of the channel to transmit useful data. To encode each packet the system has to select n different symbols and since they are chosen randomly from K symbols sized image, the system has to pick a few (symbols) far apart from each other. This makes the CPU cache useless, decreasing the efficiency of the codeword generation process when the message size K is very large, especially on low power processors like ODROID-U3 and RaspberryPI. To overcome this problem we study a Block Angular encoding approach witch divides the message in nb blocks, small enough to be inside the CPU cache. In this paper we compare the encoding results using regular LT codes and the Block Angular codes, discussing its pros and cons in relation to the DETIboot system and other file distributing systems.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133503774","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}

{"title":"A transparent OpenFlow-based oracle for locality-aware content distribution","authors":"Emanuele Di Pascale, Frank Slyne, M. Ruffini","doi":"10.1109/NETWKS.2014.6959270","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959270","url":null,"abstract":"Locality-aware policies for content distribution attempt to redirect content requests to nearby sources in order to optimize bandwidth utilization and reduce operating costs for Internet Service Providers. For this purpose, an oracle service is required to track content availability at each location and dynamically redirect requests to an optimal source. In this paper we propose an OpenFlow-based locality oracle, developed as a POX controller module in an attempt to make the redirection mechanism as transparent as possible to the underlying service. We show two possible implementations, using respectively DNS resolution and HTTP redirection, and we analyze the benefits and downsides of each solution. Finally, we evaluate the impact of the redirection process on the latency experienced by the requester.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124929567","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}

{"title":"Stability of flow features for the identification of Internet applications","authors":"M. R. Oliveira, R. Valadas, M. Pietrzyk, D. Collange","doi":"10.1109/NETWKS.2014.6959223","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959223","url":null,"abstract":"One important requirement associated with the deployment of large scale classification infrastructures is the portability of classifiers, which allows a small number of pre-trained classifiers to be used on many sites and time periods. The portability can be severely degraded if the flow features used in the classification process lack stability, i.e. if they do not preserve their most relevant statistical properties across different sites and time periods. In this paper we propose a statistical procedure to evaluate the stability of flow features, which resorts to the notion of effect size. The procedure is used challenge the stability of popular flow features, such as the direction and size of the first four packets of a TCP connection. Our results, obtained with three high-quality traffic traces, clearly show that only some applications are portable, when using these features as discriminators. We also provide evidence of these findings based on the operation of the protocols underlying the Internet applications.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124294871","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}

{"title":"Framework for collecting social network events","authors":"Hugo Fonseca, Eduardo Rocha, P. Salvador, A. Nogueira","doi":"10.1109/NETWKS.2014.6959218","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959218","url":null,"abstract":"Online Social Networks became a relevant part of daily digital interactions for more than half a billion users around the world. The various personal information sharing practices that social network providers promote have led to their success as innovative social interaction platforms. At the same time, these practices have risen much critique and concerns with respect to privacy and security from different stakeholders. In fact, the massive use of online social networks has risen the attention of hackers and attackers that want to propagate malware and viruses for obtaining sensitive data. In this way, every social network user should be able to easily access, control and analyse the information he shares on his profile in order to efficiently detect any usage deviation. The possibility of detecting different sources of shared information in the same account lead us to design a system based not on information itself but on the timestamps associated to it. The proposed event collector framework can collect all posted information and store it in a relational database for further analysis. Using a friendly graphical interface, users can access all stored information in a comprehensible manner, according to the type of event, thus facilitating the analysis of the user behaviour. Since each event is stored with its corresponding timestamp, it is possible to perform an efficient analysis of all posted contents, compute statistics over collected data, infer/establish the so called \"normal\" or \"typical\" usage profile and, thus, be able to detect possible deviations that may correspond to a compromised user account.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639908","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}

{"title":"Clustering and dynamic resource allocation for macro-femtocell networks","authors":"Rebeca L. Estrada, H. Otrok, Z. Dziong","doi":"10.1109/NETWKS.2014.6958522","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6958522","url":null,"abstract":"Femtocell dense deployment imposes new challenges for the resource allocation in a two-tier network such as: (1) dynamic resources allocation among the two tiers taking into account the offloaded traffic from macrocell, (2) granting access to public users while guaranteeing QoS for femtocell subscribers, and (3) appropriate power settings that finds a compromise between the overall system performance and the bandwidth allocated to femtocells. In this paper, we propose a twofold solution where 1) a heuristic femtocell cluster solution is proposed to maximize the network throughput taking into account the available capacity of femtocell clusters in terms of number of users and resources and 2) to motivate femtocell clustering, we incentivize femtocells by a simple reward mechanism that assigns extra resources for femtocell subscribers if they grant access to public users. Simulations are conducted to show the performance of our approach that is contrasted with another model using weighted water filling resource allocation algorithm and a cluster formation technique based on interference level.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131384493","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}

{"title":"RED-based admission control algorithm for flow-aware networks","authors":"R. Stankiewicz, J. Domżał, R. Wójcik","doi":"10.1109/NETWKS.2014.6959197","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959197","url":null,"abstract":"Measurement-based admission control mechanism in Flow-Aware Networks (FAN) may lead to performance issues related to over-admitting, especially when traffic sources generate large number of flows. When too many new transmissions arrive close in time to each other, all of them may be accepted even though there is no room in the outgoing link. The source lies, unfortunately, in the very basic principles of the mechanism. In this paper, we show that there is a simple, yet very efficient remedy to the problem. The proposed solution utilizes the Random Early Detection algorithm. As a result we can steer the number of accepted flows taking into consideration current load in a link. The proposed solution has significant advantages over currently available algorithms for admission control in FAN. Moreover it provides better performance which is confirmed by the simulation results.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123825274","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}

{"title":"Resilient distributed design of very large multi-domain optical networks","authors":"B. Jaumard, T. Do","doi":"10.1109/NETWKS.2014.6959209","DOIUrl":"https://doi.org/10.1109/NETWKS.2014.6959209","url":null,"abstract":"Providing protection in multi-domain optical networks amounts to ensure protection of the inter-domain connections. Due to scalability issues, almost all previous studies focused on heuristics and on networks of small size. In this study, under the assumption of a single link failure scenario, we propose a fully distributed network management scheme where inter-domain working traffic is protected with a shared link protection scheme and intra-domain working traffic is protected with a shared path protection scheme. The new fully distributed protection scheme relies on a two level protection scheme, where each protection level is optimized thanks to a large scale optimization ILP model that allows the exact solution of quite large instances. We then investigate a parallel implementation of the newly proposed distributed scheme, and solve exactly data instances for very large multi-domain optical networks, i.e., up to 45 domains.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129131103","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}