Pub Date : 2014-12-01DOI: 10.1109/NOF.2014.7119782
K. Pan, Tanbir Haque, R. Difazio, A. Zeira
A framework and algorithm employing compressed sensing (CS) for orthogonal frequency division multiplexing (OFDM) systems is proposed. A compressive iterative interference cancellation for OFDM signal is presented. Prior knowledge of communication system is exploited to enhance data detection performance. Simulation results indicate that such an advanced data detection and receiver yields significant gains in bit error rate (BER) at low sampling rates.
{"title":"Enhanced data detection employing compressed sensing In wireless communications","authors":"K. Pan, Tanbir Haque, R. Difazio, A. Zeira","doi":"10.1109/NOF.2014.7119782","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119782","url":null,"abstract":"A framework and algorithm employing compressed sensing (CS) for orthogonal frequency division multiplexing (OFDM) systems is proposed. A compressive iterative interference cancellation for OFDM signal is presented. Prior knowledge of communication system is exploited to enhance data detection performance. Simulation results indicate that such an advanced data detection and receiver yields significant gains in bit error rate (BER) at low sampling rates.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115149641","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}
Pub Date : 2014-12-01DOI: 10.1109/NOF.2014.7119793
Yongwen Liu, M. Esseghir, L. Merghem
Cloud computing as a new information technique has been developing rapidly in recent years, which raises the tide for the whole information community. With the cloud computing technique maturity, more and more cloud service programs and providers have emerged. The cloud integrates a variety of infrastructure and soft computing services, which makes large-scale enterprise and small company processing business efficient with lower cost. However, one of the most important challenges is the pay-as-go pattern, where users select the better cloud service programs meeting their requirements and the cloud providers with lowest cost. In this paper, we study the possible integration of the rough set theory in cloud service selection mechanism in order to provide right decisions for cloud users and efficient service improvement for cloud providers. A detailed example is also introduced to demonstrate the practice and analyze the feasibility and the significance of our proposal.
{"title":"Cloud service selection based on rough set theory","authors":"Yongwen Liu, M. Esseghir, L. Merghem","doi":"10.1109/NOF.2014.7119793","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119793","url":null,"abstract":"Cloud computing as a new information technique has been developing rapidly in recent years, which raises the tide for the whole information community. With the cloud computing technique maturity, more and more cloud service programs and providers have emerged. The cloud integrates a variety of infrastructure and soft computing services, which makes large-scale enterprise and small company processing business efficient with lower cost. However, one of the most important challenges is the pay-as-go pattern, where users select the better cloud service programs meeting their requirements and the cloud providers with lowest cost. In this paper, we study the possible integration of the rough set theory in cloud service selection mechanism in order to provide right decisions for cloud users and efficient service improvement for cloud providers. A detailed example is also introduced to demonstrate the practice and analyze the feasibility and the significance of our proposal.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460297","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}
Pub Date : 2014-12-01DOI: 10.1109/NOF.2014.7119765
Bo Gu, K. Yamori, Y. Tanaka
This paper studies the impact of transmission rate control and pricing on the congestion management practices on bottleneck links of Internet service provider (ISP). QoS negotiation between ISP and users is conducted by letting users specify their minimum and maximum transmission rate required. Each link tentatively allocates the maximum transmission rates to the traffics that are going to cross it. When the available capacity becomes not enough to satisfy the maximum transmission rate requirements of all on-going users, ISP reduces the allocated transmission rates of connections one by one according to their priorities. When the transmission rate allocated to every user decreases to the minimum transmission rate required, ISP then sends peak-time notification to all on-going users and employs pricing as an incentive mechanism to encourage voluntary disconnections (soft delay). Prices adopted during congestion is completely time-dependent and varies according to the real-time network congestion level. Specifically, the price of each time slot is obtained by solving a maximization problem of network utilization. If the available capacity is still not enough to satisfy the minimum transmission rate requirements of all on-going users, ISP forcibly delays connections one by one also on a priority basis (hard delay). Simulation results show that the proposed approach can significantly shift demand from peak time to off-peak time. When baseline demand is set to be 25% over the capacity of the link (i.e., peak time), 28.2% users voluntarily delay their connections for 0.23 hour under the price incentives, and only 0.84% users are forcibly delayed by ISP.
{"title":"Integration of time-dependent pricing with transmission rate control for flattening out peak-time demand","authors":"Bo Gu, K. Yamori, Y. Tanaka","doi":"10.1109/NOF.2014.7119765","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119765","url":null,"abstract":"This paper studies the impact of transmission rate control and pricing on the congestion management practices on bottleneck links of Internet service provider (ISP). QoS negotiation between ISP and users is conducted by letting users specify their minimum and maximum transmission rate required. Each link tentatively allocates the maximum transmission rates to the traffics that are going to cross it. When the available capacity becomes not enough to satisfy the maximum transmission rate requirements of all on-going users, ISP reduces the allocated transmission rates of connections one by one according to their priorities. When the transmission rate allocated to every user decreases to the minimum transmission rate required, ISP then sends peak-time notification to all on-going users and employs pricing as an incentive mechanism to encourage voluntary disconnections (soft delay). Prices adopted during congestion is completely time-dependent and varies according to the real-time network congestion level. Specifically, the price of each time slot is obtained by solving a maximization problem of network utilization. If the available capacity is still not enough to satisfy the minimum transmission rate requirements of all on-going users, ISP forcibly delays connections one by one also on a priority basis (hard delay). Simulation results show that the proposed approach can significantly shift demand from peak time to off-peak time. When baseline demand is set to be 25% over the capacity of the link (i.e., peak time), 28.2% users voluntarily delay their connections for 0.23 hour under the price incentives, and only 0.84% users are forcibly delayed by ISP.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115841203","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}
Pub Date : 2014-12-01DOI: 10.1109/NOF.2014.7119773
J. Kélif, S. Sénécal, Constant Bridon, M. Coupechoux
The evaluation of performance and quality of service needs the modeling of wireless networks. Among the different models usually considered, the hexagonal network is the most popular. However, it requires extensive numerical computations. The Poisson network model, for which the base stations (BS) locations form a stochastic spatial Poisson process, allows to consider a non constant distance between base stations. Therefore, it characterizes more realistically operational networks. The Fluid network model, for which the interfering BS are replaced by a continuum of infinitesimal interferers, allows to establish closed-form formula for the SINR (Signal on Interference plus Noise Ratio). This model was validated by comparison with an hexagonal network. The two models establish very close results. In this paper, we show that the Fluid network model can also be used to analyze Poisson networks. Therefore, the evaluation of quality of service and performance becomes very easy, whatever the type of model, by using the analytical expression of the SINR established by considering the fluid model.
{"title":"Quality of service and performance evaluation: A fluid approach for poisson wireless networks","authors":"J. Kélif, S. Sénécal, Constant Bridon, M. Coupechoux","doi":"10.1109/NOF.2014.7119773","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119773","url":null,"abstract":"The evaluation of performance and quality of service needs the modeling of wireless networks. Among the different models usually considered, the hexagonal network is the most popular. However, it requires extensive numerical computations. The Poisson network model, for which the base stations (BS) locations form a stochastic spatial Poisson process, allows to consider a non constant distance between base stations. Therefore, it characterizes more realistically operational networks. The Fluid network model, for which the interfering BS are replaced by a continuum of infinitesimal interferers, allows to establish closed-form formula for the SINR (Signal on Interference plus Noise Ratio). This model was validated by comparison with an hexagonal network. The two models establish very close results. In this paper, we show that the Fluid network model can also be used to analyze Poisson networks. Therefore, the evaluation of quality of service and performance becomes very easy, whatever the type of model, by using the analytical expression of the SINR established by considering the fluid model.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121037329","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}
Pub Date : 2014-12-01DOI: 10.1109/NOF.2014.7119795
M. Obadia, M. Bouet, Jérémie Leguay, Kevin Phemius, L. Iannone
Distributed SDN controllers have been proposed to address performance and resilience issues. While approaches for datacenters are built on strongly-consistent state sharing among controllers, others for WAN and constrained networks rely on a loosely-consistent distributed state. In this paper, we address the problem of failover for distributed SDN controllers by proposing two strategies for neighbor active controllers to take over the control of orphan OpenFlow switches: (1) a greedy incorporation and (2) a pre-partitioning among controllers. We built a prototype with distributed Floodlight controllers to evaluate these strategies. The results show that the failover duration with the greedy approach is proportional to the quantity of orphan switches while the pre-partitioning approach, introducing a very small additional control traffic, enables to react quicker in less than 200ms.
{"title":"Failover mechanisms for distributed SDN controllers","authors":"M. Obadia, M. Bouet, Jérémie Leguay, Kevin Phemius, L. Iannone","doi":"10.1109/NOF.2014.7119795","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119795","url":null,"abstract":"Distributed SDN controllers have been proposed to address performance and resilience issues. While approaches for datacenters are built on strongly-consistent state sharing among controllers, others for WAN and constrained networks rely on a loosely-consistent distributed state. In this paper, we address the problem of failover for distributed SDN controllers by proposing two strategies for neighbor active controllers to take over the control of orphan OpenFlow switches: (1) a greedy incorporation and (2) a pre-partitioning among controllers. We built a prototype with distributed Floodlight controllers to evaluate these strategies. The results show that the failover duration with the greedy approach is proportional to the quantity of orphan switches while the pre-partitioning approach, introducing a very small additional control traffic, enables to react quicker in less than 200ms.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127813780","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}
Pub Date : 2014-06-11DOI: 10.1109/NOF.2014.7119800
M. Biswas, G. Parr, S. McClean, P. Morrow, B. Scotney
With recent advances in technology, resource control is a significant challenge for geographically distributed clouds. Users geographically close to the server get better services due to low latency. A few existing scheduling algorithms can provide better strategies through efficient job scheduling and resource allocation techniques. However, these algorithms are not efficient enough for distanced clouds. In order to gain maximum profits with optimized scheduling algorithms, it is necessary to utilize resources efficiently and also prioritize the tasks that are near to the servers. This paper proposes job scheduling algorithms in a distributed datacenter (DC) network, where the algorithms assign user's workloads to Virtual Machines (VMs) hosted to DC close to the users to reduce response time. The aspect of the proposed algorithms is the use of delay to evaluate if a VM provide a low or a high delay, it is required that the location of the end user generating the tasks should be known. Our results show that prioritizing tasks for the nearest servers not only improve the quality of service (QoS) but also demonstrates better utilization of the resources.
{"title":"SLA-based scheduling of applications for geographically secluded clouds","authors":"M. Biswas, G. Parr, S. McClean, P. Morrow, B. Scotney","doi":"10.1109/NOF.2014.7119800","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119800","url":null,"abstract":"With recent advances in technology, resource control is a significant challenge for geographically distributed clouds. Users geographically close to the server get better services due to low latency. A few existing scheduling algorithms can provide better strategies through efficient job scheduling and resource allocation techniques. However, these algorithms are not efficient enough for distanced clouds. In order to gain maximum profits with optimized scheduling algorithms, it is necessary to utilize resources efficiently and also prioritize the tasks that are near to the servers. This paper proposes job scheduling algorithms in a distributed datacenter (DC) network, where the algorithms assign user's workloads to Virtual Machines (VMs) hosted to DC close to the users to reduce response time. The aspect of the proposed algorithms is the use of delay to evaluate if a VM provide a low or a high delay, it is required that the location of the end user generating the tasks should be known. Our results show that prioritizing tasks for the nearest servers not only improve the quality of service (QoS) but also demonstrates better utilization of the resources.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127032026","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}
Pub Date : 1900-01-01DOI: 10.1109/NOF.2014.7119779
Xu Zhang, Ning Wang, V. Vassilakis, M. Howarth
In-network content caching has recently emerged in the context of Information-Centric Networking (ICN), which allows content objects to be cached at the content router side. In this paper, we specifically focus on in-network caching of Peer-to-Peer (P2P) content objects for improving both service and operation efficiencies. We propose an intelligent in-network caching scheme of P2P content chunks, aiming to reduce P2P-based content traffic load and also to achieve improved content distribution performance. Towards this end, the proposed holistic decision-making logic takes into account context information on the P2P characteristics such as chunk availability. In addition, we also analyse the benefit of coordination between neighbouring content routers when making caching decisions in order to avoid duplicated P2P chunk caching nearby. An analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching scheme.
{"title":"Decision-making for in-network caching of Peer-to-Peer content chunks - An analytical modelling study","authors":"Xu Zhang, Ning Wang, V. Vassilakis, M. Howarth","doi":"10.1109/NOF.2014.7119779","DOIUrl":"https://doi.org/10.1109/NOF.2014.7119779","url":null,"abstract":"In-network content caching has recently emerged in the context of Information-Centric Networking (ICN), which allows content objects to be cached at the content router side. In this paper, we specifically focus on in-network caching of Peer-to-Peer (P2P) content objects for improving both service and operation efficiencies. We propose an intelligent in-network caching scheme of P2P content chunks, aiming to reduce P2P-based content traffic load and also to achieve improved content distribution performance. Towards this end, the proposed holistic decision-making logic takes into account context information on the P2P characteristics such as chunk availability. In addition, we also analyse the benefit of coordination between neighbouring content routers when making caching decisions in order to avoid duplicated P2P chunk caching nearby. An analytical modelling framework is developed to quantitatively evaluate the efficiency of the proposed in-network caching scheme.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115877892","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：