Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012最新文献_第2页

Reliable multicast on a WDM Optical Packet Ring WDM光分组环上的可靠组播

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252171

L. Sadeghioon, P. Gravey, A. Gravey

{"title":"Reliable multicast on a WDM Optical Packet Ring","authors":"L. Sadeghioon, P. Gravey, A. Gravey","doi":"10.1109/NGI.2012.6252171","DOIUrl":"https://doi.org/10.1109/NGI.2012.6252171","url":null,"abstract":"The present paper addresses multicast protection in WDM Optical Packet Rings that are currently considered for future metro network architectures. The considered architecture is optically transparent for transit traffic, which drastically limits the number of OEO conversions compared to e.g. Ethernet Packet Rings. WDM Optical Packet Rings offer huge capacity while still retaining a packet based granularity, which is not the case for ROADM based networks. Metro networks now support multicast, as IPTV services are largely deployed. Two alternate methods for implementing the traditional 1+1 and 1:1 protection mechanisms are proposed. Both rely on using the time slotted control channel to deliver failure and recovery information. The performance of the two methods are thoroughly assessed and it is shown that the transient degradation durations are always bounded by the Ring Round Trip Time, which is at least an order of magnitude less than the usual 50ms target time for protection. Moreover, using a Multicast Drop-off Point is shown to provide an almost loss free transport in case of single failure. Lastly the single ring protection schemes are extended to multi-ring architectures, relying on an MPLS-TP compatible operation mode of the WDM optical packet rings.","PeriodicalId":314384,"journal":{"name":"Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012","volume":"30 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126507298","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

Simulated annealing algorithm for virtual network reconfiguration 虚拟网络重构的模拟退火算法

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252170

Sarang Bharadwaj Masti, S. Raghavan

{"title":"Simulated annealing algorithm for virtual network reconfiguration","authors":"Sarang Bharadwaj Masti, S. Raghavan","doi":"10.1109/NGI.2012.6252170","DOIUrl":"https://doi.org/10.1109/NGI.2012.6252170","url":null,"abstract":"Network virtualization has evoked interest among researchers as a promising solution for developing flexible and manageable architectures for future Internet. One of the major challenges in network virtualization is the efficient allocation of substrate resources to the Virtual Networks (VNs) - a problem known as Virtual Network Embedding (VNE). Most of the past research on VNE has been focused on algorithms to allocate resources to VNs. The problem of reconfiguration, however, is relatively less explored. In this paper, we propose a simulated annealing algorithm for reconfiguring the VNs in order to balance the load across the substrate network, thereby reducing the peak node and link load on the substrate network. Through extensive simulations we evaluate the proposed reconfiguration algorithm and show that after reconfiguration there is a 20% reduction in maximum link load and 5% reduction in maximum node load. The average link load is reduced by 50% and the fraction of links having a load above 50% is reduced from 66% to 14%. We also show that periodic reconfiguration leads to a significant improvement in the acceptance ratio of VN requests.","PeriodicalId":314384,"journal":{"name":"Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130358345","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

An HTTP web traffic model based on the top one million visited web pages 基于前100万访问网页的HTTP网络流量模型

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252145

R. Pries, Zsolt Magyari, P. Tran-Gia

引用次数: 54

Cognitive Radio spectrum decision based on channel usage prediction 基于信道使用预测的认知无线电频谱决策

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252163

Yong Yao, Said Rutabayiro Ngoga, Adrian Popescu

引用次数: 9

A rating-based network selection game in heterogeneous systems 异构系统中基于评级的网络选择博弈

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252144

Vladimir Fux, P. Maillé

引用次数: 4

Content dependency of the traffic control in the darwin streaming server 达尔文流服务器中流量控制的内容依赖关系

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252166

Karel De Vogeleer, Adrian Popescu, M. Fiedler, D. Erman

引用次数: 3

Doubtless in seattle: Exploring the internet delay space 毫无疑问，在西雅图:探索互联网延迟空间

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252147

Philipp M. Eittenberger, Marcel Großmann, U. Krieger

引用次数: 4

Flow-level modeling and analysis of dynamic TDD in LTE LTE中动态TDD的流级建模与分析

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252162

P. Lassila, A. Penttinen, S. Aalto

{"title":"Flow-level modeling and analysis of dynamic TDD in LTE","authors":"P. Lassila, A. Penttinen, S. Aalto","doi":"10.1109/NGI.2012.6252162","DOIUrl":"https://doi.org/10.1109/NGI.2012.6252162","url":null,"abstract":"We present a queueing analysis of elastic traffic performance in LTE systems using the dynamic TDD scheme. Both fair resource sharing and performance optimization using different approaches are considered. We first analyze the system without any restrictions in the resource allocation between the uplink and downlink and demonstrate that a simple dynamic scheduling scheme (called here dynamic-PS), where the allocation for a single flow is always inversely proportional to the total number of active flows, shows good performance and fairness properties compared with any optimized static allocation scheme. We also consider the achievable gains with more detailed traffic statistics, including the application of the Gittins index policy and SRPT. However, the actual LTE TDD system only supports a discrete set of possible allocations in the capacity region. We then investigate how these allocation constraints impact the performance of the discretized variant of the dynamic-PS policy by using different approaches. To optimize the performance we apply MDP for exponential service times and, for example, derive a structural result that the optimal policy always selects among two corner points of the capacity region. Also, an SRPT-like heuristic scheduling algorithm is given. The analytical and simulated results suggest that the discrete dynamic-PS policy is robust against impact of different service time distributions, fair and performs reasonably well.","PeriodicalId":314384,"journal":{"name":"Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121573058","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

Pricing and regulating Quality of Experience 定价和规范体验质量

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252165

Stefan Wahlmueller, Patrick Zwickl, P. Reichl

引用次数: 18

Optimal intercell coordination for multiple user classes with elastic traffic 具有弹性流量的多用户类别的最优小区间协调

Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012 Pub Date : 2012-06-25 DOI: 10.1109/NGI.2012.6252161

Prajwal Osti, P. Lassila, S. Aalto

{"title":"Optimal intercell coordination for multiple user classes with elastic traffic","authors":"Prajwal Osti, P. Lassila, S. Aalto","doi":"10.1109/NGI.2012.6252161","DOIUrl":"https://doi.org/10.1109/NGI.2012.6252161","url":null,"abstract":"We consider the intercell coordination problem between two neighboring cells, assuming that the traffic in the system consists of elastic downlink data flows. In this case, there is an option of completely switching off one base station at certain times, which reduces interference and enables a higher service rate in the neighboring base station. We use a flow level queueing model to describe the evolution of the system based on a symmetric capacity region. Recent results by Verloop and Núñez-Queija show that, assuming a single class of flows for each cell, the stochastically optimal dynamic policy is to have both stations switched on whenever there are users in both cells. In this paper, we consider a system where the two stations are able to provide services to two different classes of users - the near ones and the far ones. In this setting, the stochastic optimality of the Both Stations On policy does not necessarily hold, but it may still be a close-to-optimal policy, at least for minimizing the mean flow delay. We present a systematic method based on the policy improvement algorithm of the theory of the Markov Decision Processes to generate a near-optimal state-dependent resource allocation policy. Our numerical experiments with these two dynamic policies indicate that the Both Stations On policy is, indeed, close to optimal even when there are multiple user classes.","PeriodicalId":314384,"journal":{"name":"Proceedings of the 8th Euro-NF Conference on Next Generation Internet NGI 2012","volume":"34 1‐4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132340941","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}

引用次数: 7