Projects
EVANS: End-to-end Virtual Resource Management across Heterogeneous Networks and Services

EVANS is an EU FP7 Marie Curie Action "International Research Staff Exchange Scheme" project aiming to increase researchers’ mobility between four EU partners from three countries (United Kingdom, Spain, Norway) and two Chinese partners to obtain a better understanding of network virtualisation for future Internet infrastructure. In particular, the knowledge transfer, as a result of researcher’s mobility, will focus on the management aspects of the virtualized network resources rather than the virtualisation techniques of physical network resources. The EVANS project aims to create a network virtualisation environment over a fully heterogeneous network infrastructure and to provide an integrated network management system across different types of network platforms. The project will investigate into two complementary aspects of such an integrated network resource management system: (1) vertical management of virtualised resource for service heterogeneity, which is performed by infrastructure providers, and (2) horizontal management of virtualised resource for network heterogeneity, which is for the interest of service providers.
This staff exchange programme will also help develop new research links and deepen and strengthen the current research links amongst the partners and help build up long-term, world-class research in future Internet technology.
The EVANS project aims to create a network virtualisation environment over a fully heterogeneous network infrastructure and to provide an integrated network management system across different types of network platforms.
Funding source:
EU FP7
All partners:
- University of Essex, UK
- Universitat Politècnica de Catalunya, Spain
- Simula Research Laboratory, Norway
- University of Surrey, UK
- Tsinghua University, China
- Beijing University of Post and Telecommunications, China
ProNet: Protection of Power electronically Interfaced LV Distributed Generation Networks

The project aims to develop the communication technology based intelligent methods of protection and post fault control for distribution systems with large scale renewable energy generation units and power electronic converters. The developed protection and control methods will minimize the possibility of losing power supply in an abnormal situation by stably operating a local system in an island mode if the power system at a higher level fails, and restoring normal operation as quickly as possible. The project is funded by the EU SMARTGRIDS ERANET program.
The new trend in power systems is developing towards Distributed Generation (DG) due to some technical, economical and environmental reasons. However, the large number of the renewable based Distributed Generation integrated into the power system and the wide application of power electronics present a great number of challenges. In addition, DG based smart power grid requires Machine-to-Machine (M2M) like communication scenarios, which however has not been explored.
It is envisioned that protection and post fault system control methods should be fast, adaptive and intelligent, should be supported by effective and reliable communication system which also need to deal with other issues such as M2M communications between Smart meters, IEDs (Intelligent Electronic Devices), RTUs (Remote Terminal Units), relay, sensor and other devices/terminals at the same time, in addition to the time critical demand of the protection and control methods.
Funding source:
EU FP7
All partners:
-
Simula Research Laboratory, Norway
CROWN: Cross-layer Research on Green Cooperative Cognitive Radio Networks and Services

The objective of the CROWN project is to increase researchers’ mobility to obtain better understanding of green cooperative cognitive radio for future mobile Internet infrastructure. In particular, the transfer of knowledge, mainly as a result of researcher’s mobility, will focus on a new vision of green Cooperative CR paradigm, or CCR. This new vision advocates the seamless integration of three important aspects of modern wireless communication systems, i.e., green, cooperativeness and cross-layer. It is the aim of this project to explore a systematic way to bring together these features into a CCR network so as to maximize its effective network throughput (excluding signalling overhead) while staying green. In the meanwhile, the design of the CROWN network architecture will also take into consideration the new trend of services (e.g., increasing more video streaming) and their provisioning mechanisms (such as cloud computing). This staff exchange programme will also help develop new research links and deepen and strengthen the current research links amongst the partners and help build up long-term, world-class research in future wireless Internet technologies. The final goal is to explore a systematic way to integrate greenness, cooperativeness and cross-layer into a Cognitive Cooperative Radio networks so as to maximize its network performance.
Funding source:
EU FP7
All partners:
- Lancaster University, UK
- Simula Research Laboratory, Norway
- University of Essex, UK
- Huazhong University of Science and Technology, China
- Xidian University, China
- Tsinghua University, China
- Nanjing University, China
Publications for CROWN: Cross-layer Research on Green Cooperative Cognitive Radio Networks and Services
Mobile Edge Computing: A Survey
IEEE Internet of Things Journal 5, no. 1 (2017).Status: Published
Mobile Edge Computing: A Survey
Mobile Edge Computing (MEC) is an emergent architecture where cloud computing services are extended to the edge of networks leveraging mobile base stations. As a promising edge technology, it can be applied to mobile, wireless and wireline scenarios, using software and hardware platforms, located at the network edge in the vicinity of end-users. MEC provides seamless integration of multiple application service providers and vendors towards mobile subscribers, enterprises and other vertical segments. It is an important component in the 5G architecture which supports variety of innovative applications and services where ultra low latency is required. This paper is aimed to present a comprehensive survey of relevant research and technological developments in the area of MEC. It provides the definition of MEC, its advantages, architectures, and application areas; where we in particular highlight related research and future directions. Finally, security and privacy issues and related existing solutions are also discussed.
Afilliation | Communication Systems |
Project(s) | CROWN: Cross-layer Research on Green Cooperative Cognitive Radio Networks and Services |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Internet of Things Journal |
Volume | 5 |
Issue | 1 |
Date Published | 02/2018 |
Publisher | ACM IEEE |
Keywords | Fog Computing, IoT, Mobile cloud computing, Mobile edge computing |
DOI | 10.1109/JIOT.2017.2750180 |
TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks

The ICT industry is, quite rightly, criticized for its rapidly rising energy usage, contributions to CO2 emissions and for not taking its responsibility to the environment seriously. The sector causes world-wide CO2 emissions comparable to the airline industry. This increasing energy consumption of the ICT infrastructures has a direct and negative impact on the environment, the service operators, the manufacturers, and the society.
TIDENET is a highly innovative research project within the FRINATEK program. The goal of TIDNET is to create a less power consuming ICT sector. The main objectives of TIDENET are to study the energy-efficiency problem in wireless networks; and the fundamental interaction between wireless networks and the smart grid. Both a theoretical and a practical approach are taken. Theoretical studies are needed in order to develop thorough understanding of how energy is used in communications systems. Such understanding will help find new solutions to increased energy efficiency in these systems. In our practical approach we implement and validated these solutions to understand how energy is saved in real systems. The solutions are not only good for communications networks, the power grid and environment; they also help support sustainable ICT industry.
Funding source
RCN (Research Council of Norway) FRINATEK Project
Partners
- Simula Research Laboratory, Norway
- University of Oslo, Norway
Awards
- Best Paper Award, The 15th IEEE International Conference on Scalable Computing and Communications (IEEE ScalCom 2015), August 10-14, Beijing, China
- Best Paper Award, The 11th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine
- 2015), August 19-20, 2015, Taipei, Taiwan
- Best Paper Award, The 1st International Conference on Industrial Networks and Intelligent Systems (INISCOM 2015), Japan
Publications
- R. Yu, X. Huang, J. Kang, J. Ding, S. Maharjan, S. Gjessing, and Y. Zhang, "Cooperative Resource Management in Cloud-enabled Vehicular Networks", accepted by IEEE Transactions on Industrial Electronics
- R. Yu, J. Ding, S. Maharjan, S. Gjessing, Y. Zhang, and D. Tsang, "Decentralized and Optimal Resource Cooperation in Geo-distributed Mobile Cloud Computing", accepted by IEEE Transactions on Emerging Topics in Computing
- Y. Han, S. Jin, X. Li, H. Zhang, R. Yu and Y. Zhang, "Investigation of Transmission Schemes for Millimeter-Wave Massive MU-MIMO Systems", accepted by IEEE Systems Journal
- J. Ding, R. Yu, Y. Zhang, S. Gjessing and D. Tsang, "Service Providers Competition and Cooperation in Cloud-based Software Defined Wireless Networks", accepted by IEEE Communications Magazine
- C. Shao, S. Leng, Y. Zhang, A. Vinel, and M. Jonsson, "Performance Analysis of Connectivity Probability and Connectivity-aware MAC Protocol Design for Platoon-based VANETs", accepted by IEEE Transactions on Vehicular Technology
- Y. Liu, C. Yuen, R. Yu, Y. Zhang and S. Xie, "Queuing-Based Energy Consumption Management for Heterogeneous Residential Demands in Smart Grid", accepted by IEEE Transaction on Smart Grid
- S. Maharjan, Q. Zhu, Y. Zhang, S. Gjessing and T. Basar, "Demand Response Management in the Smart Grid in a Large Population Regime",
- accepted by IEEE Transaction on Smart Grid
- J. Kang, R. Yu, S. Maharjan, Y. Zhang, X. Huang, S. Xie, H. Bogucka, and S. Gjessing, "Toward Secure Energy Harvesting Cooperative Networks", IEEE Communications Magazine, vol.53, no.8, pp.114-121, Aug.2015.
- W. Zhong, R. Yu, Y. Zhang, J. Kang, H. Zhang, and S. Xie, "Dynamic Demand Balance in Vehicle-to-Grid Mobile Energy Networks", IEEE ICC 2015
- X. Huang, R. Yu, J. Kang, J. Ding, S. Maharjan, S. Gjessing and Y. Zhang, "Dynamic Resource Pricing and Scalable Cooperation for Mobile Cloud Computing", IEEE Scalcom 2015 (Best Paper Award)
- R. Yu, X. Huang, J. Kang, C. Yuen, A. Vinel, M. Jonsson, S. Gjessing and Y. Zhang, "An Optimal Replenishment Strategy in Energy Harvesting Wireless Networks with A Mobile Charger", QSHINE 2015 (Best Paper Award)
International Collaborators Visit
- T. Basar, August 2015
- J. Wang, July 2015
- D. Yau, September 2015
Dissemination
Talks
- "Intelligent Demand Response towards Green and Reliable Smart Energy Networks", the 14th the International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW), June/July 2015, Greece
- "Vehicle-to-Grid Systems: an emerging interdisciplinary field", Energy Informatics workshop at University of Oslo, Norway, 2015
- "QoS in Cognitive Radio based Smart Grid", EU project meeting, University of Lancaster, UK. 2015
- "Hybrid Spectrum Sharing in Cognitive Two-Way Relay Networks", EU project meeting, University of Lancaster, UK. 2015
- "Energy Harvesting Device-to-Device Communications for 5G", IC1004 Cost action meeting, 2015
- "ICT for Smart Energy", Xi'dian University, China, 2015
- "Smart Grid Communications: Challenges and Solutions", Guangdong University of Petrochemical Technology, China, 2015
- "Cyber Physical Smart Grid Systems", National Institute of Informatics, Japan, 2015
- "ICT for Smart Energy", ZTE Norway, 2015
- "Connectivity-aware Medium Access Control in Platoon-based Vehicular Networks", Halmstad University, Sweden, 2015
Workshop
- International Workshop on Connecting All Things for Enabling Smart Cities (CONTEST)", in conjunction with IEEE VTC Spring 2016 - Workshop organization approved
Activities/News
- New project granted: IKTPLUSS Project IoTSec (Security in IoT for Smart Grids) granted by Research Council of Norway (RCN). We are involved as the partner working on privacy issues in the smart grid
- Guest co-editor: IEEE Transactions on Dependable and Secure Computing, special issue on "Social Networks Security"
- Guest co-editor: ACM/Springer Mobile Networks & Applications (MONET), Special issue on "Advanced Industrial Networks with IoT and Big Data"
- Track Co-chair: "Mobile and Wireless Networks" track, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2016), Sept. 2016, Valencia, Spain.
- Track chair: "Energy Efficiency" track, the 4th International Conference on Future Internet of Things and Cloud (FiCloud 2016), Vienna, Austria, 22-24 August 2016
- Demo Co-chair: IEEE Consumer Communications and Networking Conference (IEEE CCNC 2016), 9-12 January 2016, Las Vegas, USA
- Program co-chair: 9th International Wireless Internet Conference (WICON 2016), December 2016 Sanya, People's Republic of China
- Program co-chair: 1st International Conference on Smart Grid Inspired Future Technologies (SmartGIFT 2016), Liverpool, UK, May 2016
- Symposium Co-Chair: Cyber Security Symposium, 2015 IEEE International Conference on Smart Grid Communications (SmartGridComm 2015) , 2-5 November 2015, Miami, USA
- Track Co-Chair: The 7th IEEE International Conference on Cloud Computing Technology and Science (IEEE CloudCom 2015), Canada
- Workshop Co-Chair: International Conference on Ad-Hoc Networks and Wireless (ADHOCNOW 2015), Anthens, Greece, June 2015
Publications for TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks
Optimal battery size for a green base station in a smart grid with a renewable energy source
In IEEE International Conference on Smart Grid Communications . Dresden, Germany: IEEE, 2017.Status: Published
Optimal battery size for a green base station in a smart grid with a renewable energy source
Green base stations, powered by renewable energy sources, have mainly been restricted to remote areas. In urban areas, recent technological advancements have strengthened the bidirectional power flow in microgrids (Smart Grids), giving the possibility of green LTE base stations acting as energy traders. To facilitate this trading, batteries are needed to deal with the inherent stochasticity of renewable energy sources. In this paper we provide a new technique for dimensioning batteries for a base station. We show how the solution depends on different boundary conditions set by the microgrid such as energy balancing cost, transaction fee and power price. The technique is based on a Markov decision process and considers uncertainty in traffic, renewable power production and power price in the microgrid. We also show how to quantify the energy balancing cost for the base station, supplementing current research on energy balancing in microgrids. The results show that for certain microgrid conditions, the value of modelling price uncertainty is insignificant. Also, the results show that it is never optimal to invest in more than the minimum required battery size given certain transaction fee and power price regimes.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | IEEE International Conference on Smart Grid Communications |
Publisher | IEEE |
Place Published | Dresden, Germany |
URL | http://ieeexplore.ieee.org/document/8340658/http://xplorestaging.ieee.or... |
DOI | 10.1109/SmartGridComm.2017.8340658 |
A Distributed Offloading Market for 5G Heterogeneous Network
In IEEE Global Communications Conference. Abu Dhabi,UEA: IEEE, 2018.Status: Published
A Distributed Offloading Market for 5G Heterogeneous Network
Concerns have been raised regarding the economical viability for each operator to have a full regional 5G coverage. A possible solution is to have traffic offloaded to competitors. In this work we present a new scheme for optimal offloading in a stochastic environment. This is more in line with the conditions 5G base stations will face with changing link and traffic conditions. The problem is formulated as a Stackelberg game, and the players' utility functions are derived though queuing models. Numerical results illustrate that our scheme provides a global optimal resource allocation up to a threshold. The threshold is a function of the traffic load and the number of offloading candidates. Beyond the threshold players still have incentives to participate, but the market equilibrium is not globally optimal.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | IEEE Global Communications Conference |
Publisher | IEEE |
Place Published | Abu Dhabi,UEA |
Energy Usage Forecasting for LTE: A Network-Wide Traffic Measurements Study
In IEEE Global Communications Conference. Abu Dhabi, UEA: IEEE, 2018.Status: Published
Energy Usage Forecasting for LTE: A Network-Wide Traffic Measurements Study
Energy usage in LTE base stations are driven by spectral efficiency and traffic. To predict the energy usage these parameters must be forecasted. In this work we analyse hourly measurements collected from more than 12000 base station cells spread across more than 3700 base stations over the course of one month. We show that the two parameters are very weakly correlated, and therefore we investigated them separately. Further, we evaluated the possible gains for advanced prediction methods using a large scale search for individually fitted time series (SARIMA models) for each base station. In total, we examined and evaluated approximately 31000 time series models from an identified group of 4 million potential models. We found that the spectral efficiency measurements can be represented fairly well with time series models, with only an average 6.5\% relative error. The time series models have to be individually adapted for each base station as the unsupervised clustering showed that each cluster's members have a wide variety of best fitted models. However, for traffic the time series models have relative high prediction errors, and we believe there is a potential for new methods to improve the forecasts.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | IEEE Global Communications Conference |
Publisher | IEEE |
Place Published | Abu Dhabi, UEA |
Distributed Uplink Offloading for IoT in 5G Heterogeneous Networks under Private Information Constraints
IEEE Internet of Things Journal (2018): 1.Status: Accepted
Distributed Uplink Offloading for IoT in 5G Heterogeneous Networks under Private Information Constraints
The expected influx of Internet of Things (IoT) in 5G will provide new opportunities for uplink traffic offloading. In general, base stations with proximity require lower transmission power of the IoT device (IoTD), thus saving energy consumption as spectral efficiency (SE) of the transmissions increase. By letting IoTDs send to base stations with better link conditions the IoTDs' battery lifetime is prolonged. In this work we present a many-to-many offloading scheme for uplink traffic. The scheme works when link conditions are private information and gives incentives to all involved players to participate. We believe this approach is better suited for the expected complex ecosystem of 5G base station cells. The sensitivity analyses show that there is a limited gain by requiring that the link conditions are public knowledge. Further, the suggested market optimizes the SE for all involved players. Numerical results show that the IoTDs can on average increase their SE with 25% and their spectral energy efficiency with 40%. The networks which are offloaded to and from can both expect an increase in the SE of 1%-6%. Sensitivity analyses show that the market equilibrium's benefits are robust as they stay positive for a range of different network configurations. Also, the work proves that market equilibrium is stable and unique. To derive the equilibrium, two approaches are presented, a closed form solution and a distributed algorithm, that both are solvable in polynomial time.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2018 |
Journal | IEEE Internet of Things Journal |
Pagination | 1 - 1 |
Date Published | 12/2018 |
Publisher | IEEE |
DOI | 10.1109/JIOT.2018.2886703 |
Selective Offloading in Mobile Edge Computing for Green Internet of Things
IEEE Network Magazine 32, no. 1 (2017): 54-60.Status: Published
Selective Offloading in Mobile Edge Computing for Green Internet of Things
Mobile Edge Computing (MEC) provides the radio access networks with cloud computing capabilities to fulfill the requirements of the Internet of Things (IoT) services such as high reliability and low latency. Offloading services to edge servers can alleviate the storage and computing limitations and prolong the lifetimes of the IoT devices. However, offloading in MEC faces scalability problems due to the massive number of IoT devices. In this article, we present a new integration architecture of the cloud, MEC and IoT, and propose a lightweight request and admission framework to resolve the scalability problem. Without coordination among devices, the proposed framework can be operated at the IoT devices and computing servers separately, by encapsulating latency requirements in offloading requests. Then, a selective offloading scheme is designed to minimize the energy consumption of devices, where the signalling overhead can be further reduced by enabling the devices to be selfnominated or self-denied for offloading. Simulation results show that our proposed selective offloading scheme can satisfy the latency requirements of different services and reduce the energy consumption of the IoT devices.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Network Magazine |
Volume | 32 |
Issue | 1 |
Pagination | 54-60 |
Publisher | IEEE |
Keywords | energy efficiency, Internet of things, Mobile edge computing, scalability, Selective offloading |
DOI | 10.1109/MNET.2018.1700101 |
Contract-theoretic Approach for Delay Constrained Offloading in Vehicular Edge Computing Networks
Mobile Networks and Applications (2018): 1-12.Status: Published
Contract-theoretic Approach for Delay Constrained Offloading in Vehicular Edge Computing Networks
Mobile Edge Computing (MEC) is a promising solution to improve vehicular services through offloading computation to cloud servers in close proximity to mobile vehicles. However, the self-interested nature together with the high mobility characteristic of the vehicles make the design of the computation offloading scheme a significant challenge. In this paper, we propose a new Vehicular Edge Computing (VEC) framework to model the computation offloading process of the mobile vehicles running on a bidirectional road. Based on this framework, we adopt a contract theoretic approach to design optimal offloading strategies for the VEC service provider, which maximize the revenue of the provider while enhancing the utilities of the vehicles. To further improve the utilization of the computing resources of the VEC servers, we incorporate task priority distinction as well as additional resource providing into the design of the offloading scheme, and propose an efficient VEC server selection and computing resource allocation algorithm. Numerical results indicate that our proposed schemes greatly enhance the revenue of the VEC provider, and concurrently improve the utilization of cloud computing resources.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2018 |
Journal | Mobile Networks and Applications |
Pagination | 1-12 |
Publisher | Springer |
Place Published | US |
ISSN | 1572-8153 |
Keywords | Cloud, Contract theory, Mobile edge computing, Vehicular network |
DOI | 10.1007/s11036-018-1032-0 |
Vehicle-to-Grid (V2G) towards Efficiency and Resilience in a Smart Grid
In Halmstad. Sweden, 2017.Status: Published
Vehicle-to-Grid (V2G) towards Efficiency and Resilience in a Smart Grid
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Talks, invited |
Year of Publication | 2017 |
Location of Talk | Halmstad. Sweden |
Type of Talk | Invited Talk |
Enabling Localized Peer-to-Peer Electricity Trading Among Plug-in Hybrid Electric Vehicles Using Consortium Blockchains
IEEE Transactions on Industrial Informatics 13, no. 6 (2017): 3154-3164.Status: Published
Enabling Localized Peer-to-Peer Electricity Trading Among Plug-in Hybrid Electric Vehicles Using Consortium Blockchains
We propose a localized Peer-to-Peer (P2P) electricity trading model for locally buying and selling electricity among Plug-in Hybrid Electric Vehicles (PHEVs) in smart grids. Unlike traditional schemes, that transport electricity over long distances and through complex electricity transportation meshes, our proposed model achieves demand response by providing incentives to discharging PHEVs to balance local electricity demand out of their own self-interests. However, since transaction security and privacy protection issues present serious challenges, we explore a promising consortium blockchain technology to improve transaction security without reliance on a trusted third party. A localized P2P Electricity Trading system with COnsortium blockchaiN (PETCON) method is proposed to illustrate detailed operations of localized P2P electricity trading. Moreover, the electricity pricing and the amount of traded electricity among PHEVs are solved by an iterative double auction mechanism to maximize social welfare in this electricity trading. Security analysis shows that our proposed PETCON improves transaction security and privacy protection. Numerical results based on a real map of Texas indicate that the double auction mechanism can achieve social welfare maximization while protecting privacy of the PHEVs.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Transactions on Industrial Informatics |
Volume | 13 |
Issue | 6 |
Pagination | 3154 - 3164 |
Date Published | 05/2017 |
Publisher | IEEE |
ISSN | 1941-0050 |
Keywords | Consortium blockchain, decentralized energy trading, double auction, plug-in hybrid electric vehicles (PHEVs), security and privacy |
DOI | 10.1109/TII.2017.2709784 |
Toturial on "Software Defined Wireless Networking"
In Paris, France. IEEE, 2017.Status: Published
Toturial on "Software Defined Wireless Networking"
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Talks, contributed |
Year of Publication | 2017 |
Location of Talk | Paris, France |
Publisher | IEEE |
Type of Talk | Tutorial |
Strategic Honeypot Game Model for Distributed Denial of Service Attacks in the Smart Grid
IEEE Transactions on Smart Grid 8, no. 5 (2017): 2474-2482.Status: Published
Strategic Honeypot Game Model for Distributed Denial of Service Attacks in the Smart Grid
Advanced Metering Infrastructure (AMI) is an important component for a smart grid system to measure, collect, store, analyze and operate users consumption data. The need of communication and data transmission between consumers (smart meters) and utilities make AMI vulnerable to various attacks. In this paper, we focus on Distributed Denial of Service (DDoS) attack in the AMI network. We introduce honeypots into the AMI network as a decoy system to detect and gather attack information. We analyze the interactions between the attackers and the defenders, and derive optimal strategies for both sides. We further prove the existence of several Bayesian-Nash Equilibriums (BNEs) in the honeypot game. Finally, we evaluate our proposals on an AMI testbed in the smart grid, and the results show that our proposed strategy is effective in improving the efficiency of defense with the deployment of honeypots.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Transactions on Smart Grid |
Volume | 8 |
Issue | 5 |
Pagination | 2474 - 2482 |
Date Published | 02/2017 |
Publisher | IEEE |
ISSN | 1949-3061 |
DOI | 10.1109/TSG.2017.2670144 |
Publications
Technical reports
Estimating an Additive Path Cost with Explicit Congestion Notification (extended version)
University of Oslo, 2019.Status: Published
Estimating an Additive Path Cost with Explicit Congestion Notification (extended version)
Abstract—Network Utility Maximization (NUM) is a well accepted theoretical concept that describes how congestion controls could cooperate to achieve an ideal sending rate allocation, for given utility functions of senders and constraints of the network. These network constraints are expressed as a “cost” in the framework. In practice, most congestion control mechanisms obtain feedback that is different from a “cost”. This paper focuses on Explicit Congestion Notification (ECN), which has been shown to be quite advantageous when it is available, e.g. with the popular Datacenter TCP (DCTCP) mechanism. However, different from a cost, ECN marks are not additive. We present a practical solution to this problem. Our solution changes how end hosts interpret the ECN signal, while the router side can be implemented via an unusual configuration of RED parameters.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2019 |
Number | 487 |
Date Published | 03/2019 |
Publisher | University of Oslo |
ISBN Number | 978-82-7368-452-3 |
ISSN Number | 0806-3036 |
Notes | Submitted 2018, awaiting completion of reviews |
URL | https://heim.ifi.uio.no/michawe/research/publications/NUM-ECN_report_201... |
Journal Article
On the Utility of Unregulated IP DiffServ Code Point (DSCP) Usage by End Systems
{Performance Evaluation} 135 (2019).Status: Published
On the Utility of Unregulated IP DiffServ Code Point (DSCP) Usage by End Systems
DiffServ was designed to implement service provider quality of service (QoS) policies, where routers change and react upon the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such an application. We present measurements, for both IPv4 and IPv6, of what happens to DSCP values along Internet paths after an end system has set them without any prior agreement between a customer and a service provider. We find that the DSCP is often changed or zeroed along the path, but detrimental effects from using the DSCP are extremely rare; moreover, DSCP values sometimes remain intact (potentially having an effect on traffic) for several AS hops. This positive result motivates an analysis of the potential latency impact from such DSCP usage, for which we present the first measurement results. We find that routers at approximately 3% of more than 100,000 links differentiate between the WebRTC DSCP values (EF, AF42 and CS1) and consistently reduce delay in comparison with probes carrying a zero value (CS0) under congestion. In contrast, routers at around 2% of these links increase the delay by a comparable amount under congestion, uniformly for EF, AF42 and CS1.
Afilliation | Communication Systems |
Project(s) | NorNet, The Center for Resilient Networks and Applications, Simula Metropolitan Center for Digital Engineering, NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet, MELODIC: Multi-cloud Execution-ware for Large-scale Optimised Data-Intensive Computing |
Publication Type | Journal Article |
Year of Publication | 2019 |
Journal | {Performance Evaluation} |
Volume | 135 |
Date Published | 08/2019 |
Publisher | Elsevier |
ISSN | 0166-5316 |
Keywords | DiffServ, DiffServ Code Point, latency, QoS, WebRTC |
URL | https://doi.org/10.1016/j.peva.2019.102036 |
DOI | 10.1016/j.peva.2019.102036 |
Proceedings, refereed
A Distributed Offloading Market for 5G Heterogeneous Network
In IEEE Global Communications Conference. Abu Dhabi,UEA: IEEE, 2018.Status: Published
A Distributed Offloading Market for 5G Heterogeneous Network
Concerns have been raised regarding the economical viability for each operator to have a full regional 5G coverage. A possible solution is to have traffic offloaded to competitors. In this work we present a new scheme for optimal offloading in a stochastic environment. This is more in line with the conditions 5G base stations will face with changing link and traffic conditions. The problem is formulated as a Stackelberg game, and the players' utility functions are derived though queuing models. Numerical results illustrate that our scheme provides a global optimal resource allocation up to a threshold. The threshold is a function of the traffic load and the number of offloading candidates. Beyond the threshold players still have incentives to participate, but the market equilibrium is not globally optimal.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | IEEE Global Communications Conference |
Publisher | IEEE |
Place Published | Abu Dhabi,UEA |
Can WebRTC QoS Work? A DSCP Measurement Study
In 2018 30th International Teletraffic Congress (ITC 30). Vienna, Austria: IEEE Computer Society, 2018.Status: Published
Can WebRTC QoS Work? A DSCP Measurement Study
DiffServ was designed to implement service provider quality of service (QoS) policies, where ingress and egress routers change the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such an application.
As a first step towards understanding whether "WebRTC QoS works", we measured, for both IPv4 and IPv6, what happens to DSCP values along Internet paths. Our study is based on end-to-end measurements from 160 IPv4 and 65 IPv6 geographically spread controlled probe clients to 34 IPv4 and 18 IPv6 servers respectively. Clearly, when the DSCP value is changed, the net result may not be what the application desired. We find that this happens often, and conclude with recommendations on how to improve WebRTC and other applications using the DSCP.
Afilliation | Communication Systems |
Project(s) | The Center for Resilient Networks and Applications, Simula Metropolitan Center for Digital Engineering, NorNet |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | 2018 30th International Teletraffic Congress (ITC 30) |
Pagination | 167-175 |
Date Published | 09/2018 |
Publisher | IEEE Computer Society |
Place Published | Vienna, Austria |
ISBN Number | 978-0-9883045-5-0 |
Keywords | DSCP, Egress, Fling, Ingress, Measurement |
DOI | 10.1109/ITC30.2018.00034 |
ctrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control
In 21st IEEE Global Internet Symposium (GI 2018). Honolulu, HI, USA: IEEE, 2018.Status: Published
ctrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | 21st IEEE Global Internet Symposium (GI 2018) |
Date Published | 04/2018 |
Publisher | IEEE |
Place Published | Honolulu, HI, USA |
Notes | In conjunction with IEEE INFOCOM, Honolulu, HI, USA |
DOI | 10.1109/INFCOMW.2018.8406887 |
Energy Usage Forecasting for LTE: A Network-Wide Traffic Measurements Study
In IEEE Global Communications Conference. Abu Dhabi, UEA: IEEE, 2018.Status: Published
Energy Usage Forecasting for LTE: A Network-Wide Traffic Measurements Study
Energy usage in LTE base stations are driven by spectral efficiency and traffic. To predict the energy usage these parameters must be forecasted. In this work we analyse hourly measurements collected from more than 12000 base station cells spread across more than 3700 base stations over the course of one month. We show that the two parameters are very weakly correlated, and therefore we investigated them separately. Further, we evaluated the possible gains for advanced prediction methods using a large scale search for individually fitted time series (SARIMA models) for each base station. In total, we examined and evaluated approximately 31000 time series models from an identified group of 4 million potential models. We found that the spectral efficiency measurements can be represented fairly well with time series models, with only an average 6.5\% relative error. The time series models have to be individually adapted for each base station as the unsupervised clustering showed that each cluster's members have a wide variety of best fitted models. However, for traffic the time series models have relative high prediction errors, and we believe there is a potential for new methods to improve the forecasts.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | IEEE Global Communications Conference |
Publisher | IEEE |
Place Published | Abu Dhabi, UEA |
Journal Article
Optimal Charging Schemes for Electric Vehicles in Smart Grid: A Contract Theoretic Approach
IEEE Transactions on Intelligent Transportaion Systems 19, no. 9 (2018): 3046-3058.Status: Published
Optimal Charging Schemes for Electric Vehicles in Smart Grid: A Contract Theoretic Approach
Due to their environment friendliness, electric vehicles (EVs) are anticipated to form a considerable fraction of vehicles for transportation in smart cities. It is essential to design an electricity charging scheme that takes the utilities of both the charging stations and the EVs into consideration. However, the self-interested nature of the EVs together with the information asymmetry between the energy demand and supply sides makes the design a significant challenge. In this paper, we propose a queuing network-based model to characterize the charging process of the multiple EVs in a renewable energy-aided charging station. Based on the model, we adopt a contract theoretic approach to design an optimal charging policy in an information asymmetry scenario. Furthermore, we propose the new contract-based charging rate assignment and admission control schemes that maximize the utility of the charging station under certain charging constraints. To derive the optimal contract, we present a two-step iterative algorithm and prove its convergence. We evaluate the proposed schemes based on the IEEE 69-bus distribution test system. Results indicate that the contract-based charging schemes can effectively benefit both the charging stations and the EVs and concurrently improve the load level of the smart grid.
Afilliation | Communication Systems |
Project(s) | Simula Metropolitan Center for Digital Engineering, The Center for Resilient Networks and Applications |
Publication Type | Journal Article |
Year of Publication | 2018 |
Journal | IEEE Transactions on Intelligent Transportaion Systems |
Volume | 19 |
Issue | 9 |
Pagination | 3046-3058 |
Date Published | 09/2018 |
Publisher | IEEE |
Proceedings, refereed
fling: A Flexible Ping for Middlebox Measurements
In 2017 29th International Teletraffic Congress (ITC 29). Vol. 1. IEEE, 2017.Status: Published
fling: A Flexible Ping for Middlebox Measurements
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | 2017 29th International Teletraffic Congress (ITC 29) |
Volume | 1 |
Pagination | 134–142 |
Publisher | IEEE |
Optimal battery size for a green base station in a smart grid with a renewable energy source
In IEEE International Conference on Smart Grid Communications . Dresden, Germany: IEEE, 2017.Status: Published
Optimal battery size for a green base station in a smart grid with a renewable energy source
Green base stations, powered by renewable energy sources, have mainly been restricted to remote areas. In urban areas, recent technological advancements have strengthened the bidirectional power flow in microgrids (Smart Grids), giving the possibility of green LTE base stations acting as energy traders. To facilitate this trading, batteries are needed to deal with the inherent stochasticity of renewable energy sources. In this paper we provide a new technique for dimensioning batteries for a base station. We show how the solution depends on different boundary conditions set by the microgrid such as energy balancing cost, transaction fee and power price. The technique is based on a Markov decision process and considers uncertainty in traffic, renewable power production and power price in the microgrid. We also show how to quantify the energy balancing cost for the base station, supplementing current research on energy balancing in microgrids. The results show that for certain microgrid conditions, the value of modelling price uncertainty is insignificant. Also, the results show that it is never optimal to invest in more than the minimum required battery size given certain transaction fee and power price regimes.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | IEEE International Conference on Smart Grid Communications |
Publisher | IEEE |
Place Published | Dresden, Germany |
URL | http://ieeexplore.ieee.org/document/8340658/http://xplorestaging.ieee.or... |
DOI | 10.1109/SmartGridComm.2017.8340658 |
Journal Article
Selective Offloading in Mobile Edge Computing for Green Internet of Things
IEEE Network Magazine 32, no. 1 (2017): 54-60.Status: Published
Selective Offloading in Mobile Edge Computing for Green Internet of Things
Mobile Edge Computing (MEC) provides the radio access networks with cloud computing capabilities to fulfill the requirements of the Internet of Things (IoT) services such as high reliability and low latency. Offloading services to edge servers can alleviate the storage and computing limitations and prolong the lifetimes of the IoT devices. However, offloading in MEC faces scalability problems due to the massive number of IoT devices. In this article, we present a new integration architecture of the cloud, MEC and IoT, and propose a lightweight request and admission framework to resolve the scalability problem. Without coordination among devices, the proposed framework can be operated at the IoT devices and computing servers separately, by encapsulating latency requirements in offloading requests. Then, a selective offloading scheme is designed to minimize the energy consumption of devices, where the signalling overhead can be further reduced by enabling the devices to be selfnominated or self-denied for offloading. Simulation results show that our proposed selective offloading scheme can satisfy the latency requirements of different services and reduce the energy consumption of the IoT devices.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Network Magazine |
Volume | 32 |
Issue | 1 |
Pagination | 54-60 |
Publisher | IEEE |
Keywords | energy efficiency, Internet of things, Mobile edge computing, scalability, Selective offloading |
DOI | 10.1109/MNET.2018.1700101 |
Software Defined Energy Harvesting Networking for 5G Green Communications
IEEE Wireless Communications Magazine 24, no. 4 (2017): 38-45.Status: Published
Software Defined Energy Harvesting Networking for 5G Green Communications
Energy and spectrum resources play significant roles in fifth generation (5G) communication systems. In industrial applications of the 5G era, green communications are a great challenge for sustainable development of networks. Energy harvesting technology is a promising approach to prolong network lifetime. In energy harvesting networks, nodes may replenish energy from a mobile charger to overcome variations of renewable energy. In this article, energy-rich nodes are stimulated to upload surplus energy to the mobile charger, leading to a bidirectional energy flow. This creates a new paradigm that energy flows coexist with data flows, which gives rise to new problems on controlling the energy flows and the data flows. Software defined networking enables centralized control to optimize flow scheduling. We propose a Software Defined Energy Harvesting Network (SD-EHN) architecture for 5G green communications. In the SD-EHN, the data plane, the energy plane and the control plane are decoupled to support flexible energy scheduling and improve energy efficiency, thus to facilitate sustainability in energy harvesting networks. A scenario with a mobile charger acting as a mobile data collector is presented to introduce an energy trading model in SD-EHN. We use stochastic inventory theory to determine the optimal energy storage levels of the nodes. A Nash bargaining game is proposed to solve the benefit allocation problem for energy trading. Numerical results indicate that SD-EHN optimizes energy utilization and saves energy.
Afilliation | Communication Systems |
Project(s) | TIDENET: Theoretical and Data-driven Approaches for Energy-efficient Networks |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Wireless Communications Magazine |
Volume | 24 |
Issue | 4 |
Pagination | 38-45 |
Publisher | IEEE Wireless Communication Magazine |
DOI | 10.1109/MWC.2017.1600360 |
Journal Article
Demand Response Management in the Smart Grid in a Large Population Regime
IEEE Transactions on Smart Grid 7, no. 1 (2016): 189-199.Status: Published
Demand Response Management in the Smart Grid in a Large Population Regime
In this paper we introduce a hierarchical system model that captures the decision making processes involved in a network of multiple providers and a large number of consumers in the smart grid, incorporating multiple processes from power generation to market activities and to power consumption. We establish a Stackelberg game between providers and end-users, where the providers behave as leaders maximizing their profit, and end-users act as followers maximizing their individual welfare. We obtain closed-form expressions for the Stackelberg equilibrium of the game and prove that a unique equilibrium solution exists. In the large population regime, we show that higher number of providers help improve profits for the providers. This is inline with the goal of facilitating multiple distributed power generation units, one of the main design considerations in the smart grid. We further prove that there exists a unique number of providers that maximize their profits, and develop an iterative and distributed algorithm to obtain it. Finally, we provide numerical examples to illustrate the solutions and to corroborate the results.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Journal Article |
Year of Publication | 2016 |
Journal | IEEE Transactions on Smart Grid |
Volume | 7 |
Issue | 1 |
Pagination | 189-199 |
Date Published | 01/2016 |
Publisher | IEEE |
Keywords | Consumer welfare, Demand response management, large population, profit optimization, Stackelberg game |
Optimal Incentive Design for Cloud-enabled Multimedia Crowdsourcing
IEEE Transactions on Multimedia 18 (2016): 2470-2481.Status: Published
Optimal Incentive Design for Cloud-enabled Multimedia Crowdsourcing
Multimedia crowdsourcing possesses a huge potential to actualize many new applications that are expected to yield tremendous benefits in diverse fields including environment monitoring, emergency rescues during natural catastrophes, online education, sports and entertainment. Nonetheless, multimedia crowdsourcing unfolds new challenges such as big data acquisition and processing, more stringent QoS requirements, and heterogeneity of crowdsensors. Consequently, incentive mechanisms specifically tailored to multimedia crowdsourcing applications need to be developed to fully utilitze the potential of multimedia crowdsourcing. In this paper, we design an optimal incentive mechanism for the smartphone contributors to participate in a cloud-enabled multimedia crowdsourcing scheme. We establish a condition that determines whether the smartphones are eligible to participate, and provide a close form expression for the optimal duration of service from the contributors, for a given reward from the crowdsourcer. Consequently, we derive the conditions for existence of an optimal reward for the contributors from the crowdsourcer, and prove its uniqueness.We numerically illustrate the performance of our model considering logarithmic and linear cost functions for the cloud resources. The similarity of the results for different cost models corroborate the validity of our model and the results, whereas the difference in the magnitudes suggest that the strategy of the crowdsourcer as well as the strategies of the smartphone participants considerably depend on the cloud cost model.
Afilliation | Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Journal Article |
Year of Publication | 2016 |
Journal | IEEE Transactions on Multimedia |
Volume | 18 |
Pagination | 2470-2481 |
Date Published | 08/2016 |
Publisher | IEEE |
DOI | 10.1109/TMM.2016.2604080 |
Social-aware Energy Harvesting Device to Device Communications in 5G Networks
IEEE Wireless Communication Magazine 23, no. 4 (2016): 20-27.Status: Published
Social-aware Energy Harvesting Device to Device Communications in 5G Networks
With ever-increasing demands for local area services in the fifth generation (5G) cellular networks, solutions are necessary to deliver local area data in both a spectrum- and an energy-efficient manner. In this paper we propose a new cellular communication architecture which integrates energy harvesting technologies and social networking characteristics into device-to-device (D2D) communications for local data dissemination. The proposed architecture includes three domains: the physical domain, the energy domain and the social domain. Specifically, in the physical domain, D2D communications enable two nearby users to communicate with each other directly. In the energy domain, devices harvest energy from renewable energy sources. In the social domain, D2D users form social networks exhibiting stable social structures and relations. Then we mainly focus on the efficient local data dissemination issues in the proposed architecture and propose two social-aware energy harvesting D2D communication schemes (a device relaying and a device multicast). Illustrative results demonstrate significant spectrum and energy efficiency enhancement for local data dissemination in 5G cellular networks.
Afilliation | Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Journal Article |
Year of Publication | 2016 |
Journal | IEEE Wireless Communication Magazine |
Volume | 23 |
Issue | 4 |
Pagination | 20-27 |
Publisher | IEEE |
Proceedings, refereed
Even Lower Latency, Even Better Fairness:Logistic Growth Congestion Control in Datacenters
In The 41st IEEE Conference on Local Computer Networks (LCN). IEEE, 2016.Status: Published
Even Lower Latency, Even Better Fairness:Logistic Growth Congestion Control in Datacenters
Datacenter transport has attracted much recent interest, however, most proposed improvements require changing the datacenter fabric, which hinders their applicability and deployability over commodity hardware. In this paper, we present a novel congestion controller, Logistic Growth Control (LGC), for datacenters which does not require changes to the datacenter fabric. LGC uses a similar ECN marking as in DCTCP, but adapts to congestion using the logistic growth function. This function has been proven to have nice characteristics including stability, convergence, fairness, and scalability, which are very appealing for congestion control. As a result, our LGC mechanism operates in the datacenter network in a more stable and fair manner, leading to less queuing and latency. LGC also behaves better than DCTCP, and it converges to the fair share of the bottleneck link capacity irrespective of the Round-Trip-Time (RTT). We discuss the stability and fairness of LGC using a fluid model, and show its performance improvement with simulations.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | The 41st IEEE Conference on Local Computer Networks (LCN) |
Pagination | 10--18 |
Date Published | 11/2016 |
Publisher | IEEE |
ISBN Number | 978-1-5090-2054-6 |
Notes | Dubai, UAE. November 7-10. |
DOI | 10.1109/LCN.2016.12 |
Research Notes | Open access on IEEE Xplore |
Managing real-time media flows through a flow state exchange
In NOMS 2016 IEEE/IFIP Network Operations and Management Symposium, 2016.Status: Published
Managing real-time media flows through a flow state exchange
When multiple congestion controlled flows traverse the same network path, their resulting rate is usually an outcome of their competition at the bottleneck. The WebRTC / RTCWeb suite of standards for inter-browser communication is required to allow prioritization. This is addressed by our previously presented mechanism for coupled congestion control, called the Flow State Exchange (FSE). Here, we present our first simulation results using two mechanisms that have been proposed for IETF standardization: Google Congestion Control (GCC) and Network-Assisted Dynamic Adaptation (NADA). These two mechanisms exhibit aspects that allow us to use a simpler “passive” algorithm in our FSE. Passive coupling allows a less time-constrained request-response style of signaling between congestion control mechanisms and the FSE, which enables the FSE to run as a stand-alone management tool.
Afilliation | Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | NOMS 2016 IEEE/IFIP Network Operations and Management Symposium |
Pagination | 112--120 |
Date Published | 04/2016 |
DOI | 10.1109/NOMS.2016.7502803 |
Proceedings, refereed
Adaptive Rate Control in Smart Grid Heterogenous Communications Networks
In IEEE CIT 2015 (Best Paper Award), 2015.Status: Published
Adaptive Rate Control in Smart Grid Heterogenous Communications Networks
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | IEEE CIT 2015 (Best Paper Award) |
An Optimal Replenishment Strategy in Energy Harvesting Wireless Networks with A Mobile Charger
In QSHINE 2015 (Best Paper Award), 2015.Status: Published
An Optimal Replenishment Strategy in Energy Harvesting Wireless Networks with A Mobile Charger
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | QSHINE 2015 (Best Paper Award) |
Dynamic Resource Pricing and Scalable Cooperation for Mobile Cloud Computing
In The 15th IEEE International Conference on Scalable Computing and Communications (Best paper award). IEEE, 2015.Status: Published
Dynamic Resource Pricing and Scalable Cooperation for Mobile Cloud Computing
Mobile cloud computing is a new paradigm to improve the quality of mobile services, which has drawn considerable attentions in both industrial and academic fields. In this paper, we consider the resource management and sharing problems for radio and computing resources to support mobile applications in mobile cloud computing. In such an environment, service providers can cooperate to form coalition to share their idle resources with each other. We propose a coalition game model based on two-sided matching theory. The coalition game model efficiently reflects the scalable cooperation among the service providers for sharing their idle resources. As a result, the resources can be better utilized and the quality of service for users can be improved. The simulation results indicate that our scheme can optimize the resource utilization and significantly
improve the quality of service of the users.
Afilliation | Networks, Communication Systems, Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | The 15th IEEE International Conference on Scalable Computing and Communications (Best paper award) |
Date Published | 08/2015 |
Publisher | IEEE |
Evaluating Defence Schemes Against Jamming in Vehicle Platoon Networks
In Intelligent Transportation Systems (ITSC), 2015 IEEE 18th International, 2015.Status: Published
Evaluating Defence Schemes Against Jamming in Vehicle Platoon Networks
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | Intelligent Transportation Systems (ITSC), 2015 IEEE 18th International |
Keywords | Global Positioning System, Interference, Jamming, Sensors, Vehicles, Wireless communication |
DOI | 10.1109/ITSC.2015.348 |
Group Bidding for Guaranteed Quality of Energy in V2G Smart Grid Networks
In IEEE International Conference on Communications. London, UK: IEEE, 2015.Status: Published
Group Bidding for Guaranteed Quality of Energy in V2G Smart Grid Networks
With the aid of advanced Information and Communication Technologies (ICT), Vehicle-to-Grid (V2G) networks will play an important role in supporting and enhancing the distributed electricity supply in the next generation power grid–smart grid. In order to ensure stability of the power grid and satisfy the Quality of Energy (QoE) requirements of Electric Vehicles (EVs), this paper proposes a two-level group bidding mechanism for the electric energy trade between the grid and EVs. Communication networks are used to support the exchange of relevant information between the grid and EVs. EVs act as mobile energy storage and compete to be one of the members in the electricity feedback group organized by aggregators. We aim at minimizing the cost of given electricity demand of the grid and maximizing the profit of those auction winner EVs. A quantity based feedback electricity unit pricing scheme is proposed to incentivize the participation of EVs in V2G networks. Moreover, Vickrey-Clarke-Groves (VCG) auction-based algorithms are designed to implement our proposed mechanisms. Simulation results indicate that our mechanism is able to reduce the cost of the grid while offer EVs significant incentives to participate in
the V2G power market.
Afilliation | Communication Systems, Networks, Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | IEEE International Conference on Communications |
Date Published | 06/2015 |
Publisher | IEEE |
Place Published | London, UK |
Keywords | auction, groupselling, truthful bidding strategy, Vehicle-to-Grid (V2G) networks |
Price-based Energy Control for V2G Networks in the Industrial Smart Grid
In INISCOM 2015 (Best Paper Award), 2015.Status: Published
Price-based Energy Control for V2G Networks in the Industrial Smart Grid
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | INISCOM 2015 (Best Paper Award) |
Providing Microgrid Resilience during Emergencies using Distributed Energy Resources
In Globecom 2015. IEEE, 2015.Status: Published
Providing Microgrid Resilience during Emergencies using Distributed Energy Resources
Several incidents reported in the past have shown the inability of the existing power grid to provide reliable services during system failures. Moreover, the communication and control network in the smart grid inherently creates opportunities for the adversaries to launch cyber attacks to the system. Natural disasters may further exacerbate the challenge. Designing resilient (if not robust) solutions for the smart grid therefore, was, and remains a high priority. To this end, we present three solutions towards resilience of a microgrid during emergencies. First, we propose the use of electric vehicles (EVs) as temporary power supplies to support critical infrastructure during emergencies. Second, we recommend to use a combination of distributed renewable energy sources, EVs and a community-level storage unit to further enhance the resilience of the microgrid, by utilizing the locally available renewable energy options, exploiting the electric vehicles moderately, and by investing reasonably on the storage unit. Third, we introduce the software defined networking paradigm as a highly relevant platform for both power virtualization and network function virtualization, to support, coordinate and control the dynamic operation of the virtual power plants for reliable power supply and resilient operations of the microgrid in the disaster mode. Finally, we discuss the feasibility of each of these solutions for implementing them in practice.
Afilliation | Communication Systems, Networks, Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | Globecom 2015 |
Date Published | 12/2015 |
Publisher | IEEE |
Keywords | Community-level storage, distributed energy generation, electric vehicles, emergency, microgrid, Resilience, software defined networking. |
Technical reports
Alternative Backoff: Achieving Low Latency and High Throughput with ECN and AQM
Melbourne, Australia: Centre for Advanced Internet Architectures (CAIA), Swinburne University of Technology, 2015.Status: Published
Alternative Backoff: Achieving Low Latency and High Throughput with ECN and AQM
CoDel and PIE are recently proposed Active Queue Management (AQM) mechanisms that minimize the time packets spend enqueued at a bottleneck, instantiating shallow, 5 ms to 20 ms buffers with short-term packet burst tolerance. However, shallow buffering causes noticeable TCP performance degradation when a path’s underlying round trip time (RTT) heads above 60ms to 80ms (not uncommon with cross-continental and inter-continental traffic). Using less-aggressive multiplicative backoffs is known to compensate for shallow bottleneck buffering. We propose ABE: “Alternative Backoff with ECN”, which consists of enabling Explicit Congestion Notification (ECN) and letting individual TCP senders use a larger multiplica- tive decrease factor in reaction to ECN-marks from AQM- enabled bottlenecks. Using a mix of experiments, theory and simulations with standard NewReno and CUBIC flows, we show significant performance gains in lightly- multiplexed scenarios, without losing the delay-reduction benefits of deploying CoDel or PIE. ABE is a sender- side-only modification that can be deployed incrementally (requiring no flag-day) and offers a compelling reason to deploy and enable ECN across the Internet.
Afilliation | Communication Systems, Communication Systems, Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Technical reports |
Year of Publication | 2015 |
Date Published | 07/2015 |
Publisher | Centre for Advanced Internet Architectures (CAIA), Swinburne University of Technology |
Place Published | Melbourne, Australia |
URL | http://caia.swin.edu.au/reports/150710A/CAIA-TR-150710A.pdf |
Journal Article
An Incentivized Auction Based Group-Selling Approach for Demand Response Management in V2G Systems
IEEE Transactions on Industrial Informatics 11, no. 6 (2015): 1554-1563.Status: Published
An Incentivized Auction Based Group-Selling Approach for Demand Response Management in V2G Systems
Vehicle-to-Grid (V2G) system with efficient Demand Response Management (DRM) is critical to solve the problem of supplying electricity by utilizing surplus electricity available at EVs. An incentivilized DRM approach is studied to reduce the system cost and maintain the system stability. EVs are motivated with dynamic pricing determined by the group-selling based auction. In the proposed approach, a number of aggregators sit on the first level auction responsible to communicate with a group of EVs. EVs as bidders consider Quality of Energy (QoE) requirements and report interests and decisions on the bidding process coordinated by the associated aggregator. Auction winners are determined based on the bidding prices and the amount of electricity sold by the EV bidders. We investigate the impact of the proposed mechanism on the system performance with maximum feedback power constraints of aggregators. The designed mechanism is proven to have essential economic properties. Simulation results indicate the proposed mechanism can reduce the system cost and offer EVs significant incentives to participate in the V2G DRM operation.
Afilliation | Communication Systems, Networks, Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Transactions on Industrial Informatics |
Volume | 11 |
Issue | 6 |
Pagination | 1554-1563 |
Date Published | 12/2015 |
Publisher | IEEE |
Other Numbers | DOI: 10.1109/TII.2015.2482948 |
Keywords | auction, Demand response management, group-selling, Vehicle-to-grid |
DOI | 10.1109/TII.2015.2482948 |
Balancing Power Demand through EV Mobility in Vehicle-to-Grid Mobile Energy Networks
IEEE Transactions on Industrial Informatics 12, no. 1 (2015): 79-90.Status: Published
Balancing Power Demand through EV Mobility in Vehicle-to-Grid Mobile Energy Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Transactions on Industrial Informatics |
Volume | 12 |
Issue | 1 |
Pagination | 79-90 |
Date Published | 02/2016 |
Publisher | IEEE |
Connectivity of Cognitive Device-to-Device Communications Underlying Cellular Networks
IEEE Journal on Selected Areas in Communications (IEEE JSAC) 33, no. 1 (2015).Status: Published
Connectivity of Cognitive Device-to-Device Communications Underlying Cellular Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Journal on Selected Areas in Communications (IEEE JSAC) |
Volume | 33 |
Issue | 1 |
Date Published | 05/2015 |
Publisher | IEEE |
Cooperative Resource Management in Cloud-enabled Vehicular Networks
IEEE Transactions on Industrial Electronics 62, no. 12 (2015): 7938-7951.Status: Published
Cooperative Resource Management in Cloud-enabled Vehicular Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Transactions on Industrial Electronics |
Volume | 62 |
Issue | 12 |
Pagination | 7938-7951 |
Date Published | 12/2015 |
Publisher | IEEE |
Decentralized and Optimal Resource Cooperation in Geo-distributed Mobile Cloud Computing
IEEE Transactions on Emerging Topics in Computing (2015).Status: Published
Decentralized and Optimal Resource Cooperation in Geo-distributed Mobile Cloud Computing
Mobile cloud computing is a key enabling technology in the era of Internet-of-Things. Geo-distributed mobile cloud computing (GMCC) is a new scenario that adds geography consideration in mobile cloud computing. In GMCC, users are able to access cloud resource that are geographically close to their mobile devices. This is expected to reduce communications delay and service providers’ cost compared to the traditional centralized approach. In this paper, we focus on resource sharing through cooperation among service providers in geo-distributed mobile cloud computing. Then, we propose two different strategies for efficient resource cooperation in geographically distributed data centers. Further, we present a coalition game theoretical approach to deal with the competition and cooperation among service providers. Utility functions have been specifically considered to incorporate the cost related to virtual machine migration and resource utilization. Illustrative results indicate that our proposed schemes are able to efficiently utilize limited resource with Quality-of-Service (QoS) consideration.
Afilliation | Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Transactions on Emerging Topics in Computing |
Publisher | IEEE Transactions on Emerging Topics in Computing |
Keywords | cooperation, game theory, Mobile cloud computing, resource management |
MixGroup: Accumulative Pseudonym Exchanging for Location Privacy Enhancement in Vehicular Social Networks
IEEE Transactions on Dependable and Secure Computing 13, no. 1 (2015): 93-105.Status: Published
MixGroup: Accumulative Pseudonym Exchanging for Location Privacy Enhancement in Vehicular Social Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Transactions on Dependable and Secure Computing |
Volume | 13 |
Issue | 1 |
Pagination | 93-105 |
Date Published | 01/2016 |
Publisher | IEEE |
Service Providers Competition and Cooperation in Cloud-based Software Defined Wireless Networks
IEEE Communications Magazine 53, no. 11 (2015): 134-140.Status: Published
Service Providers Competition and Cooperation in Cloud-based Software Defined Wireless Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Communications Magazine |
Volume | 53 |
Issue | 11 |
Pagination | 134-140 |
Date Published | 11/2015 |
Publisher | IEEE |
Toward Secure Energy Harvesting Cooperative Networks
IEEE Communications Magazine 53, no. 8 (2015): 114-121.Status: Published
Toward Secure Energy Harvesting Cooperative Networks
Energy harvesting cooperative networks is an emerging technology that has very high potential for a large variety of applications. However, the energy transfer capability may lead to unprecedented security challenges. In this paper, we will study energy security issues and the solutions in energy harvesting networks. We first identify typical energy related attacks and then propose defense solutions against these attacks. We also carry out security analysis and performance analysis to evaluate our proposed solutions. Simulation results have shown
that the proposed defense solutions are effective and efficient.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2015 |
Journal | IEEE Communications Magazine |
Volume | 53 |
Issue | 8 |
Pagination | 114-121 |
Date Published | 08/2015 |
Publisher | IEEE |
Keywords | cooperative relay, energy attack, Energy harvesting cooperative networks, security and defense |
Journal Article
Distributed Resource Allocation in Cloud-Based Wireless Multimedia Social Networks
IEEE Network 28 (2014): 74-80.Status: Published
Distributed Resource Allocation in Cloud-Based Wireless Multimedia Social Networks
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2014 |
Journal | IEEE Network |
Volume | 28 |
Number | 4 |
Pagination | 74-80 |
Reducing Internet Latency: A Survey of Techniques and their Merits
IEEE Communications Surveys and Tutorials 18, no. 3 (2014): 2149-2196.Status: Published
Reducing Internet Latency: A Survey of Techniques and their Merits
Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically networks have been designed with aims of maximizing throughput and utilization. This article offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, and their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) the structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, especially significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.
Afilliation | Communication Systems, Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Journal Article |
Year of Publication | 2014 |
Journal | IEEE Communications Surveys and Tutorials |
Volume | 18 |
Issue | 3 |
Pagination | 2149–2196 |
Date Published | 10/2016 |
Publisher | IEEE Communications Society |
ISSN | 1553-877X |
Other Numbers | ISSN: 1553-877X |
Keywords | Internet, latency, network |
URL | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6... |
DOI | 10.1109/COMST.2014.2375213 |
User-Centric Demand Response Management in the Smart Grid With Multiple Providers
IEEE Transactions on Emerging Topics in Computing (2014).Status: Published
User-Centric Demand Response Management in the Smart Grid With Multiple Providers
The smart grid is the next generation power grid with bidirectional communications between the electricity users and the providers. Demand response management is vital in the smart grid to reduce power generation costs as well as to lower the users' electricity bills. In this paper, we introduce multiple fossil-fuel and multiple renewable energy sources-based utility companies on the supply side, and propose an end-user oriented utility company selection scheme to minimize user costs. We formulate the problem as a game, incorporating the uncertainty associated with the power supply of the renewable sources, and prove that there exists a Nash equilibrium for the game. To further reduce users' costs, we develop a joint scheme by integrating shiftable load scheduling with utility company selection. We model the joint scheme also as a game, and prove the existence of a Nash equilibrium for the game. For both schemes, we propose distributed
algorithms for the users to nd the equilibrium of the game using only local information. We evaluate our schemes and compare their performances to two other approaches. The results show that our joint utility company selection and shiftable load scheduling scheme incurs the least cost to the users.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2014 |
Journal | IEEE Transactions on Emerging Topics in Computing |
Date Published | 07/2015 |
Publisher | IEEE |
Keywords | Demand response management, discrete time Markov chain, game theory, Nash equilibrium, renewable energy sources, smart grid, user cost. |
Notes | Accepted for publication in IEEE Transactions on Emerging Topics in Computing. Published Online: July 8, 2014 |
Proceedings, refereed
A Survey of Latency Reducing Techniques and their Merits
In Proc. ISOC Workshop on Reducing Internet Latency, 2013.Status: Published
A Survey of Latency Reducing Techniques and their Merits
Afilliation | Communication Systems, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2013 |
Conference Name | Proc. ISOC Workshop on Reducing Internet Latency |
Date Published | 09/2013 |
Keywords | Algorithms, characterisation, co-ordination, congestion, Data Communication, Delay, Internet, metrics, networks, overhead, Performance, QoS, standardisation |
Notes | (Position Paper) |
URL | http://www.internetsociety.org/sites/default/files/pdf/accepted/16_rite-... |
Journal Article
Dependable Demand Response Management in the Smart Grid: a Stackelberg Game Approach
IEEE Transactions on Smart Grid 4 (2013): 120-132.Status: Published
Dependable Demand Response Management in the Smart Grid: a Stackelberg Game Approach
Demand Response Management (DRM) is a key component in the smart grid to effectively reduce power generation costs and user bills. However, it has been an open issue to address the DRM problem in a network of multiple utility companies and consumers where every entity is concerned about maximizing its own benefit. In this paper, we propose a Stackelberg game between utility companies and end-users to maximize the revenue of each utility company and the payoff of each user. We derive analytical results for the Stackelberg equilibrium of the game and prove that a unique solution exists. We develop a distributed algorithm which converges to the equilibrium with only local information available for both utility companies and end-users. Though DRM helps to facilitate the reliability of power supply, the smart grid can be succeptible to privacy and security issues because of communication links between the utility companies and the consumers. We study the impact of an attacker who can manipulate the price information from the utility companies. We also propose a scheme based on the concept of shared reserve power to improve the grid reliability and ensure its dependability.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2013 |
Journal | IEEE Transactions on Smart Grid |
Volume | 4 |
Number | 1 |
Pagination | 120-132 |
Securing Vehicle-to-Grid Communications in the Smart Grid
IEEE Wireless Communications 20 (2013): 66-73.Status: Published
Securing Vehicle-to-Grid Communications in the Smart Grid
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2013 |
Journal | IEEE Wireless Communications |
Volume | 20 |
Number | 6 |
Pagination | 66-73 |
Sensing-Performance Tradeoff in Cognitive Radio Enabled Smart Grid
IEEE Transactions on Smart Grid 4 (2013): 302-310.Status: Published
Sensing-Performance Tradeoff in Cognitive Radio Enabled Smart Grid
Smart grid is widely considered to be the next generation of power grid, where power generation, management, transmission, distribution and utilization are fully upgraded to improve agility, reliability, efficiency, security, economy and environmental friendliness. Demand Response Management (DRM) is recognized as a control unit of smart grid, with the attempt to balance the real-time load as well as to shift the peak-hour load. Communications are critical to the accuracy and optimality of DRM, and hence at the core of the control performance of smart grid. In this paper, we introduce cognitive radio into smart grid to improve the communication quality. By means of spectrum sensing and channel switching, smart meters can decide to transmit data on either an original unlicensed channel or an additional licensed channel, so as to reduce the communication outage. Considering the energy cost taxed by spectrum sensing together with the control performance degradation incurred by imperfect communications, we formulate the sensing-performance tradeoff problem between better control performance and lower communication cost, paving the way towards green smart grid. The impact of the communication outage on the control performance of DRM is also analyzed, which reduces the profit of power provider and the social welfare of smart grid, although it may not always decrease the profit of power consumer. By employing the energy detector, we prove that there exists a unique optimal sensing time which yields the maximum tradeoff revenue, under the constraint that the licensed channel is sufficiently protected. Numerical results are provided to validate our theoretical analysis.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2013 |
Journal | IEEE Transactions on Smart Grid |
Volume | 4 |
Number | 1 |
Pagination | 302-310 |
Toward Cloud-Based Vehicular Networks With Efficient Resource Management
IEEE Network Magazine 27 (2013): 48-55.Status: Published
Toward Cloud-Based Vehicular Networks With Efficient Resource Management
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2013 |
Journal | IEEE Network Magazine |
Volume | 27 |
Number | 5 |
Pagination | 48-55 |
Journal Article
Cognitive Machine-to-Machine Communications: Visions and Potentials for the Smart Grid
IEEE Network Magazine 26 (2012): 6-13.Status: Published
Cognitive Machine-to-Machine Communications: Visions and Potentials for the Smart Grid
Based upon cognitive radio technology, we propose a new Machine-to-Machine (M2M) communications paradigm, namely Cognitive M2M (CM2M) communication. We first motivate the use of cognitive radio technology in M2M communications from different point of views, including technical, applications, industry support, and standardization perspectives. Then, our CM2M network architecture and cognitive machine model are presented and the CM2M systems coexistence in TV white spaces is discussed. After that, a CM2M communications architecture for the smart grid is presented, for which we also propose an energy-efficiency driven spectrum discovery scheme. Numerical results demonstrate significant energy saving and the reliability in supporting data transmissions in the smart grid.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2012 |
Journal | IEEE Network Magazine |
Volume | 26 |
Number | 3 |
Pagination | 6-13 |
Date Published | May-June |
Journal Article
Cognitive Radio Based Hierarchical Communications Infrastructure for Smart Grid
IEEE Network Magazine 25 (2011).Status: Published
Cognitive Radio Based Hierarchical Communications Infrastructure for Smart Grid
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2011 |
Journal | IEEE Network Magazine |
Volume | 25 |
Number | 5 |
Date Published | Sept/Oct. |
Economic Approaches for Cognitive Radio Networks: a Survey
Wireless Personal Communications 57 (2011): 33-51.Status: Published
Economic Approaches for Cognitive Radio Networks: a Survey
Efficient resource allocation is one of the key concerns of implementing cognitive radio networks. Game theory has been extensively used to study the strategic interactions between primary and secondary users for effective resource allocation. The concept of spectrum trading has introduced a new direction for the coexistence of primary and secondary users through economic benefits to primary users. The use of price theory and market theory from economics has played a vital role to facilitate economic models for spectrum trading. So, it is important to understand the feasibility of using economic approaches as well as to realize the technical challenges associated with them for implementation of cognitive radio networks. With this motivation, we present an extensive summary of the related work that use economic approaches such as game theory and/or price theory/market theory to model the behavior of primary and secondary users for spectrum sharing and discuss the associated issues. We also propose some open directions for future research on economic aspects of spectrum sharing in cognitive radio networks.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2011 |
Journal | Wireless Personal Communications |
Volume | 57 |
Number | 1 |
Pagination | 33-51 |
Date Published | March |
Notes | Special issue on Cognitive Radio Networks and Communications |
DOI | 10.1007/s11277-010-0005-9 |
Proceedings, refereed
Distributed Spectrum Sensing in Cognitive Radio Networks With Fairness Consideration: Efficiency of Correlated Equilibrium
In IEEE 8th International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS). IEEE, 2011.Status: Published
Distributed Spectrum Sensing in Cognitive Radio Networks With Fairness Consideration: Efficiency of Correlated Equilibrium
Cooperative spectrum sensing improves the relia- bility of detection. However, if the secondary users are selfish, they may not collaborate for sensing. In order to address this problem, Medium Access Control (MAC) protocols can be designed to enforce cooperation among secondary users for spectrum sensing. In this paper, we investigate this problem using game theoretical framework. We introduce the concept of correlated equilibrium for the cooperative spectrum sensing game among non-cooperative secondary users and formulate the optimization problem for the case where secondary users have heterogeneous traffic dynamics. We show that the correlated equilibrium improves the system utility, as compared to the mixed strategy Nash equilibrium. While maximizing system payoff is important, fairness is also equally important in systems with dissimilar users. In order to address fairness issue, we propose a new fair social welfare correlated equilibrium, which maximizes the system utility and ensures that the less well-off users do not starve. We employ a no-regret learning algorithm for distributed implementation of the correlated equilibrium. Finally, we propose a neighbourhood based learning algorithm and show that it achieves better performance than the no-regret algorithm.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2011 |
Conference Name | IEEE 8th International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS) |
Pagination | 540-549 |
Date Published | October |
Publisher | IEEE |
ISBN Number | 978-0-7695-4469-4 |
Keywords | Conference |
Sensing-Delay Tradeoff for Communication in Cognitive Radio Enabled Smart Grid
In 2nd IEEE International Conference on Smart Grid Communications - SmartGridComm 2011. IEEE, 2011.Status: Published
Sensing-Delay Tradeoff for Communication in Cognitive Radio Enabled Smart Grid
Smart grid is widely considered to be the next gen- eration of power grid, which will be integrated with information feedback communication to improve agility, reliability, efficiency and security. One of the key foundations of smart grid is timely access to meter data via reliable communication infrastructure. In this paper, we introduce cognitive radio into home area networks of smart grid, whose framework and result can be trivially extended to neighborhood and wide area networks. By means of spectrum sensing and channel switching techniques, smart meters can decide to transmit meter data either on the original unlicensed channel or the additional licensed channel, in order to improve reliability and timeliness. We find optimal sensing time to reduce packet loss rate and delay, under the constraint that the PU is sufficiently protected. We formulate the sensing-delay tradeoff problem and prove that it has unique optimal sensing time which yields the minimum delay. Simulation results are provided, which match very well with the theoretical results.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2011 |
Conference Name | 2nd IEEE International Conference on Smart Grid Communications - SmartGridComm 2011 |
Date Published | October |
Publisher | IEEE |
ISBN Number | 978-1-4577-1704-8 |
DOI | 10.1109/SmartGridComm.2011.6102309 |
Book Chapter
Economic Approaches in Cognitive Radio Networks
In Cognitive Radio Mobile Ad Hoc Networks, 403-432. Springer, 2011.Status: Published
Economic Approaches in Cognitive Radio Networks
Afilliation | Networks, Communication Systems |
Publication Type | Book Chapter |
Year of Publication | 2011 |
Book Title | Cognitive Radio Mobile Ad Hoc Networks |
Chapter | 16 |
Pagination | 403-432 |
Publisher | Springer |
ISBN Number | 978-1-4419-6171-6 |
Proceedings, refereed
Delay Reduction for Real Time Services in IEEE 802.22 Wireless Regional Area Network
In The 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2010). IEEE, 2010.Status: Published
Delay Reduction for Real Time Services in IEEE 802.22 Wireless Regional Area Network
Real time traffic such as voice and video have strict requirements on the acceptable end-to-end packet delay. When there are different types of traffic with different requirements on tolerable latency, priority based packet scheduling schemes are normally used in order to reduce the queuing delay for real time services. However, in cognitive radio networks, the time that the system spends on spectrum sensing adds further delay to the packet transmission. In this paper, we propose a new scheme to significantly reduce the overall packet delay, including the delay due to sensing for real time services in cognitive radio networks. We derive the expression for average packet delay for the proposed scheme and the simulation results match well with the analytical results. The numerical results show that the priority based scheduling scheme combined with our scheme substantially reduces the packet delay for real time applications.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2010 |
Conference Name | The 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2010) |
Pagination | 1836-1841 |
Date Published | September 2010 |
Publisher | IEEE |
ISBN Number | 978-1-4244-8017-3 |
DOI | 10.1109/PIMRC.2010.5671631 |
Distributed Spectrum Sensing for Cognitive Radio Networks With Heterogeneous Traffic (Invited Paper)
In 3rd International Workshop on Cognitive Radio and Advanced Spectrum Management. IEEE, 2010.Status: Published
Distributed Spectrum Sensing for Cognitive Radio Networks With Heterogeneous Traffic (Invited Paper)
Cooperative spectrum sensing improves reliability and the detection performance of sensing. However, the fully cooperative scenario may not be realistic to assume in many cases. We consider a cognitive radio network with heavy traffic users and light traffic users and analyze their behavior towards sensing using the concept of mixed strategy Nash equilibrium. Further, we design a distributed game using evolutionary game theory such that as long as light traffic users are present, they share the sensing responsibility while heavy traffic users get a free ride. Finally, the evolution dynamics is shown to converge to the evolutionarily stable strategy for the case of multiple users.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2010 |
Conference Name | 3rd International Workshop on Cognitive Radio and Advanced Spectrum Management |
Publisher | IEEE |
ISBN Number | 978-1-4244-8132-3 |
Patent
Resilient Routing Systems and Methods
2010.Status: Published
Resilient Routing Systems and Methods
Afilliation | Networks, Communication Systems |
Publication Type | Patent |
Year of Publication | 2010 |
Patent Number | US7724674B2 |
Resilient routing systems, computer software product and method
2010.Status: Published
Resilient routing systems, computer software product and method
Afilliation | Networks, Communication Systems |
Publication Type | Patent |
Year of Publication | 2010 |
Patent Number | EP1821472B1 |
Journal Article
Multiple Routing Configurations for Fast IP Network Recovery
IEEE/ACM Transactions on Networking 17 (2009): 473-486.Status: Published
Multiple Routing Configurations for Fast IP Network Recovery
As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2009 |
Journal | IEEE/ACM Transactions on Networking |
Volume | 17 |
Number | 2 |
Pagination | 473-486 |
Date Published | April |
DOI | 10.1109/TNET.2008.926507 |
Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures
IEEE Transactions on Network and Service Management 6, no. 1 (2009): 1-14.Status: Published
Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures
Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any single link or node failure as well as from many combined failures. Second, different failures result in routing over different network topologies, which gives better control of the traffic distribution in the networks after a failure. The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). In this paper we present an enhanced IP FRR scheme which we call ``relaxed MRC'' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. This makes rMRC better suited for successful load distribution after failures and handling of correlated failures. According to our experimental evaluation, the number of backup topologies required to provide protection against the same failures is reduced in rMRC compared to MRC, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better. The paper also presents how rMRC can provide recovery from multiple correlated failures without compromising much on the number of backup topologies required and the path lengths.
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2009 |
Journal | IEEE Transactions on Network and Service Management |
Volume | 6 |
Issue | 1 |
Number | 1 |
Pagination | 1-14 |
Date Published | March |
Publisher | IEEE |
DOI | 10.1109/TNSM.2009.090301 |
Proceedings, refereed
A Novel Method for Re-Routing in OBS Networks
In 7th International Symposium on Communications and Information Technologies. Piscataway, NJ, USA: IEEE, 2007.Status: Published
A Novel Method for Re-Routing in OBS Networks
An important challenge in Optical Burst Switching (OBS) is to reduce the burst loss caused by contention. In this paper we develop a new method that improves the burst loss probability by burst re-routing in case of contention. Our re-routing method guarantees that bursts (that are not discarded) are routed towards the egress on a loop-free path. We have made a detailed discrete event simulation model of OBS networks and evaluated the performance of our new method by comparing it to popular deflection methods. We simulate several realistic network topologies and find that, for realistic loads, re-routing indeed improves burst loss probability and has clear advantages when compared to the discussed deflection methods.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2007 |
Conference Name | 7th International Symposium on Communications and Information Technologies |
Date Published | October |
Publisher | IEEE |
Place Published | Piscataway, NJ, USA |
ISBN Number | 1-4244-0977-2 |
Fast Proactive Recovery From Concurrent Failures
In IEEE International Conference on Communications (ICC 2007). IEEE, 2007.Status: Published
Fast Proactive Recovery From Concurrent Failures
Recovery of traffic in connectionless pure IP networks has traditionally been handled by a full re-convergence of the network state. This process operates in a time scale that is not compatible with new real time and highly dependable services. Recently, schemes for fast local and proactive recovery in connectionless IP networks have been proposed. All these schemes are designed to guarantee recovery of the failure of one component. As IP protocols are used to carry more highly dependable services and new wireless infrastructures are approaching, guaranteed failure coverage of more than one failure becomes necessary. In this paper we present and evaluate a scheme that guarantees to handle any two concurrent failures in a network. We are not aware of any other schemes that addresses such guarantees. We evaluate and compare it with other known recovery schemes, and we show how it gives substantially better recovery success rates than the schemes designed for one fault tolerance, also for more than two failures.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2007 |
Conference Name | IEEE International Conference on Communications (ICC 2007) |
Date Published | June |
Publisher | IEEE |
ISBN Number | 1-4244-0353-7 |
Post-Failure Routing Performance With Multiple Routing Configurations
In IEEE INFOCOM 2007. IEEE, 2007.Status: Published
Post-Failure Routing Performance With Multiple Routing Configurations
The slow convergence of IGP routing protocols after a topology change has led to several proposals for proactive recovery schemes in IP networks. These proposals are limited to guaranteeing loop-free connectivity after a link or node failure, and do not take into account the resulting load distribution in the network. This can lead to congestion and packet drops. In this work, we show how a good load distribution can be achieved in pure IP networks immediately after a link failure, when Multiple Routing Configurations (MRC) is used as a fast recovery mechanism. This paper is the first attempt to improve the load balancing when a proactive recovery scheme is used. Unlike load balancing methods used with normal IP rerouting, our method does not compromise on the routing performance in the failure free case. Our method is evaluated using simulations on several real and synthetically generated network topologies. The evaluation shows that our method yields good routing performance, making it feasible to use MRC to handle transient network failures.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2007 |
Conference Name | IEEE INFOCOM 2007 |
Date Published | May |
Publisher | IEEE |
ISBN Number | 1-4244-1047-0 |
Proceedings, refereed
Alternative Schemes for Proactive IP Recovery
In 2nd Conference on Next Generation Internet Design and Engineering, Valencia, Spain April 3-5. IEEE, 2006.Status: Published
Alternative Schemes for Proactive IP Recovery
Recovery at the IP layer has originally been handled by the slow process of IP re-convergence. As the dependence on the Internet broadens and real time applications like VoIP become a common service of the Internet, fast proactive recovery becomes an important property of the communication protocols. There are currently two IETF initiatives for proactive recovery drawing considerable attention, IP Fast Reroute and Multi-Topology Routing using Multiple Routing Configurations. In this paper we evaluate and compare these approaches.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2006 |
Conference Name | 2nd Conference on Next Generation Internet Design and Engineering, Valencia, Spain April 3-5 |
Pagination | 1-8 |
Date Published | April |
Publisher | IEEE |
ISBN Number | 0-7803-9455-0 |
Fast IP Network Recovery Using Multiple Routing Configurations
In INFOCOM 2006. Barcelona, Spain: IEEE, 2006.Status: Published
Fast IP Network Recovery Using Multiple Routing Configurations
As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2006 |
Conference Name | INFOCOM 2006 |
Pagination | 23-29 |
Date Published | April |
Publisher | IEEE |
Place Published | Barcelona, Spain |
ISBN Number | 1-4244-0222-0 |
Implementation of Two Resilience Mechanisms Using Multi Topology Routing and Stub Routers
In Advanced Internationl Confernece on Telecommunications (AICT'06). IEEE Computer Scociety Press, 2006.Status: Published
Implementation of Two Resilience Mechanisms Using Multi Topology Routing and Stub Routers
Resilient Routing Layers (RRL) and Multiple Routing Configurations (MRC) have been proposed as methods to achieve fast recovery from router and link failures in connectionless networks. In this article we show how RRL and MRC can be implemented using the Multi Topology routing scheme and the Stup Router advertisements currently developed within the IETF. This makes RRL and MRC very viable candidates for protection of IP traffic in the next generation Internet.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2006 |
Conference Name | Advanced Internationl Confernece on Telecommunications (AICT'06) |
Pagination | 29 |
Date Published | February |
Publisher | IEEE Computer Scociety Press |
Notes | ISBN 0-7695-2522-9 |
Technical reports
Routing Efficiency With Link Failures Using Multiple Routing Configurations
Simula Research Laboratory, 2006.Status: Published
Routing Efficiency With Link Failures Using Multiple Routing Configurations
The slow convergence of IGP routing protocols after a topology change has led to several proposals for proactive recovery schemes in IP networks. These proposals are limited to guaranteeing loop-free connectivity after a link or node failure, and do not take into account the resulting load distribution in the network. This can lead to congestion and packet drops. In this work, we show how a good load distribution can be achieved in pure IP networks immediately after a link failure, when Multiple Routing Configurations (MRC) is used as a fast recovery mechanism. This paper is the first attempt to improve the load balancing when a proactive recovery scheme is used. Unlike load balancing methods used with normal IP rerouting, our method does not compromise on the routing performance in the failure free case. Our method is evaluated using simulations on several real and synthetically generated network topologies. The evaluation shows that our method yields good routing performance, making it feasible to use MRC to handle transient network failures.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2006 |
Number | 02-2006 |
Date Published | August |
Publisher | Simula Research Laboratory |
Technical reports
A Comparison of Different Approaches for Calculating Resilient Routing Layers and Multiple Routing Configurations
Simula Research Laboratory, 2005.Status: Published
A Comparison of Different Approaches for Calculating Resilient Routing Layers and Multiple Routing Configurations
Fast proactive recovery has for years been a very import- ant research field due to increased reliability in the Internet for business critical and real-time communications. Resilient Routing Layers (RRL) and Multiple Routing Configurations (MRC) has been proposed as a new approach providing local and proactive recovery. RRL and MRC also provides a network manager with a simple set of sub-topologies as abstractions for the recovery routing. This paper will compare different methods for generating such layers and configurations along two para- meters, scalability and effects on routing of the recovered traffic.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2005 |
Number | 2005-15 |
Date Published | September |
Publisher | Simula Research Laboratory |
Applying the DiffServ Model to a Resilient Packet Ring Network
Simula Research Laboratory, 2005.Status: Published
Applying the DiffServ Model to a Resilient Packet Ring Network
In June 2004, the IEEE approved a new standard called Resilient Packet Ring (RPR), that is maintained in the 802 LAN/MAN Committee and designated standard number IEEE 802.17-2004. Among the features provided by the RPR technology are built-in QoS capabilities for traffic class differentiation, bidirectional transfer of data with destination stripping and spatial reuse and fast protection against node and link failure(s). In this paper, we introduce a framework used to specify the throughput of RPR, and propose a simple mapping between RPR's service classes and DiffServ Per Hop Behavior groups. We evaluate this mapping analytically, using a simple generic example, and by simulation using some selected scenarios. All our findings support that our proposed mapping between RPR's traffic classes and the PHB groups is indeed a viable one.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2005 |
Number | 2005-01 |
Date Published | February 2005 |
Publisher | Simula Research Laboratory |
Congestion Domain Boundaries in Resilient Packet Rings
Simula Research Laboratory, 2005.Status: Published
Congestion Domain Boundaries in Resilient Packet Rings
In June 2004, the IEEE approved a new standard for Resilient Packet Rings (RPR). The standard is maintained in the 802 LAN/MAN Standards Committee, and is designated the standard number 802.17. In this paper, we analyze and discuss performance aspects of the Resilient Packet Ring fairness mechanism. We explain that, if the ring is not configured correctly, the fairness mechanism fails to stabilize at a fair division of bandwidth between the active nodes. We present a novel addition to the fairness algorithm, and show that with this modification, RPR reaches a stable state with more optimal parameter settings. We also show that our proposed modification gives shorter convergence time for the Resilient Packet Ring fairness algorithm.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2005 |
Number | 2005-03 |
Date Published | February 2005 |
Publisher | Simula Research Laboratory |
Improvement of Resilient Packet Ring Fairness
Simula Research Laboratory, 2005.Status: Published
Improvement of Resilient Packet Ring Fairness
Resilient Packet Ring (RPR) is a recent networking standard developed by the IEEE LAN/MAN working group. RPR is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. The fairness algorithm has two modes of operation, called respectively the aggressive and the conservative fairness modes. For some scenarios, the aggressive mode fairness suffers from severe performance deficiencies. In this paper, we propose two novel contributions. The first is a measurement method which enables a node to determine its operating context. The second contribution is a fair rate calculation method, termed the moderate fairness mode, which solves the aggressive mode performance deficiencies while retaining several other properties provided by the aggressive mode fairness. We compare the performance of the moderate fairness mode to that of the aggressive and the conservative modes by simulations, and find that for some scenarios the moderate mode outperforms the aggressive and the conservative modes. For some other scenarios, the convergence time of the moderate mode is somewhat longer than that of the aggressive mode.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2005 |
Number | 2005-02 |
Date Published | February |
Publisher | Simula Research Laboratory |
Proceedings, refereed
An Analytical Bound for Convergence of the Resilient Packet Ring Aggressive Mode Fairness Algorithm
In Proceedings of the 40th annual IEEE International Conference on Communications, Seoul, Korea, May 16-20. IEEE, 2005.Status: Published
An Analytical Bound for Convergence of the Resilient Packet Ring Aggressive Mode Fairness Algorithm
Resilient Packet Ring (RPR) is a new standard, designated IEEE standard number 802.17, for MAN and WAN dual ring topologies. RPR uses the buffer insertion principle as a basis for its medium access control protocol. In this paper, we analyze parts of the aggressive mode of the RPR fairness protocol. We look at a congested node, and utilize control systems theory to analyze the stability of the associated fairness algorithm. In particular, we discuss how the settings of the two important parameters ageCoef and lpCoef influence the stability of an RPR-network. At the end of the paper we present simulated scenarios in order to illustrate our results.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of the 40th annual IEEE International Conference on Communications, Seoul, Korea, May 16-20 |
Date Published | May |
Publisher | IEEE |
Notes | ISBN 0-7803-8938-7 |
Applicability of Resilient Routing Layers for K-Fault Network Recovery
In Proceedings of International Conference on Networking (ICN), Reunion, France April 17-21. Vol. 3421 ed. Springer-Verlag GmbH, 2005.Status: Published
Applicability of Resilient Routing Layers for K-Fault Network Recovery
Most networks experience several failures every day, and often multiple failures occur simultaneously. Still, most recovery mechanisms are not designed to handle multiple failures. We recently proposed a versatile recovery method called Resilient Routing Layers, and in this paper we analyze its suitability for handling multiple failures of network components. We propose a simple probabilistic algorithm for RRL layer creation, and evaluate its performance by comparing it with the Redundant Trees recovery mechanism. We show that not only does RRL provide better fault tolerance, but it also has qualitative advantages that make it very interesting in network systems design.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of International Conference on Networking (ICN), Reunion, France April 17-21 |
Edition | Vol. 3421 |
Pagination | 173-183 |
Publisher | Springer-Verlag GmbH |
Notes | ISSN 0302-9743, ISBN 3-540-25339-4, |
Applying the DiffServ Model to a Resilient Packet Ring Network
In Proceedings of Networking 2005, Waterloo, Ontario, Canada May 2-6. LNCS 3462. Springer, 2005.Status: Published
Applying the DiffServ Model to a Resilient Packet Ring Network
In this paper we introduce a formal specification of parts of the service differentiation mechanisms of the recent IEEE 802.17 Resilient Packet Ring (RPR) standard, and assess RPR's suitability for use in a DiffServ environment. We propose a simple mapping between RPR's traffic classes and three standardized DiffServ Per Hop Behavior groups. When using this mapping, we discuss, by use of an analytical example and simulation results, the behavior of the traffic assigned to each PHB group in terms of its throughput (all PHBs) and delay properties (for the EF PHB only). For the simulation part, we use our OPNET implementation of the RPR standard.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of Networking 2005, Waterloo, Ontario, Canada May 2-6 |
Pagination | 1461-1464 |
Date Published | May |
Publisher | Springer |
Notes | ISSN 0302-9743, ISBN 3-540-25809-4 |
Discrete Event Simulation of a Large OBS Network
In Proceedings 2005 IEEE International Conference on Systems, Man and Cybernetics, Big Island, Hawaii, October 10-12. IEEE, 2005.Status: Published
Discrete Event Simulation of a Large OBS Network
Optical Burst Switching (OBS) is a much researched paradigm for the next generation optical Internet. We have made a detailed discrete event simulation model of OBS networks. Among other things our model includes self similar traffic sources, burst assembly with fixed and variable length bursts, burst scheduling, wavelength conversion and fiber delay lines. In this paper we simulate a large optical burst-switched backbone network using the COST 239 network topology that connects 11 European cities. The performance of this realistic network is investigated, mainly by varying the load and the number of channels (lambdas). We propose and evaluate a new method for the utilization of otherwise unused network capacity by very low priority traffic. Other interesting results include how total burst loss increase when high priority bursts are used.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings 2005 IEEE International Conference on Systems, Man and Cybernetics, Big Island, Hawaii, October 10-12 |
Date Published | October |
Publisher | IEEE |
Notes | ISBN 0-7803-9299-X |
Fast Recovery From Link Failures Using Resilient Routing Layers
In 10th IEEE Symposium on Computers and Communications (ISCC 2005). Cartagena, Spain, June 27-30: IEEE Communications Society, 2005.Status: Published
Fast Recovery From Link Failures Using Resilient Routing Layers
We present a novel scheme for network recovery, named Resilient Routing Layers (RRL). Our proposed scheme is based on calculating fully connected topology subsets, termed layers, which are used to forward traffic in case of a network failure. For the purpose of this work, the layers are created to protect against link failures only. RRL keeps pre-calculated backup routing information in the network stations. This allows local response to network failures, which gives recovery in the order of milliseconds. The main strengths of our approach are its flexibility, as it is independent of the network technology used, and its simplicity, as it offers the network operator a simple and coherent view of the resources available after a link failure. We also show that our scheme scales well for networks of several hundred nodes.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | 10th IEEE Symposium on Computers and Communications (ISCC 2005) |
Pagination | 554-560 |
Date Published | June |
Publisher | IEEE Communications Society |
Place Published | Cartagena, Spain, June 27-30 |
Notes | ISSN 1530-1346, ISBN 0-7695-2373-0 |
Fast, Effective and Stable IP Recovery Using Resilient Routing Layers
In The 19th International Teletraffic Congress (ITC19) Beijing, China. Beijing University of Posts and Telecommunications Press, 2005.Status: Published
Fast, Effective and Stable IP Recovery Using Resilient Routing Layers
Recovery at the IP layer is hampered by the slow convergence of IP rerouting. Recovery times in the range of seconds do not adhere to the requirements of many Internet applications today. To offer fast, pre-configured and loop-free IP recovery we have proposed a new method named Resilient Routing Layers (RRL). In this paper we demonstrate how RRL also can provide resource-effective recovery in IP networks. We compare the performance of RRL with what intuitively should be the most resource-effective method: Full global rerouting.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | The 19th International Teletraffic Congress (ITC19) Beijing, China |
Pagination | 1631-1640 |
Date Published | August |
Publisher | Beijing University of Posts and Telecommunications Press |
Notes | ISBN 7-5635-1141-5 |
Improvement of Resilient Packet Ring Fairness
In Proceedings of the 48th annual IEEE Global Telecommunications Conference (GLOBECOM 2005), St. Lous, Missouri, USA, November 28-December 2. IEEE, 2005.Status: Published
Improvement of Resilient Packet Ring Fairness
Resilient Packet Ring (RPR, IEEE std. 802.17- 2004) is a recent networking standard developed by the IEEE LAN/MAN working group. RPR is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. In its attempt to control a set of nodes sending behavior over a congested link, the RPR fairness algorithm suffers from two severe performance deficiencies. The first concerns how the node closest to a congested link calculates a fair rate estimate, the second deficiency relates to the method used to distribute this fair rate estimate to nodes upstream from the congested node. In this paper, we analyze these deficiencies and propose improvements to resolve them.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of the 48th annual IEEE Global Telecommunications Conference (GLOBECOM 2005), St. Lous, Missouri, USA, November 28-December 2 |
Date Published | November |
Publisher | IEEE |
Notes | ISBN 0-7803-9414-3 |
Performance Evaluation and Improvement of Non-Stable Resilent Packet Ring Behavior
In Proceedings of the 4th International Conference on Networking (ICN'05), Reunion, France, April 17-21 2005. LNCS 3421. Springer-Verlag GmbH, 2005.Status: Published
Performance Evaluation and Improvement of Non-Stable Resilent Packet Ring Behavior
Resilient Packet Ring (RPR) is a new networking standard developed by the IEEE LAN/MAN working group. RPR is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. In its attempt to distribute bandwidth fairly, the calculated fair rate in general oscillates and under some conditions the oscillations continue indefinitely even under stable load conditions. In this paper, we evaluate the performance of the RPR ring during oscillations. In particular, we analyze transient behavior and how the oscillations of the fairness algorithm influence the throughput, both on a per node basis and for the total throughput of the ring. For congestion-situations, we conclude that, in most cases, RPR allows for full link-utilization and fair bandwidth distribution of the congested link. A modification to the RPR fairness algorithm has previously been proposed by the authors. We compare the improved fairness algorithm to the original, and find that the modified algorithm, for all evaluated scenarios perform at least as well as the original. In some problem scenarios, we find that the modified algorithm performs significantly better than the original.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of the 4th International Conference on Networking (ICN'05), Reunion, France, April 17-21 2005 |
Pagination | 551-563 |
Date Published | April |
Publisher | Springer-Verlag GmbH |
Notes | ISSN 0302-9743, ISBN 3-540-25339-4 |
Protection of RPR Strict Order Traffic
In Proceedings 14th IEEE Workshop on Local and Metropolitan Area Networks. Chania, Crete September 18-21: IEEE, 2005.Status: Published
Protection of RPR Strict Order Traffic
Resilient Packet Ring (RPR, IEEE 802.17) is designed with a protection mechanism aiming at restoring traffic on the ring within 50 ms in case of a link or node failure. However, the total experienced disruption time often exceeds this if strict order delivery of packets is required, since a 40 ms (configurable from 10 ms to 100 ms) topology stabilisation timer is used to avoid packet reordering. In this article, we present three alternative ways to avoid packet reordering for strict order traffic in RPR networks. The three suggested methods are discussed analytically, and simulations are used to compare their performance. Our simulation results suggest that the new methods give up to 90% reduction in packet loss during a failure situation compared to the current RPR standard.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings 14th IEEE Workshop on Local and Metropolitan Area Networks |
Date Published | September |
Publisher | IEEE |
Place Published | Chania, Crete September 18-21 |
Resilent Packet Ring Low Priority Traffic Latency
In Proceedings of the 2005 International Conference on Communications in Computing: CIC 2005, Los Angeles CA, USA, February 2-4. CSREA Press, 2005.Status: Published
Resilent Packet Ring Low Priority Traffic Latency
Resilient Packet Ring (RPR - IEEE 802.17) is an insertion buffer, dual ring technology, utilizing a back pressure based fairness algorithm to distribute bandwidth when congestion occurs. The fairness algorithm may oscillate and under some conditions the oscillations continue indefinitely even under stable load conditions. In this paper, we evaluate the latency experienced by packets sent during such oscillations. We analyze transient behavior and how the oscillations of the fairness algorithm influence the jitter caused by unfair access to the ring, as well as jitter caused by the insertion buffers around the ring. We conclude that, in most cases, latency and jitter are within acceptable bounds. A modification to the RPR fairness algorithm has previously been proposed by the authors, but its implications on latency has never before been demonstrated. We compare the improved fairness algorithm to the original, and find that the modified algorithm, for all evaluated scenarios, perform at least as well as the original with respect to latency and jitter. In some problem scenarios, we find that the modified algorithm performs significantly better than the original.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings of the 2005 International Conference on Communications in Computing: CIC 2005, Los Angeles CA, USA, February 2-4 |
Date Published | June |
Publisher | CSREA Press |
Notes | ISBN-1-932415-48-3 |
Resilient Routing Layers and P-Cycles: Tradeoffs in Network Fault Tolerance
In Proceedings 2005 Workshop on High Performance Switching and Routing, Hong Kong May 12-14. IEEE, 2005.Status: Published
Resilient Routing Layers and P-Cycles: Tradeoffs in Network Fault Tolerance
We compare p-cycles and the recently introduced Resilient Routing Layers as candidate schemes for network-level fault protection. Using computational routing trials we show that RRL has shorter backup path lengths and more successful double-link fault protection. On the other hand, p-cycles may require less forwarding state. Several tradeoffs of interest for network designers are described.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Proceedings 2005 Workshop on High Performance Switching and Routing, Hong Kong May 12-14 |
Publisher | IEEE |
Notes | ISBN 0-7803-8924-7 |
Resilient Routing Layers for Network Disaster Planning
In Networking - ICN 2005: 4th International Conference on Networking, Reunion April 17-21. Lecture Notes in Computer Science, Volume 3421 / 2005. Springer-Verlag GmbH, 2005.Status: Published
Resilient Routing Layers for Network Disaster Planning
Most research on network recovery has been centered around two common assumptions regarding failure characteristics: Failures do not occur simultaneously and failures do mostly strike links. Even this may be the characteristics of everyday failures, we argue that disasters like earthquakes, power outages and terrorist attacks impose other failure characteristics. In this paper we demonstrate how our method, called Resilient Routing Layers, can be used as a tool for recovery from failures adhering to such disaster characteristics.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | Networking - ICN 2005: 4th International Conference on Networking, Reunion April 17-21 |
Pagination | 1097-1105 |
Date Published | March |
Publisher | Springer-Verlag GmbH |
Notes | ISSN 0302-9743, ISBN 3-540-25339-4, |
Resilient Routing Layers for Recovery in Packet Networks
In International Conference on Dependable Systems and Networks (DSN 2005) Yokohama, Japan, June 28-July 1. IEEE Computer Society, 2005.Status: Published
Resilient Routing Layers for Recovery in Packet Networks
The existing methods for network recovery are often complex and seldom used by network administrators. In this paper we present a novel approach for global and local recovery named Resilient Routing Layers (RRL). The method is supported by algorithms, but also simple enough for a network administrator to implement by hand for reasonably sized networks. The idea in our approach is that for each node in the network there is a topology subset called a “safe layer”, which can handle any traffc affected by a fault in the node itself, or any of its links. By analysis using different network topologies, we demonstrate that our approach performs well compared to other comparable methods. Particularly, we demonstrate RRLs performance for backup-path lengths and state information overhead that are assumed to be the weakest parameters for our method. We discuss implementation issues of RRL, and demonstrate its applicability to MPLS networks.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2005 |
Conference Name | International Conference on Dependable Systems and Networks (DSN 2005) Yokohama, Japan, June 28-July 1 |
Date Published | June |
Publisher | IEEE Computer Society |
Notes | ISBN 0-7695-2282-3 |
Proceedings, non-refereed
Resilient Routing Layers: an Overview of Technology and Applications
In EURO NGI Workshop on Traffic Engineering, Protection and Restoration, Rome April 18-20. EuroNGI, 2005.Status: Published
Resilient Routing Layers: an Overview of Technology and Applications
A thorough study of the network recovery methods available today reveals that there still exist a great potential for improvements. Most methods are optimized for handling single link failures, thus providing inadequate protection for node failures. Methods are often too complex to be adopted by network administrators in practice. Recovery in connectionless IP networks is still hampered by inappropriate delayed recovery due to slow convergence of IP rerouting. The authors have recently proposed Resilient Routing Layers (RRL) as an answer to some of the deficiencies observed from current methods. In this paper we will describe main features of RRL, present some recent research results and sketch our plans for future work.
Afilliation | Communication Systems, Communication Systems |
Publication Type | Proceedings, non-refereed |
Year of Publication | 2005 |
Conference Name | EURO NGI Workshop on Traffic Engineering, Protection and Restoration, Rome April 18-20 |
Date Published | April |
Publisher | EuroNGI |
Talks, contributed
A Method for Recovery in Packet Networks
In Norwegian Network Research Seminar 2004, 2004.Status: Published
A Method for Recovery in Packet Networks
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2004 |
Location of Talk | Norwegian Network Research Seminar 2004 |
Notes | The same content as the Simula Technical Report 2004-13 |
Proceedings, refereed
Analysis and Improved Performance of RPR Protection
In Proceedings of the 12th IEEE Conference On Networks (ICON'04). Singapore: IEEE Computer Society Press, 2004.Status: Published
Analysis and Improved Performance of RPR Protection
Resilient Packet Ring (RPR, IEEE 802.17) is designed with a protection mechanism aiming at restoring traffic on the ring within 50 ms in case of a link or station failure. In this article, we evaluate RPR protection with respect to service disruption, packet reordering and packet loss. Different error scenarios are simulated, with both steering and wrapping protection. Unfortunately, the 50 ms restoration time guarantee can not always be met if in order delivery of packets is required, since RPR uses a quite long (default 40 ms) topology stabilisation period to avoid packet reordering. We suggest a novel protection mechanism, that does not have to wait for the new topology to be stable, and that gives sub 50 ms restoration for all traffic. We also show that for in order delivery of packets, our new mechanisms discards a very low number of packets compared to the mechanism of the RPR standard.
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2004 |
Conference Name | Proceedings of the 12th IEEE Conference On Networks (ICON'04) |
Pagination | 119-124 |
Date Published | November 16-19 |
Publisher | IEEE Computer Society Press |
Place Published | Singapore |
Performance Evaluation of an Enhanced Bridging Algorithm in RPR Networks
In Proceedings 3rd International Conference on Networking (ICN'04). Guadeloupe, French Caribbean: IEEE Computer Society Press, 2004.Status: Published
Performance Evaluation of an Enhanced Bridging Algorithm in RPR Networks
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2004 |
Conference Name | Proceedings 3rd International Conference on Networking (ICN'04) |
Pagination | 760-767 |
Date Published | February 29 - March 4 |
Publisher | IEEE Computer Society Press |
Place Published | Guadeloupe, French Caribbean |
The Stability of the Resilient Packet Ring Aggressive Fairness Algorithm
In Proceedings of the 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN2004). Mill Valley, California, USA: IEEE Computer Society Press, 2004.Status: Published
The Stability of the Resilient Packet Ring Aggressive Fairness Algorithm
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2004 |
Conference Name | Proceedings of the 13th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN2004) |
Pagination | 17-22 |
Date Published | April 24-27 |
Publisher | IEEE Computer Society Press |
Place Published | Mill Valley, California, USA |
The Vine Project: Towards Predictable Communication in Heterogeneous Networks
In Proceedings of the 3rd International Conference on Networking (ICN'04). Guadeloupe, French Caribbean: IEEE Computer Society Press, 2004.Status: Published
The Vine Project: Towards Predictable Communication in Heterogeneous Networks
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2004 |
Conference Name | Proceedings of the 3rd International Conference on Networking (ICN'04) |
Pagination | 830-837 |
Date Published | February 29 - March 4 |
Publisher | IEEE Computer Society Press |
Place Published | Guadeloupe, French Caribbean |
Technical reports
Applying the DiffServ Model to a Resilient Packet Ring Network
Simula Research Laboratory, 2004.Status: Published
Applying the DiffServ Model to a Resilient Packet Ring Network
Afilliation | Networks, Communication Systems |
Publication Type | Technical reports |
Year of Publication | 2004 |
Number | 2004-14 |
Publisher | Simula Research Laboratory |
Resilient Routing Layers: a Simple and Flexible Approach for Resilience in Packet Networks
Simula Research Laboratory, 2004.Status: Published
Resilient Routing Layers: a Simple and Flexible Approach for Resilience in Packet Networks
Afilliation | Networks, Communication Systems |
Publication Type | Technical reports |
Year of Publication | 2004 |
Number | 2004-13 |
Publisher | Simula Research Laboratory |
Notes | This report has later been updated and refined as "Resilient Routing Layers for Recovery in Packet Networks". |
Journal Article
IEEE 802.17 Resilient Packet Ring Tutorial
IEEE Communications Magazine 42 (2004): 112-118.Status: Published
IEEE 802.17 Resilient Packet Ring Tutorial
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2004 |
Journal | IEEE Communications Magazine |
Volume | 42 |
Number | 3 |
Pagination | 112-118 |
Date Published | March |
Technical reports
IEEE 802.17 Resilient Packet Ring Background and Overview
Simula Research Laboratory, 2003.Status: Published
IEEE 802.17 Resilient Packet Ring Background and Overview
The IEEE Working group P802.17 is standardizing a new ring topology network architecture, called the Resilient Packet Ring (RPR), to be used mainly in metropolitan and wide area networks. This paper presents a technology background, gives an overview, and explains many of the design choices the RPR working group faced during the development of the standard. Some major architectural features are illustrated and compared by showing performance evaluation results using the RPR simulator developed at Simula Research Laboratory using the OPNET Modeler simulation environment.
Afilliation | Networks, Communication Systems |
Publication Type | Technical reports |
Year of Publication | 2003 |
Number | 2003-11 |
Date Published | December |
Publisher | Simula Research Laboratory |
The Simula RPR Simulator Implemented in Java
Simula Research Laboratory, 2003.Status: Published
The Simula RPR Simulator Implemented in Java
Afilliation | Networks, Communication Systems |
Publication Type | Technical reports |
Year of Publication | 2003 |
Number | 2003-12 |
Date Published | December |
Publisher | Simula Research Laboratory |
Talks, contributed
The Simula RPR Simulator Written I Java
In Presentation at the July 2003 IEEE 802.17 plenary meeting, 2003.Status: Published
The Simula RPR Simulator Written I Java
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2003 |
Location of Talk | Presentation at the July 2003 IEEE 802.17 plenary meeting |
Proceedings, refereed
A Fairness Algorithm for High-Speed Networks Based on a Resilient Packet Ring Architecture
In Proceedings of 2002 IEEE International Conference on Systems, Man and Cybernetics. Hammamet, Tunesia, 2002.Status: Published
A Fairness Algorithm for High-Speed Networks Based on a Resilient Packet Ring Architecture
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2002 |
Conference Name | Proceedings of 2002 IEEE International Conference on Systems, Man and Cybernetics |
Pagination | 279-284 |
Date Published | October 6-9 |
Place Published | Hammamet, Tunesia |
Avoiding Head-of-Line Blocking Using an Enhanced Fairness Algorithm
In Proceedings of the International Conference on Telecommunication (ICT 2002), Paper C089, 6 pages. Beijing, China, 2002.Status: Published
Avoiding Head-of-Line Blocking Using an Enhanced Fairness Algorithm
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2002 |
Conference Name | Proceedings of the International Conference on Telecommunication (ICT 2002), Paper C089, 6 pages |
Date Published | 21-26 June |
Place Published | Beijing, China |
Improved Fairness and Class of Service Behaviour in a Resilient Packet Ring
In Proceedings of 12th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2002). Stockholm, Sweden, 2002.Status: Published
Improved Fairness and Class of Service Behaviour in a Resilient Packet Ring
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2002 |
Conference Name | Proceedings of 12th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2002) |
Date Published | August 11-13 |
Place Published | Stockholm, Sweden |
Performance Evaluation of Back-Pressure Fairness in RPR
In Proceedings of the 7th European Conference on Networks & Optical Communications. Darmstadt, Germany: a, 2002.Status: Published
Performance Evaluation of Back-Pressure Fairness in RPR
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2002 |
Conference Name | Proceedings of the 7th European Conference on Networks & Optical Communications |
Pagination | 293-300 |
Date Published | June 18 - 21 |
Publisher | a |
Place Published | Darmstadt, Germany |
Talks, contributed
IP Multicast: Idé Som Forenkler Innholdsdistribusjon
In Telenor ToU magasinet, 2002.Status: Published
IP Multicast: Idé Som Forenkler Innholdsdistribusjon
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2002 |
Location of Talk | Telenor ToU magasinet |
Lessons Learned From Java Simulations
In Presentation at the January 2002 IEEE 802.17 interim meeting, 2002.Status: Published
Lessons Learned From Java Simulations
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2002 |
Location of Talk | Presentation at the January 2002 IEEE 802.17 interim meeting |
RPR's Worst Case Scenario?
In Presentation at the July 2002 IEEE 802.17 plenary meeting, 2002.Status: Published
RPR's Worst Case Scenario?
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2002 |
Location of Talk | Presentation at the July 2002 IEEE 802.17 plenary meeting |
Journal Article
Tree Recovery in PIM Sparse Mode
Telecommunication Systems 19 (2002): 443-460.Status: Published
Tree Recovery in PIM Sparse Mode
Afilliation | Networks, Communication Systems |
Publication Type | Journal Article |
Year of Publication | 2002 |
Journal | Telecommunication Systems |
Volume | 19 |
Number | 3-4 |
Pagination | 443-460 |
Date Published | March - April |
Talks, contributed
A Fairness Algorithm for Dynamic Spatial Reuse Avoiding HOL Blocking
In Presentation at the September 2001 IEEE 802.17 interim meeting, 2001.Status: Published
A Fairness Algorithm for Dynamic Spatial Reuse Avoiding HOL Blocking
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2001 |
Location of Talk | Presentation at the September 2001 IEEE 802.17 interim meeting |
C++ and Java: a Comparison and an Evaluation
In Technologies for component based, distributed systems workshop, 2001.Status: Published
C++ and Java: a Comparison and an Evaluation
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2001 |
Location of Talk | Technologies for component based, distributed systems workshop |
Notes | Talk (in Norwegian), Norwegian Computer Society |
Evaluation of an Enhanced Fairness Algorithm That Avoids HOL Blocking
In Presentation at the September 2001 IEEE 802.17 interim meeting, 2001.Status: Published
Evaluation of an Enhanced Fairness Algorithm That Avoids HOL Blocking
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2001 |
Location of Talk | Presentation at the September 2001 IEEE 802.17 interim meeting |
Flow Control Algorithms Revisited
In Presentation at the November 2001 IEEE 802.17 plenary meeting, 2001.Status: Published
Flow Control Algorithms Revisited
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2001 |
Location of Talk | Presentation at the November 2001 IEEE 802.17 plenary meeting |
Preliminary Performance Results From a Simple Java Model
In Presentation at the May 2001 IEEE 802.17 interime meeting, 2001.Status: Published
Preliminary Performance Results From a Simple Java Model
Afilliation | Networks, Communication Systems |
Publication Type | Talks, contributed |
Year of Publication | 2001 |
Location of Talk | Presentation at the May 2001 IEEE 802.17 interime meeting |
Proceedings, refereed
An Improved PIM-SM Tree Recovery Algorithm
In Proceedings IEEE Workshop in High Performance Switching and Routing. Dallas, Texas: IEEE, 2001.Status: Published
An Improved PIM-SM Tree Recovery Algorithm
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2001 |
Conference Name | Proceedings IEEE Workshop in High Performance Switching and Routing |
Date Published | June |
Publisher | IEEE |
Place Published | Dallas, Texas |
Performace Evaluation of PIM-SM Recovery
In Proceedings IEEE International Conference on Networking, ICN´01. Colmar, France: Springer-Verlag, 2001.Status: Published
Performace Evaluation of PIM-SM Recovery
Afilliation | Networks, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2001 |
Conference Name | Proceedings IEEE International Conference on Networking, ICN´01 |
Date Published | July |
Publisher | Springer-Verlag |
Place Published | Colmar, France |
Technical reports
Topology Construction for Inter-Domain Network Protocol Simulations
Department of Informatics, University of Oslo, 2001.Status: Published
Topology Construction for Inter-Domain Network Protocol Simulations
Afilliation | Networks, Communication Systems |
Publication Type | Technical reports |
Year of Publication | 2001 |
Number | 296 |
Date Published | August |
Publisher | Department of Informatics, University of Oslo |
Notes | ISBN 82-7368-246-3 |
Talks, contributed
Internett-Protokoller Og IETF
In Forskningsnotat 2/2000, Telenor FoU, 63 sider, 2000.Status: Published
Internett-Protokoller Og IETF
Publication Type | Talks, contributed |
Year of Publication | 2000 |
Location of Talk | Forskningsnotat 2/2000, Telenor FoU, 63 sider |
Proceedings, refereed
Running the SAR Application on a Cluster of PCs Connected With SCI Using a HIC Based SCI Switch
In Conference Proceedings of SCI Europe'99 in Euro-Par 99. Toulouse, 1999.Status: Published
Running the SAR Application on a Cluster of PCs Connected With SCI Using a HIC Based SCI Switch
Publication Type | Proceedings, refereed |
Year of Publication | 1999 |
Conference Name | Conference Proceedings of SCI Europe'99 in Euro-Par 99 |
Place Published | Toulouse |
Notes | ISBN 82-14-00014-9 |
Wireless Experimental Metropolitan Area Network Using IPv6 in Norway (WEMAN)
In Proceedings of the Thirty-Second Annual Hawaii International Conference on System Sciences. Maui, Hawaii,, 1999.Status: Published
Wireless Experimental Metropolitan Area Network Using IPv6 in Norway (WEMAN)
Publication Type | Proceedings, refereed |
Year of Publication | 1999 |
Conference Name | Proceedings of the Thirty-Second Annual Hawaii International Conference on System Sciences |
Place Published | Maui, Hawaii, |
Proceedings, refereed
A Study of Three Dynamic Approaches to Handle Widely Shared Data in Shared-Memory Multiprocessors
In Proceedings, International Conference on Supercomputing 1998 (ICS 98). Melbourne, Australia, 1998.Status: Published
A Study of Three Dynamic Approaches to Handle Widely Shared Data in Shared-Memory Multiprocessors
Publication Type | Proceedings, refereed |
Year of Publication | 1998 |
Conference Name | Proceedings, International Conference on Supercomputing 1998 (ICS 98) |
Date Published | July, |
Place Published | Melbourne, Australia |
Proceedings, refereed
An Operating System Independent Driver for an I/O Based SCI Interface
In Proceedings of the Sixth International Workshop on SCI-based High-performance Low-Cost Computing, 1997.Status: Published
An Operating System Independent Driver for an I/O Based SCI Interface
Publication Type | Proceedings, refereed |
Year of Publication | 1997 |
Conference Name | Proceedings of the Sixth International Workshop on SCI-based High-performance Low-Cost Computing |
Date Published | March, |
Proceedings, refereed
Cluster Communication Using a PCI to SCI Interface
In Proceedings IASTED International Conference on Parallel and Distributed Computing and Systems. Chicago, Illinois, USA, 1996.Status: Published
Cluster Communication Using a PCI to SCI Interface
Publication Type | Proceedings, refereed |
Year of Publication | 1996 |
Conference Name | Proceedings IASTED International Conference on Parallel and Distributed Computing and Systems |
Pagination | 283-289 |
Date Published | Oktober, |
Place Published | Chicago, Illinois, USA |
Constructing SCI-Configurations That Are Free From Deadlocks
In Proceedings of The Fifth International Workshop on SCI-based High-performance Low-Cost Computing. Santa Clara (California),, 1996.Status: Published
Constructing SCI-Configurations That Are Free From Deadlocks
Publication Type | Proceedings, refereed |
Year of Publication | 1996 |
Conference Name | Proceedings of The Fifth International Workshop on SCI-based High-performance Low-Cost Computing |
Pagination | 55-62 |
Place Published | Santa Clara (California), |
Talks, contributed
On SCI-Configurations and Deadlocks
In Proceedings from NIK'96: Norsk Informatikk Konferanse, 1996.Status: Published
On SCI-Configurations and Deadlocks
Publication Type | Talks, contributed |
Year of Publication | 1996 |
Location of Talk | Proceedings from NIK'96: Norsk Informatikk Konferanse |
Proceedings, refereed
Aspects of Running the SCI-Protocol Over HIC Networks
In Proceedings of the Second International Workshop on SCI-based High-performance Low-Cost Computing. Santa Clara (California),, 1995.Status: Published
Aspects of Running the SCI-Protocol Over HIC Networks
Publication Type | Proceedings, refereed |
Year of Publication | 1995 |
Conference Name | Proceedings of the Second International Workshop on SCI-based High-performance Low-Cost Computing |
Pagination | 31-638 |
Place Published | Santa Clara (California), |
Aspects of Running the SCI-Protocol Over HIC-Networks
In Proceedings of The Second International Workshop on SCI-based High-performance Low-Cost Computing. Santa Clara (California),, 1995.Status: Published
Aspects of Running the SCI-Protocol Over HIC-Networks
Publication Type | Proceedings, refereed |
Year of Publication | 1995 |
Conference Name | Proceedings of The Second International Workshop on SCI-based High-performance Low-Cost Computing |
Pagination | 31-38 |
Place Published | Santa Clara (California), |
Technical reports
Aspects of Running the SCI-Protocol Over HIC-Networks
Department of Informatics, University of Oslo, 1995.Status: Published
Aspects of Running the SCI-Protocol Over HIC-Networks
Publication Type | Technical reports |
Year of Publication | 1995 |
Number | 198 |
Publisher | Department of Informatics, University of Oslo |
Talks, contributed
Preliminary Simulation Results of an SCI Based Clustered Database Machine
In International Workshop on Computer Architecture, 1995.Status: Published
Preliminary Simulation Results of an SCI Based Clustered Database Machine
Publication Type | Talks, contributed |
Year of Publication | 1995 |
Location of Talk | International Workshop on Computer Architecture |
Requirements Imposed by SCI and ATM
In OMI-MACRAMÉ project deliverable D3.1.1, 1995.Status: Published
Requirements Imposed by SCI and ATM
Publication Type | Talks, contributed |
Year of Publication | 1995 |
Location of Talk | OMI-MACRAMÉ project deliverable D3.1.1 |
Proceedings, refereed
Hardware Support for Synchronization in the Scalable Coherent Interface (SCI)
In Proceedings IPPS'94. Cancun, Mexico, 1994.Status: Published
Hardware Support for Synchronization in the Scalable Coherent Interface (SCI)
Publication Type | Proceedings, refereed |
Year of Publication | 1994 |
Conference Name | Proceedings IPPS'94 |
Date Published | April, |
Place Published | Cancun, Mexico |
The Performance of the RamLink Memory Architecture
In Proceedings HICSS'94. Hawaii, 1994.Status: Published
The Performance of the RamLink Memory Architecture
Publication Type | Proceedings, refereed |
Year of Publication | 1994 |
Conference Name | Proceedings HICSS'94 |
Pagination | 154-162 |
Date Published | January, |
Place Published | Hawaii |
Journal Article
A RAM Link for High Speed
IEEE Spectrum (1992).Status: Published
A RAM Link for High Speed
Publication Type | Journal Article |
Year of Publication | 1992 |
Journal | IEEE Spectrum |
Proceedings, refereed
A Top Down Approach to the Formal Specification of SCI Cache Coherence
In Computer Aided Verification, 3rd International Workshop (CAV'91). Lecture Notes in Computer Science. Springer-Verlag, 1992.Status: Published
A Top Down Approach to the Formal Specification of SCI Cache Coherence
Publication Type | Proceedings, refereed |
Year of Publication | 1992 |
Conference Name | Computer Aided Verification, 3rd International Workshop (CAV'91) |
Publisher | Springer-Verlag |
RamLink: a High-Bandwidth Point-to-Point Memory Architecture
In Proceedings CompCon 1992. San Fransisco, 1992.Status: Published
RamLink: a High-Bandwidth Point-to-Point Memory Architecture
Publication Type | Proceedings, refereed |
Year of Publication | 1992 |
Conference Name | Proceedings CompCon 1992 |
Date Published | February |
Place Published | San Fransisco |
Notes | Invited paper presented by Stein Gjessing |
Book Chapter
The SCI Cache Coherence Protocol
In Scalable Memory Multiprocessors. Kluwer Academic Publishers, 1992.Status: Published
The SCI Cache Coherence Protocol
Publication Type | Book Chapter |
Year of Publication | 1992 |
Book Title | Scalable Memory Multiprocessors |
Publisher | Kluwer Academic Publishers |
Proceedings, refereed
SCI - Cache Coherence
In Proceedings of Open Bus Systems. Paris, 1991.Status: Published
SCI - Cache Coherence
Publication Type | Proceedings, refereed |
Year of Publication | 1991 |
Conference Name | Proceedings of Open Bus Systems |
Date Published | November, |
Place Published | Paris |
Technical reports
A Top Down Approach to the Formal Specification of SCI Cache Coherence
Department of Informatics, University of Oslo, 1990.Status: Published
A Top Down Approach to the Formal Specification of SCI Cache Coherence
Publication Type | Technical reports |
Year of Publication | 1990 |
Number | 146 |
Date Published | August, |
Publisher | Department of Informatics, University of Oslo |
Approaching Verification of the SCI Cache Coherence Protocol
Department of Informatics, University of Oslo, 1990.Status: Published
Approaching Verification of the SCI Cache Coherence Protocol
Publication Type | Technical reports |
Year of Publication | 1990 |
Number | 145 |
Date Published | August, |
Publisher | Department of Informatics, University of Oslo |
Parallel Composition of Observable Processes With Shared Variables
Department of Informatics, University of Oslo, 1990.Status: Published
Parallel Composition of Observable Processes With Shared Variables
Publication Type | Technical reports |
Year of Publication | 1990 |
Number | 143 |
Date Published | August, |
Publisher | Department of Informatics, University of Oslo |
Journal Article
Distributed Directory Scheme: Scalable Coherent Interface
IEEE Computer Magazine (1990).Status: Published
Distributed Directory Scheme: Scalable Coherent Interface
Publication Type | Journal Article |
Year of Publication | 1990 |
Journal | IEEE Computer Magazine |
Proceedings, refereed
Formal Specification and Verification of SCI Cache Coherence
In Norsk Informatikk Konferanse, 1989.Status: Published
Formal Specification and Verification of SCI Cache Coherence
Publication Type | Proceedings, refereed |
Year of Publication | 1989 |
Conference Name | Norsk Informatikk Konferanse |
Date Published | november, |
Trace Based Verification of Parallel Programs With Shared Variables
In 22nd Annual Hawaii International Conference on System Sciences, 1989.Status: Published
Trace Based Verification of Parallel Programs With Shared Variables
Publication Type | Proceedings, refereed |
Year of Publication | 1989 |
Conference Name | 22nd Annual Hawaii International Conference on System Sciences |
Date Published | January, |
Proceedings, refereed
Database Concepts Described in an Object-Oriented Perspective
In Proceedings of the European Conference on Object-Oriented Programming Oslo. Lecture Notes in Computer Science. -: Springer-Verlag, 1988.Status: Published
Database Concepts Described in an Object-Oriented Perspective
Publication Type | Proceedings, refereed |
Year of Publication | 1988 |
Conference Name | Proceedings of the European Conference on Object-Oriented Programming Oslo |
Pagination | 300-318 |
Date Published | 15th-17th August |
Publisher | Springer-Verlag |
Place Published | - |
Edited books
European Conference on Object-Oriented Programming - ECOOP'88
Vol. 322. Springer, 1988.Status: Published
European Conference on Object-Oriented Programming - ECOOP'88
Publication Type | Edited books |
Year of Publication | 1988 |
Volume | 322 |
Publisher | Springer |
Book Chapter
Invariants in Systems of Processes and Monitors
In Distributed Computing. North Holland, 1988.Status: Published
Invariants in Systems of Processes and Monitors
Publication Type | Book Chapter |
Year of Publication | 1988 |
Book Title | Distributed Computing |
Publisher | North Holland |
Journal Article
Semantics and Verification of Monitors and Systems of Monitors and Processes
Distributed Computing 2, (1988).Status: Published
Semantics and Verification of Monitors and Systems of Monitors and Processes
Publication Type | Journal Article |
Year of Publication | 1988 |
Journal | Distributed Computing |
Volume | 2, |
Technical reports
Verification of Systems of Processes and Monitors - Two Examples
Department of Informatics, University of Oslo, 1987.Status: Published
Verification of Systems of Processes and Monitors - Two Examples
Publication Type | Technical reports |
Year of Publication | 1987 |
Number | 110 |
Date Published | June, |
Publisher | Department of Informatics, University of Oslo |
Technical reports
An Axiomatic Semantics of Concurrent Processes and Monitors
Department of Informatics, University of Oslo, 1985.Status: Published
An Axiomatic Semantics of Concurrent Processes and Monitors
Publication Type | Technical reports |
Year of Publication | 1985 |
Number | 95 |
Date Published | August, |
Publisher | Department of Informatics, University of Oslo |
Talks, contributed
Communication Between the S-2000 and Multibus Equipment
In Sim-X technical specification, 1984.Status: Published
Communication Between the S-2000 and Multibus Equipment
Publication Type | Talks, contributed |
Year of Publication | 1984 |
Location of Talk | Sim-X technical specification |
Datastart, Maskinarbeidsbok I Turbo-Pascal and Compas-Pascal
In Misc, 1984.Status: Published
Datastart, Maskinarbeidsbok I Turbo-Pascal and Compas-Pascal
Publication Type | Talks, contributed |
Year of Publication | 1984 |
Location of Talk | Misc |
Notes | Textbook in Norwegian |
Slang/sla S-2000 Hardware Reference Manual. Edition 2.0
In Norsk Regnesentral and Sim-X, 1984.Status: Published
Slang/sla S-2000 Hardware Reference Manual. Edition 2.0
Publication Type | Talks, contributed |
Year of Publication | 1984 |
Location of Talk | Norsk Regnesentral and Sim-X |
PhD Thesis
Aspects of Semantics and Verification of Monitors
Department of Informatics, University of Oslo, 1983.Status: Published
Aspects of Semantics and Verification of Monitors
Publication Type | PhD Thesis |
Year of Publication | 1983 |
Publisher | Department of Informatics, University of Oslo |
Thesis Type | phd |
Talks, contributed
Mach-S: the Simula Workstation
In Mach-S information, Sept. 1983, Norsk Regnesentral, 1983.Status: Published
Mach-S: the Simula Workstation
Publication Type | Talks, contributed |
Year of Publication | 1983 |
Location of Talk | Mach-S information, Sept. 1983, Norsk Regnesentral |
Technical reports
Verification of Monitors Based on a Partial Correctness Semantics
Department of Informatics, University of Oslo, 1983.Status: Published
Verification of Monitors Based on a Partial Correctness Semantics
Publication Type | Technical reports |
Year of Publication | 1983 |
Number | 95 |
Date Published | July, |
Publisher | Department of Informatics, University of Oslo |
Proceedings, refereed
Programming Monitors in Simula
In Proceedings 1982 Association of Simula Users (ASU) conference. Los Angeles, California,, 1982.Status: Published
Programming Monitors in Simula
Publication Type | Proceedings, refereed |
Year of Publication | 1982 |
Conference Name | Proceedings 1982 Association of Simula Users (ASU) conference |
Place Published | Los Angeles, California, |
Talks, contributed
Slang/S-2000 Hardware Reference Manual. Edition 1.0
In Mach-S information, May 1982, Norsk Regnesentral, 1982.Status: Published
Slang/S-2000 Hardware Reference Manual. Edition 1.0
Publication Type | Talks, contributed |
Year of Publication | 1982 |
Location of Talk | Mach-S information, May 1982, Norsk Regnesentral |
The Syntax and the Semantics of Slang - a Simpel S-Code Based Language for the Mach-S
In Mach-S information, January 1982, Norsk Regnesentral, 1982.Status: Published
The Syntax and the Semantics of Slang - a Simpel S-Code Based Language for the Mach-S
Publication Type | Talks, contributed |
Year of Publication | 1982 |
Location of Talk | Mach-S information, January 1982, Norsk Regnesentral |
Journal Article
Monitors With Arrays of Condition Variables and Proof Rules Handling Local Quantities
BIT 20 (1980).Status: Published
Monitors With Arrays of Condition Variables and Proof Rules Handling Local Quantities
Publication Type | Journal Article |
Year of Publication | 1980 |
Journal | BIT |
Volume | 20 |
Number | 2, |
Technical reports
Microcomputer Interrupt Servicing in an Environment of Processes and Monitors
Department of Informatics, University of Oslo, 1979.Status: Published
Microcomputer Interrupt Servicing in an Environment of Processes and Monitors
Publication Type | Technical reports |
Year of Publication | 1979 |
Number | 46 |
Date Published | June, |
Publisher | Department of Informatics, University of Oslo |
Microcomputer Software Design and Programming Using the Concepts of Processes and Monitors - a Case Study
Department of Informatics, University of Oslo, 1979.Status: Published
Microcomputer Software Design and Programming Using the Concepts of Processes and Monitors - a Case Study
Publication Type | Technical reports |
Year of Publication | 1979 |
Number | 47 |
Date Published | June, |
Publisher | Department of Informatics, University of Oslo |
Talks, contributed
Modulær Programmering Av Mikromaskiner Ved Hjelp Av Prosesser Og Monitorer
In Misc, 1979.Status: Published
Modulær Programmering Av Mikromaskiner Ved Hjelp Av Prosesser Og Monitorer
Publication Type | Talks, contributed |
Year of Publication | 1979 |
Location of Talk | Misc |
Journal Article
Monitors With Associated Processors
BIT 19 (1979).Status: Published
Monitors With Associated Processors
Publication Type | Journal Article |
Year of Publication | 1979 |
Journal | BIT |
Volume | 19 |
Number | 3, |
Journal Article
Compile Time Preparation for Run Time Scheduling in Monitors
BIT 18 (1978).Status: Published
Compile Time Preparation for Run Time Scheduling in Monitors
Publication Type | Journal Article |
Year of Publication | 1978 |
Journal | BIT |
Volume | 18 |
Number | 1, |
Technical reports
MYINT - MYLOC
A/S Mycron, 1978.Status: Published
MYINT - MYLOC
Publication Type | Technical reports |
Year of Publication | 1978 |
Publisher | A/S Mycron |
The Structure of the MUMI Multi Microcomputer System
Department of Informatics, University of Oslo, 1978.Status: Published
The Structure of the MUMI Multi Microcomputer System
Publication Type | Technical reports |
Year of Publication | 1978 |
Number | 31 |
Date Published | March, |
Publisher | Department of Informatics, University of Oslo |
Talks, contributed
MYINT Users Manual
In AS Mycron, 1978.Status: Published
MYINT Users Manual
Publication Type | Talks, contributed |
Year of Publication | 1978 |
Location of Talk | AS Mycron |
MYMUX - Mycron Multiprocessor Executor V. 2.0
In A/S Mycron, 1978.Status: Published
MYMUX - Mycron Multiprocessor Executor V. 2.0
Publication Type | Talks, contributed |
Year of Publication | 1978 |
Location of Talk | A/S Mycron |
Talks, contributed
Operativsystemer
In Forelesningsreferat i emnet ``Operativsystemer'', 1977.Status: Published
Operativsystemer
Publication Type | Talks, contributed |
Year of Publication | 1977 |
Location of Talk | Forelesningsreferat i emnet ``Operativsystemer'' |
Notes | Lecture notes in Norwegian |