@inbook {28023,
	title = {5G-sikkerhet: Norge mellom stormaktene},
	booktitle = {Digitalisering og internasjonal politikk},
	year = {2022},
	month = {01/2022},
	publisher = {Universitetsforlaget},
	organization = {Universitetsforlaget},
	chapter = {7},
	isbn = {9788215052557},
	author = {Friis, Karsten and Lysne, Olav},
	editor = {Bergsj{\o}, H{\r a}kon and Friis, Karsten}
}
@misc {28474,
	title = {Chinese Cyberwarfare - interview in French TV-program },
	year = {2022},
	publisher = {arte.tv},
	url = {https://www.arte.tv/en/videos/092189-000-A/chinese-cyberwarfare/},
	author = {Lysne, Olav}
}
@misc {42735,
	title = {Cyber Warfare:  Supply- and Service Chains},
	howpublished = {Multi-Modal Warfare, Safe House Global, Washington, DC, USA},
	year = {2022},
	author = {Lysne, Olav}
}
@misc {28475,
	title = {Cybersikkerhet med Olav Lysne},
	year = {2022},
	publisher = {L{\o}rntech},
	type = {Masterclass},
	address = {lorn.tech},
	url = {https://www.lorn.tech/cybersikkerhet-med-olav-lysne/1126-leksjon-2-i-cybersikkerhet-eksempler},
	author = {Lysne, Olav}
}
@inbook {42578,
	title = {Data aggregation and anonymization for mathematical modeling and epidemiological studies},
	booktitle = {Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	pages = {121{\textendash}141},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {An important secondary purpose of the Smittestopp development was to provide aggregated data sets describing mobility and social interactions in Norway{\textquoteright}s population. The data were to be used to monitor the effect of government regulations and recommendations, provide input to advanced computational models to predict the pandemic{\textquoteright}s spread, and provide input to fundamental epidemiology research. In this chapter we describe the challenges and technical solutions of Smittestopp{\textquoteright}s data aggregation, as well as preliminary results from the time period when the app was active.We first give a detailed overview of the requirements, specifying the types of data to be collected and the level of spatial and temporal aggregation. We then proceed to describe the concepts for anonymization via :-anonymity and Y-differential privacy (Y-DP ), and the technical solutions for collecting and aggregating data from the database. In particular, we present details of how GPS- and Bluetooth events were mapped to geographical regions and points of interest, and the solutions employed for efficient data retrieval and processing. The preliminary results demonstrate how the recorded GPS- and Bluetooth events match with expected temporal and spatial variations in mobility and social interactions, and indicate the usefulness of the aggregated data as a tool for pandemic monitoring and research. One of the main criticisms of Smittestopp concerns the centralized storage of individuals{\textquoteright} movements, even if such data were used and presented only at an aggregated and anonymized level. In this chapter, we also outline a completely different approach, where the GPS data do not leave the user{\textquoteright}s phone but are, instead, pre-processed to a much higher level of privacy before being dispatched to a server-side data aggregation algorithm. This approach, which would make the app significantly less intrusive, is made possible by recent advances in determining close contacts from Bluetooth data, either by a revised Smittestopp algorithm or by means of the Google/Apple Exposure Notification framework.},
	isbn = {978-3-031-05466-2},
	doi = {10.1007/978-3-031-05466-2_7},
	url = {https://doi.org/10.1007/978-3-031-05466-2_7},
	author = {Are Magnus {Bruaset} and Glenn T. {Lines} and Sundnes, Joakim},
	editor = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@misc {42555,
	title = {Data samlet fra {\r a}pne kilder er ikke ufarlig},
	year = {2022},
	publisher = {Aftenposten},
	address = {Kronikk},
	author = {Lysne, Olav and Str{\"u}mke, Inga and Riegler, Michael}
}
@misc {42739,
	title = {Democratic oversight of Norway{\textquoteright}s intelligence and security services},
	year = {2022},
	publisher = {Nordic Surveillance Control Conference},
	author = {Lysne, Olav}
}
@misc {42732,
	title = {Digital risiko {\textendash} hva er de sentrale utfordringene? Hva er mulige l{\o}sninger?},
	howpublished = {Totalberedskapskommisjonen, Oslo, Norway},
	year = {2022},
	publisher = {Totalberedskapskommisjonen},
	author = {Lysne, Olav}
}
@inbook {42975,
	title = {Digital tracing, validation, and reporting},
	booktitle = {Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	pages = {99{\textendash}120},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {Manual contact tracing has been a key component in controlling the outbreak of the COVID-19 pandemic. The identification and isolation of close contacts of confirmed cases have successfully interrupted transmission chains and reduced the disease spread. Even though manual contact tracing has been widely used, its practice has shown that it is slow and cannot be scaled up once the epidemic grows beyond the early phase. In this case, digital contact tracing can play a significant role in controlling the pandemic. In this chapter, based on our experience and lessons learned from the Smittestopp project, we discuss the main prerequisites for the efficient implementation and validation of digital contact tracing in a population. Specifically, we discuss how to translate a close contact defined for manual tracing to proximity events discovered by a phone, that is, how to define a meaningful risk score and validate the digital contact tracing. We discuss challenges related to each step and provide solutions to some of them, even though questions still remain.},
	isbn = {978-3-031-05466-2},
	doi = {10.1007/978-3-031-05466-2_6},
	url = {https://doi.org/10.1007/978-3-031-05466-2_6},
	author = {Elmokashfi, Ahmed and Simon W {Funke} and Klock, Timo and Kuchta, Miroslav and Naumova, Valeriya and Julie Johanne {Uv}},
	editor = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@misc {42737,
	title = {Henger Internett i en tynn tr{\r a}d?},
	year = {2022},
	publisher = {Arendalsuka},
	author = {Lysne, Olav}
}
@misc {42556,
	title = {Hvor ble det av cyberkrigen?},
	year = {2022},
	publisher = {Aftenposten},
	author = {Lysne, Olav and Bryhni, Haakon}
}
@misc {28476,
	title = {Hvorfor er vi redde for Huawei?},
	year = {2022},
	publisher = {NUPI},
	type = {Podcast},
	url = {https://shows.acast.com/utenrikshospitalet/episodes/hvorfor-er-vi-redde-for-huawei},
	author = {Friis, Karsten and Lysne, Olav}
}
@misc {42922,
	title = {Hvorfor venter vi {\guillemotleft}skandale{\guillemotright} hver gang it-sikkerheten sjekkes i staten?},
	year = {2022},
	month = {11/2022},
	publisher = {Dagens N{\ae}ringsliv},
	type = {Popular science},
	abstract = {Det eneste som kan gi bedre datasikkerhet i staten raskt, er at politikerne tar beslutninger som g{\r a}r p{\r a} tvers av sektorene. Mer ansvar og myndighet til NSM og Justisdepartementet er en mulig l{\o}sning.},
	keywords = {Security},
	url = {https://www.dn.no/innlegg/datasikkerhet/it-sikkerhet/cyberangrep/hvorfor-venter-vi-skandale-hver-gang-it-sikkerheten-sjekkes-i-staten/2-1-1344094},
	author = {Lysne, Olav and Bryhni, Haakon}
}
@misc {28477,
	title = {Kommentarer til "M{\r a}lbilder for Robuste ekomnett mot 2030"},
	howpublished = {Nasjonal Kommunikasjonsmyndighet sin offentliggj{\o}ring av m{\r a}lbilder mot 2030},
	year = {2022},
	publisher = {NKOM},
	author = {Lysne, Olav}
}
@misc {43025,
	title = {Krig i Ukraina:~ Hva har vi l{\ae}rt, og hva b{\o}r vi gj{\o}re? },
	howpublished = {IKT-Norge},
	year = {2022},
	author = {Lysne, Olav}
}
@misc {42736,
	title = {Overv{\r a}kning i Norge i Perspektiv av Ukraina-krigen},
	year = {2022},
	publisher = {Arendalsuka},
	author = {Lysne, Olav}
}
@misc {43026,
	title = {Refleksjoner om Telenors kjerneinfrastruktur},
	howpublished = {Kommunal- og distriktsdepartementet, Oslo, Norway},
	year = {2022},
	author = {Lysne, Olav}
}
@inbook {42536,
	title = {Smittestopp analytics: Analysis of position data},
	booktitle = { Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	month = {06/2022},
	pages = {63 - 79},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {Contact tracing applications generally rely on Bluetooth data. This type of data works well to determine whether a contact occurred (smartphones were close to each other) but cannot offer the contextual information GPS data can offer. Did the contact happen on a bus? In a building? And of which type? Are some places recurrent contact locations? By answering such questions, GPS data can help develop more accurate and better-informed contact tracing applications. This chapter describes the ideas and approaches implemented for GPS data within the Smittestopp contact tracing application.We will present the pipeline used and the contribution of GPS data for contextual information, using inferred transport modes and surrounding POIs, showcasing the opportunities in the use of GPS information. Finally,we discuss ethical and privacy considerations, as well as some lessons learned.},
	isbn = {978-3-031-05465-5},
	issn = {2512-1677},
	doi = {10.1007/978-3-031-05466-2_4},
	url = {https://link.springer.com/content/pdf/10.1007/978-3-031-05466-2_4},
	author = {Thambawita, Vajira and Hicks, Steven and Jaouen, Ewan and Halvorsen, P{\r a}l and Riegler, Michael},
	editor = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@inbook {42537,
	title = {Smittestopp Backend},
	booktitle = { Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	month = {06/2022},
	pages = {29 - 62},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	abstract = {An efficient backend solution is of great importance for any large-scale system, and Smittestopp is no exception. The Smittestopp backend comprises various components for user and device registration, mobile app data ingestion, database and cloud operations, and web interface support. This chapter describes our journey from a vague idea to a deployed system. We provide an overview of the system internals and design iterations and discuss the challenges that we faced during the development process, along with the lessons learned. The Smittestopp backend handled around 1.5 million registered devices and provided various insights and analyses before being discontinued a few months after its launch.},
	isbn = {978-3-031-05465-5},
	issn = {2512-1677},
	doi = {10.1007/978-3-031-05466-2_3},
	url = {https://link.springer.com/content/pdf/10.1007/978-3-031-05466-2.pdf},
	author = {Midoglu, Cise and Ragan-Kelley, Benjamin and Reinemo, Sven-Arne and Jahren, Jon and Halvorsen, P{\r a}l},
	editor = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@inbook {43018,
	title = {Smittestopp for Android and iOS},
	booktitle = {Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	pages = {11 - 27},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	address = {Cham},
	isbn = {978-3-031-05465-5},
	issn = {2512-1677},
	doi = {10.1007/978-3-031-05466-210.1007/978-3-031-05466-2_2},
	url = {https://link.springer.com/content/pdf/10.1007/978-3-031-05466-2_2},
	author = {Per Magne {Florvaag} and Kjeldsberg, Henrik and Sebastian Kenji {Mitusch}},
	editor = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@book {43024,
	title = {Smittestopp - A Case Study on Digital Contact Tracing},
	journal = {Simula SpringerBriefs on Computing},
	volume = {11},
	year = {2022},
	month = {06/2022},
	pages = {141},
	publisher = {Springer Nature},
	address = {Cham},
	isbn = {978-3-031-05466-2},
	doi = {https://doi.org/10.1007/978-3-031-05466-2},
	url = {https://link.springer.com/book/10.1007/978-3-031-05466-2$\#$bibliographic-information},
	author = {Elmokashfi, Ahmed and Lysne, Olav and Naumova, Valeriya}
}
@misc {42733,
	title = {Teknologiutvikling, sikkerhet og kriminalitet},
	howpublished = {Politiavdelingen, Justisdepartementet, Oslo, Norway},
	year = {2022},
	author = {Lysne, Olav}
}
@misc {42731,
	title = {Tilrettelagt innhenting},
	howpublished = {Oslo Tingrett, Norway},
	year = {2022},
	author = {Lysne, Olav}
}
@misc {42738,
	title = {Tilrettelagt Innhenting fra utredning til kontroll},
	year = {2022},
	publisher = {{\r A}rskonferansen, EOS-utvalget },
	author = {Lysne, Olav}
}
@inbook {43171,
	title = {Using Bluetooth for contact tracing},
	booktitle = {Smittestopp - A Case Study on Digital Contact Tracing},
	volume = {11},
	year = {2022},
	pages = {81-98},
	publisher = {Springer International Publishing},
	organization = {Springer International Publishing},
	chapter = {5},
	address = {Cham},
	author = {Elmokashfi, Ahmed and Kvalbein, Amund},
	editor = {Lysne, Olav and Elmokashfi, Ahmed and Naumova, Valeriya}
}
@misc {42740,
	title = {Vi m{\r a} tenke sikkerhet p{\r a} nytt},
	howpublished = {Inside telecom},
	year = {2022},
	author = {Lysne, Olav}
}
@misc {42918,
	title = {What happened to the cyberwar},
	howpublished = {Hvor ble det av cyberkrigen?},
	year = {2022},
	month = {03/2022},
	publisher = {Aftenposten},
	type = {Popular science article},
	address = {https://www.aftenposten.no/meninger/debatt/i/nWKolo/hvor-ble-det-av-cyberkrigen},
	abstract = {Professor Olav Lysne, Director of SimulaMet and Haakon Bryhni, head of CRNA at SimulaMet recently published an op-ed in Aftenposten discussing cyber warfare in Ukraine.},
	keywords = {Applications, cyberwar, Internet, reliable, Security},
	url = {https://www.simulamet.no/content/what-happened-cyberwar},
	author = {Lysne, Olav and Bryhni, Haakon}
}
@misc {28087,
	title = {5G: Norge mellom stormaktene},
	howpublished = {Nasjonal sikkerhetsdag, Nasjonal Kommunikasjonsmyndighet, Norway},
	year = {2021},
	publisher = {Nasjonal Kommunikasjonsmyndighet},
	author = {Lysne, Olav and Friis, Karsten}
}
@misc {28088,
	title = {5G og sikkerhet},
	year = {2021},
	publisher = {NRK P2},
	address = {Nyhetsmorgen},
	author = {Lysne, Olav}
}
@misc {28036,
	title = {Digital Value Chains - Debate},
	year = {2021},
	publisher = {German Council on Foreign Relations},
	address = {Cyber Foresight Workshop},
	author = {Lysne, Olav}
}
@misc {28098,
	title = {Digitale verdi- og leveransekjeder},
	howpublished = {KraftCERT forum},
	year = {2021},
	publisher = {KraftCERT},
	author = {Lysne, Olav}
}
@misc {28032,
	title = {Et brutalt urovekkende cyberangrep. N{\r a} haster det!},
	year = {2021},
	month = {02/2021},
	publisher = {Aftenposten},
	author = {Lysne, Olav}
}
@misc {28034,
	title = {Ghost in the Machine:  Hvem lytter p{\r a} hemmelighetene v{\r a}re i datanettverkene},
	year = {2021},
	month = {08/2021},
	publisher = {Simula/Arendalsuka},
	author = {Lysne, Olav}
}
@article {28028,
	title = {Huawei, 5G and Security: Technological Limitations and Political Responses},
	journal = {Development and Change},
	volume = {52},
	year = {2021},
	publisher = {Wiley},
	author = {Friis, Karsten and Lysne, Olav}
}
@misc {28033,
	title = {Kunnskapshullene:  Digital pandemibekjempelse p{\r a} teknogigantenes n{\r a}de},
	year = {2021},
	month = {08/2021},
	publisher = {Simula/Arendalsuka},
	type = {Moderated debate},
	author = {Lysne, Olav}
}
@article {28029,
	title = {Nationwide rollout reveals efficacy of epidemic control through digital contact tracing},
	journal = {Nature Communications},
	volume = {12},
	number = {5918},
	year = {2021},
	publisher = {Springer Nature},
	doi = {https://doi.org/10.1038/s41467-021-26144-8},
	author = {Elmokashfi, Ahmed and Sundnes, Joakim and Kvalbein, Amund and Naumova, Valeriya and Reinemo, Sven-Arne and Per Magne {Florvaag} and H{\r a}kon Kvale {Stensland} and Lysne, Olav}
}
@misc {28086,
	title = {Skytjenester og Digitale Verdikjeder},
	howpublished = {Seminar Nasjonalt cybersikkerhetssenter},
	year = {2021},
	author = {Lysne, Olav}
}
@misc {27713,
	title = {Smittestopp, teknologigiganter og personverndebatt},
	howpublished = {Kriminalpolitiet, Oslo, Norway},
	year = {2021},
	author = {Lysne, Olav}
}
@misc {28030,
	title = {Systemutvikling og teknologiske veivalg i en krisesituasjon},
	howpublished = {SW2021 - Software 2021},
	year = {2021},
	publisher = {Dataforeningen},
	author = {Lysne, Olav}
}
@misc {28035,
	title = {The Threat Landscape of Critical Infrastructure and ICS Security Challenges},
	year = {2021},
	month = {09/2021},
	publisher = {Ignite Talks},
	type = {Moderated debate},
	address = {2050.  10000 Days to Transform},
	author = {Lysne, Olav and Bochman, Andrew and Aoyama, Tomomi}
}
@misc {28031,
	title = {Tingenes Internett - Hvordan utfordrer det oss?},
	howpublished = {Kommunal- og moderniseringsdepartementet, Norway},
	year = {2021},
	author = {Lysne, Olav}
}
@inproceedings {ANRW2020,
	title = {On the Accuracy of Country-Level IP Geolocation},
	journal = {Applied Networking Research Workshop (ANRW)},
	year = {2020},
	month = {07/2020},
	publisher = {ACM},
	address = {Madrid/Spain},
	abstract = {The proliferation of online services comprised of globally spread microservices has security and performance implications. Understanding the underlying physical paths connecting end points has become important. This paper investigates the accuracy of commonly used IP geolocation approaches in geolocating end-to-end IP paths. To this end, we perform a controlled measurement study to collect IP level paths. We find that existing databases tend to geolocate IPs that belong to networks with global presence and those move between networks erroneously. A small percentage of IP geolocation disagreement between databases results in a significant disagreement when geolocating end-to-end paths. Geolocating one week of RIPE traceroute data validates our observations.},
	keywords = {Geolocation Approaches, Geolocation Databases, IP Geolocation},
	isbn = {978-1-4503-8039-3},
	doi = {10.1145/3404868.3406664},
	author = {Livadariu, Ioana and Dreibholz, Thomas and Anas Saeed {Al-Selwi} and Bryhni, Haakon and Lysne, Olav and Bj{\o}rnstad, Steinar and Elmokashfi, Ahmed}
}
@misc {27188,
	title = {Cyber Nationalism: What Team Are You On?},
	howpublished = {Miami Beach, Florida},
	year = {2020},
	month = {01/2020},
	author = {Lysne, Olav and Geer, Dan and Peterson, Dale}
}
@misc {27504,
	title = {Cyberangrep som del av gr{\r a}soneangrep mot norske interesser},
	howpublished = {Fagdag, Langtidsplan for politi, PST og p{\r a}talemyndigheten, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27498,
	title = {Digitale Verdikjeder},
	howpublished = {Experis, Oslo, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27212,
	title = {Digitale verdikjeder - Huawei og Digitalt Grenseforsvar},
	howpublished = {Thales meeting, Gamle Logen, Oslo, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27225,
	title = {Digitalt Grenseforsvar og Digitale Verdikjeder},
	howpublished = {Etterretningsh{\o}gskolen, Oslo, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27505,
	title = {Etterretning, politikk og samfunn},
	howpublished = {Forsvarets H{\o}gskole, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27506,
	title = {Justissektoren, teknologi og myndighetsstrategi},
	howpublished = {Justisdepartementet, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27224,
	title = {Kan du ikke stole p{\r a} leverand{\o}ren, er du sjakk matt},
	year = {2020},
	publisher = {Intervju, Dagens N{\ae}ringsliv},
	author = {Lysne, Olav}
}
@misc {27211,
	title = {Krav til samhandling i en teknologisk tid},
	howpublished = {Samfunnssikkerhetskonferansen, Raddisson Plaza, Oslo, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27502,
	title = {S{\r a}rbarheter og endret trusselbilde i tiden fremover},
	howpublished = {Sikkerhetsm{\r a}neden, Oslo Kommune, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27499,
	title = {Smittestopp},
	howpublished = {Stortinget, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27500,
	title = {Smittestopp},
	howpublished = {Teknologir{\r a}det, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27233,
	title = {Snart kommer 5G-nettet},
	year = {2020},
	publisher = {Studio2, NRK P2},
	author = {Lysne, Olav}
}
@misc {27236,
	title = {Storebror og overv{\r a}kning - Podcast},
	year = {2020},
	publisher = {Teknisk Ukeblad},
	address = {Dobbeltklikk},
	author = {Lysne, Olav}
}
@misc {27501,
	title = {Teknologiutvikling, rikets sikkerhet og samfunnssikkerhet},
	howpublished = {Forsvarssjefens ledergruppe, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {27503,
	title = {Utvikling og teknologiske veivalg i en krisesituasjon},
	howpublished = {{\r A}pent seminar om smittesporing, Fornebu, Norway},
	year = {2020},
	author = {Lysne, Olav}
}
@misc {26900,
	title = {5G and Digital Security},
	year = {2019},
	publisher = {Body of European Regulators of Electronic Communications},
	address = {BEREC Stakeholder Forum, Brussels, Belgium},
	author = {Lysne, Olav}
}
@misc {26879,
	title = {5G and Huawei},
	year = {2019},
	publisher = {Aftenposten},
	address = {podcast "Forklart"},
	author = {Lysne, Olav}
}
@misc {26870,
	title = {5G and Huawei},
	year = {2019},
	publisher = {NRK TV},
	type = {Television interview},
	address = {"URIX"},
	author = {Lysne, Olav}
}
@misc {26885,
	title = {5G - Hva det er og hva det ikke er},
	howpublished = {Stortinget, Oslo, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26886,
	title = {5G - Hva det er og hva det ikke er},
	howpublished = {Teknologir{\r a}det, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@inproceedings {26915,
	title = {Critical communication infrastructures and Huawei},
	journal = {TPRC48: Research Conference on  Communications, Information and Internet Policy},
	year = {2019},
	month = {09/2019},
	publisher = {TPRC},
	abstract = {Recently, there have been growing cyber-safety concerns over telecom equipment made by the Chinese vendor Huawei. This has led many countries to ban Huawei from supplying equipment for building the next generation of mobile networks, 5G. Responses from mobile operators and the telecom community in general have been mixed. For instance, many European mobile operators have stated that these concerns are overblown and that such a ban would delay 5G rollout by two to three years in the best case. Moreover, some operators have directly questioned the ability of the other vendors to timely deliver a complete 5G network. However, these claims have mostly not been grounded in empirical data. This paper takes a multi-perspective approach to investigating this problem empirically. We start by categorizing responses from different countries to using Huawei equipment in 5G. We then analyze the importance and readiness of Huawei for supplying 5G equipment. This analysis is based on contributions to standards and patents. We also present a conceptual risk analysis framework to qualitatively evaluate the ability of a single vendor to cause considerable damage to critical communication infrastructures. This model aims at exploring a set of relevant axis. More specifically, we look at potential for harm in different political climates that is peace, crisis and war. Another axis is whether banning a particular vendor from supplying equipment for the upcoming mobile networks generation is useful without having a backward compatible ban. A third axis is the ability of a vendor to cause harm as a function of the type of supplied equipment, for example radio towers vs network management systems. Combining the analysis of readiness for supplying 5G and potential for causing harm allows us to roughly estimate the likely impact that a complete ban would have on 5G rollout in different parts of the world. We find that such a ban can possibly delay 5G by two years or more for operators with high dependence on Huawei. Consequently, we explore potential approaches that would both reduce vendor-related risk and do not significantly delay the rollout of 5G. These include heterogeneous multi-vendor deployments, equipment verification and testing, international collaboration as well as signing non-aggression treaties. Unfortunately, there is no technological solution that fully remedy this problem. Combining technical solutions with efforts to build trust between countries, enforce existing alignments or create new ones seems a promising way forward.},
	author = {Lysne, Olav and Elmokashfi, Ahmed and Niels Nagelhus {Schia} and Gjesvik, Lars and Friis, Karsten}
}
@misc {26898,
	title = {Cyber Risks...What Else is New?},
	howpublished = {Eierskapsavdelingen, Ministry of Trade and Fisheries, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26966,
	title = {Cyber security - what else is new?},
	howpublished = {Ministry of Local Government and Modernisation, Norefjell, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26869,
	title = {Debate on 5G and Huawei},
	year = {2019},
	month = {02/2018},
	publisher = {NRK TV},
	type = {Televised debate},
	address = {"Debatten"},
	author = {Lysne, Olav}
}
@misc {26892,
	title = {Digitale Verdikjeder - et rammeverk},
	howpublished = {Forum for nasjonal IKT-sikkerhet, Ministry of Justice and Public Security, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26880,
	title = {Digitalt grenseforsvar},
	howpublished = {Forsvarets Etterretningsh{\o}gskole, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26901,
	title = {Digitalt grenseforsvar og ny etterretningslov},
	howpublished = {Forsvarets H{\o}gskole, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26883,
	title = {Digitalt grenseforsvar og ny etterretningslov},
	howpublished = {Forsvarets H{\o}gskole, Akershus Festning, Norway},
	year = {2019},
	publisher = {Forsvarets H{\o}gskole},
	author = {Lysne, Olav}
}
@misc {26874,
	title = {Digitalt grenseforsvar {\textendash} sikkerhetsutfordringer og personvern},
	howpublished = {Forsvarets H{\o}gskole, Informasjonskurs, Hadeland, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26897,
	title = {Et rammeverk for digitale verdikjeder},
	howpublished = {ISF-Sikkerhetsfestivalen, Lillehammer, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {27034,
	title = {Et rammeverk for risikostyring i digitale verdikjeder},
	howpublished = {Sentralt Totalforsvarsforum, Nasjonal Sikkerhetsmyndighet, Oslo, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26969,
	title = {Fremtidens mobilnett:  mange egg i samme kurv},
	howpublished = {Frokostm{\o}tet om fremtidens N{\o}dnett, Litteraturhuset, Oslo, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26893,
	title = {Huawei and 5G},
	year = {2019},
	publisher = {Teknisk Ukeblad},
	type = {Debate with Paul Scanlan from Huawei},
	author = {Lysne, Olav}
}
@misc {26884,
	title = {Huawei and 5G Networks},
	howpublished = {ERVE Forum, Helsinki, Finland},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26894,
	title = {The Huawei and Snowden Questions},
	howpublished = {Cyber Security in the Energy Sector, NVE, Oslo, Norway},
	year = {2019},
	address = {NVE, Oslo},
	author = {Lysne, Olav}
}
@misc {26891,
	title = {The Huawei and Snowden Questions},
	howpublished = {Lab41, In-Q-Tel, Washington DC, USA},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26890,
	title = {The Huawei and Snowden Questions},
	howpublished = {Paranoia Conference, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26887,
	title = {The Huawei and Snowden Questions},
	howpublished = {Forsvarets Etterretningsh{\o}gskole, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26882,
	title = {Huawei: En risiko eller ikke?},
	year = {2019},
	publisher = {NUPI},
	type = {Paneldebatt},
	author = {Lysne, Olav}
}
@misc {26881,
	title = {Huawei og Overv{\r a}kning},
	howpublished = {DNB Markets, Hotel Continental, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26876,
	title = {The Norwegian model: the need for a Digital Border Defence},
	howpublished = {Oslo milit{\ae}re samfund, Cyber Security Seminar, Oslo, Norway},
	year = {2019},
	publisher = {Forsvarets h{\o}gskole, Institutt for forsvarsstudier},
	address = {Cyber Security Seminar},
	author = {Lysne, Olav}
}
@misc {26899,
	title = {Ny etterretningslov og digitalt grenseforsvar},
	howpublished = {S{\r a}rbarhetskonferansen, Norway},
	year = {2019},
	publisher = {Norsk totalforsvarsforum},
	author = {Lysne, Olav}
}
@misc {26878,
	title = {Ny etterretningslov, Paneldebatt},
	year = {2019},
	publisher = {Den Norske Atlanterhavskomit{\'e}},
	address = {Nobels Fredssenter},
	author = {Lysne, Olav}
}
@misc {26895,
	title = {Panel debate on 5G and the relation between Supplier and Security},
	year = {2019},
	publisher = {BB4ALL},
	address = {Stockholm},
	author = {Lysne, Olav}
}
@misc {26896,
	title = {Paneldebatt om ny etterretingslov},
	year = {2019},
	publisher = {Norsk Senter for Menneskerettigheter},
	address = {Arendal, Norway},
	author = {Lysne, Olav}
}
@techreport {26905,
	title = {Risikostyring i digitale verdikjeder},
	year = {2019},
	publisher = { Direktoratet for samfunnssikkerhet og beredskap},
	author = {Lysne, Olav and Tor Saglie,  and Harald Fardal,  and Line Ugland Nyseth,  and Berit Salvesen,  and Ernst Unsgaard, }
}
@misc {26888,
	title = {Teknologiutvikling og samfunnssikkerhet},
	howpublished = {INFO/ERFA, Forsvars- og sikkerhetsindustriens forening, Norway},
	year = {2019},
	publisher = {Forsvars- og sikkerhetsindustriens forening},
	author = {Lysne, Olav}
}
@misc {26889,
	title = {Teknologiutvikling og Totalforsvaret},
	howpublished = {Nasjonal Beredskapskonferanse, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26875,
	title = {Tilrettelagt innhenting av grensekryssende datatrafikk},
	howpublished = {EOS-utvalget, Norway},
	year = {2019},
	author = {Lysne, Olav}
}
@misc {26949,
	title = {Tilrettelagt innhenting og kontrollmekanismer},
	howpublished = {Nordisk m{\o}te for kontrollorganer for etterretnings- og sikkerheitstenester},
	year = {2019},
	publisher = {EOS-utvalget},
	author = {Lysne, Olav}
}
@misc {26868,
	title = {Datasikkerhet og Kompetanseutvikling},
	howpublished = {UNIO, Representantskapsm{\o}te, Sundvollen},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26865,
	title = {Datasikkerhet og Kompetanseutvikling},
	howpublished = {Universitets- og h{\o}gskoler{\r a}det, Kongsberg, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26030,
	title = {Digital Vulnerability and International Interdependency},
	howpublished = {17th European Conference on Cyber Warfare and Security, Oslo, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26862,
	title = {Digital vulnerability in Norway},
	howpublished = {Oslo},
	year = {2018},
	publisher = {Project Management Institute},
	author = {Lysne, Olav}
}
@misc {26863,
	title = {Digitalisering, s{\r a}rbarhet og veien videre},
	howpublished = {Ministry of Justice and Public Security},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {25901,
	title = {Digitalt Grenseforsvar},
	year = {2018},
	month = {02/2018},
	publisher = {NRK TV},
	address = {Debatten},
	author = {Lysne, Olav}
}
@misc {25895,
	title = {Digitalt Grenseforsvar},
	howpublished = {Student-UGA i Agder, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26873,
	title = {Han vil la storebror se deg},
	year = {2018},
	month = {03/2018},
	publisher = {Klassekampen},
	type = {Newspaper interview},
	author = {Lysne, Olav}
}
@misc {26867,
	title = {The Huawei and Snowden Questions},
	howpublished = {In-Q-Tel, Washington, US},
	year = {2018},
	author = {Lysne, Olav}
}
@book {25880,
	title = {The Huawei and Snowden Questions},
	series = {Simula SpringerBriefs on Computing},
	number = {4},
	year = {2018},
	publisher = { Springer},
	organization = { Springer},
	address = {Switzerland},
	abstract = {This book answers two central questions: firstly, is it at all possible to verify electronic equipment procured from untrusted vendors?\&nbsp;Secondly, can I build trust into my products in such a way that I support verification by untrusting customers?\&nbsp; In separate chapters the book takes readers\&nbsp;through the state of the art in fields of computer science that can shed light on these questions.\&nbsp;In a concluding chapter it discusses realistic ways forward.\&nbsp;\&nbsp;In discussions on cyber security, there is a tacit assumption that the manufacturer of equipment will collaborate with the user of the equipment to stop third-party wrongdoers.\&nbsp;The Snowden files and recent deliberations on the use of Chinese equipment in the critical infrastructures of western countries have changed this.\&nbsp;The discourse in both cases revolves around what malevolent manufacturers can do to harm their own customers, and the importance of the matter is on par with questions of national security.This book is of great interest to\&nbsp;ICT and security professionals who need a clear understanding of the two questions posed in the subtitle, and to decision-makers in industry, national bodies and nation states.\&nbsp;},
	author = {Lysne, Olav}
}
@misc {25898,
	title = {Hvordan kontrollere digitale hemmelige tjenester},
	howpublished = {EOS-utvalgets {\r a}rskonferanse, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26866,
	title = {Kinesisk Spyware},
	year = {2018},
	month = {11/2018},
	publisher = {NRK},
	type = {Radio Program EKKO},
	address = {"EKKO"},
	author = {Lysne, Olav}
}
@misc {25900,
	title = {Lawful interception of Internet Traffic, and national autonomy in cyberspace},
	howpublished = {Norges Forsvarsforening - {\r a}pent seminar, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {25897,
	title = {Lawful interception of Internet Traffic, and National Autonomy in Cyberspace},
	howpublished = {Sikkerhetskonferansen, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {25894,
	title = {Lawful interception of Internet Traffic, and national autonomy in cyberspace},
	howpublished = {Luftmaktseminaret, Trondheim, Norway},
	year = {2018},
	author = {Lysne, Olav}
}
@misc {26871,
	title = {Lysne II, digitalt grenseforsvar og kryptering},
	year = {2018},
	month = {12/2018},
	publisher = {Teknisk Ukeblad},
	type = {Newspaper article},
	address = {Digi.no},
	author = {Lysne, Olav}
}
@misc {25896,
	title = {Nasjonal strategi for IKT-sikkerhet},
	year = {2018},
	publisher = {Justisdepartementet},
	type = {Paneldebatt},
	author = {Lysne, Olav}
}
@misc {26864,
	title = {Panel discussion on Artificial Intelligence},
	year = {2018},
	publisher = {Aftenposten},
	address = {A-Tech, Collosseum Kino},
	author = {Lysne, Olav}
}
@misc {26872,
	title = {Snowden, Huawei og Super Micro},
	year = {2018},
	month = {10/2018},
	publisher = {Dagens N{\ae}ringsliv},
	type = {Newspaper Article},
	author = {Lysne, Olav}
}
@misc {25364,
	title = {Digital grensekontroll},
	year = {2017},
	publisher = {Dagens N{\ae}ringsliv},
	url = {https://www.dn.no/meninger/2017/01/08/1953/Innlegg/digital-grensekontroll},
	author = {Lysne, Olav and Jarbekk, Eva and Lunde, Einar}
}
@misc {25366,
	title = {Digital s{\r a}rbarhet bekjempes med kompetanse},
	year = {2017},
	publisher = {Dagens N{\ae}ringsliv},
	url = {https://www.dn.no/meninger/2016/12/27/2046/Innlegg/ledere-ma-laere-om-datasikring},
	author = {Lysne, Olav}
}
@misc {25887,
	title = {Digital s{\r a}rbarhet - Internasjonale, Nasjonale og Regionale utfordringer},
	howpublished = {Berkeley, Norgesseminaret},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25884,
	title = {Digital s{\r a}rbarhet - Internasjonale, Nasjonale og Regionale utfordringer},
	howpublished = {Alta },
	year = {2017},
	type = {Fylkesmannen i Finnmark},
	author = {Lysne, Olav}
}
@misc {25353,
	title = {Digital s{\r a}rbarhet og digitalt grenseforsvar},
	howpublished = {Sivilombudsmannen, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25179,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Forsvarets h{\o}gskole, informasjonskurset, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25200,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {H{\o}yesterett, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25276,
	title = {Digital sikkerhet og digitalt grenseforsvar},
	howpublished = {Humanistisk Ungdoms seminar om overv{\r a}kning, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25889,
	title = {Digital vulnerability in Norway},
	howpublished = {MERIDIAN, Conference},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25199,
	title = {Digital vulnerability in Norway},
	howpublished = {Telenor Group Public and Regulatory Affairs, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25194,
	title = {Digital vulnerability in Norway},
	howpublished = {Samferdselsdepartementet, Nordic Baltic Meeting, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25277,
	title = {Digitale s{\r a}rbarhet og digitalt grenseforsvar},
	howpublished = {Politih{\o}gskolen, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25193,
	title = {Digitale s{\r a}rbarheter i petroleumssektoren},
	howpublished = {Norsk Utenrikspolitisk Institutt - NUPI, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25210,
	title = {Digitale s{\r a}rbarheter, og digitalt grenseforsvar},
	howpublished = {Forsvarets H{\o}gskole, Sjefskurset, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25883,
	title = {Digitalisering, s{\r a}rbarhet og veien videre},
	howpublished = {Samferdselsdepartementet},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25892,
	title = {Digitalt Grenseforsvar},
	howpublished = {Tekna-seminar, Ekom-infrastruktur, sikkerhet og s{\r a}rbarhet},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25195,
	title = {Digitalt Grenseforsvar},
	howpublished = {Oslo Milit{\ae}re Samfund, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25893,
	title = {Digitalt Grenseforsvar},
	howpublished = {ISACA, Norway Chapter},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25196,
	title = {Digitalt Grenseforsvar},
	howpublished = {Stortinget, SVs stortingsgruppe, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25890,
	title = {Digitalt Grenseforsvar},
	howpublished = {Difis h{\o}stkonferanse},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25189,
	title = {Digitalt grenseforsvar},
	howpublished = {Stortinget, H{\o}yres stortingsgruppe, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25197,
	title = {Digitalt Grenseforsvar},
	howpublished = {Utenriksdepartementet, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25891,
	title = {Digitalt Grenseforsvar},
	howpublished = {Sikkerhetssymposiet, DND, Bergen},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25190,
	title = {Digitalt grenseforsvar},
	howpublished = {Stortinget, Fremskrittspartiets stortingsgruppe, Oslo, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25191,
	title = {Digitalt grenseforsvar, DND sitt frokostm{\o}te},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25218,
	title = {Digitalt grenseforsvar, panel discussion at Norsk Journalistlag},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25370,
	title = {Digitalt grenseforsvar: Sikkerhet, grensekabler, menneskerettigheter og personvern},
	howpublished = {Sikkerhet \& S{\r a}rbarhet 2017, Trondheim, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25888,
	title = {Digitalt grenseforsvar {\textendash} sikkerhetsutfordringer og personvern},
	howpublished = {Forsvarets h{\o}gskole},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25902,
	title = {Dramatiske fremstillinger av digitalisering b{\o}r avl{\o}ses av kj{\o}lig, strategisk besluttsomhet},
	year = {2017},
	month = {07/2017},
	publisher = {Aftenposten},
	author = {Lysne, Olav}
}
@misc {25362,
	title = {Fremmede makter angriper oss daglig},
	year = {2017},
	publisher = {digi.no},
	url = {https://www.digi.no/emne/podcast},
	author = {Lysne, Olav}
}
@misc {25363,
	title = {Grenseforsvar ivaretatt},
	year = {2017},
	publisher = {Dagens N{\ae}ringsliv},
	type = {Newspaper article},
	url = {http://www.dn.no/meninger/2017/01/02/2049/Innlegg/grenseforsvar-ivaretatt},
	author = {Lysne, Olav}
}
@misc {25369,
	title = {Hva skal vi v{\ae}re redde for?},
	howpublished = {Paranoia-konferansen, Oslo Spektrum, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25885,
	title = {Hvor g{\r a}r grensen?},
	year = {2017},
	publisher = {Norges Forsvarsforening},
	type = {Paneldebatt},
	author = {Lysne, Olav}
}
@misc {25650,
	title = {Interview on NRK Nyhetsettermiddag},
	year = {2017},
	publisher = {NRK},
	author = {Lysne, Olav}
}
@misc {25367,
	title = {Ja, det er urealistisk},
	year = {2017},
	publisher = {Aftenposten},
	type = {Newspaper article},
	url = {http://www.aftenposten.no/meninger/Kort-sagt_-19-januar-613395b.html},
	author = {Lysne, Olav}
}
@misc {25886,
	title = {Klarer akademia {\r a} f{\o}lge opp?},
	year = {2017},
	publisher = {Finans Norge},
	type = {Paneldebatt},
	author = {Lysne, Olav}
}
@misc {25198,
	title = {KommuneCERT...?},
	howpublished = {NorSIS workshop om hendelsesh{\r a}ndtering i kommunesektoren, Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25354,
	title = {Lawful interception in Norway},
	howpublished = {Huawei Norway},
	year = {2017},
	author = {Lysne, Olav}
}
@misc {25365,
	title = {Norsk tetposisjon i digitalisering gir godt utgangspunkt},
	year = {2017},
	publisher = {Dagens N{\ae}ringsliv},
	url = {https://www.dn.no/meninger/2017/03/02/2039/Innlegg/vart-digitale-fortrinn},
	author = {Irgens, Morten and Lysne, Olav}
}
@misc {25882,
	title = {Usikkerhet om sikkerhet},
	year = {2017},
	publisher = {Tekna},
	address = {Paneldebatt},
	author = {Lysne, Olav}
}
@misc {24164,
	title = {Det digitale s{\r a}rbarhetsutvalget},
	howpublished = {Justisdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25171,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Kristiansand},
	year = {2016},
	type = {KinS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {25152,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Seminaf for Kommunal informasjonssikkerhet i Bergen},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25149,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Kunnskapsdepartementets konferanse om samfunnssikkerhet og beredskap},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25175,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Trondheim},
	year = {2016},
	type = {KiNS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {25156,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Tek-konferansen},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25172,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Sandane},
	year = {2016},
	type = {KiNS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {25153,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Partnerforum, UiO},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25150,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Forsvarets H{\o}gskole},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25147,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Statens helsetilsyn},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25157,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Kommunal- og moderniseringsdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25173,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Narvik},
	year = {2016},
	type = {KiNS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {24160,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Program for toppledergrupper i staten},
	year = {2016},
	publisher = {DIFI},
	author = {Lysne, Olav}
}
@misc {25154,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Institutt for rettsinformatikk},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25170,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Hamar},
	year = {2016},
	type = {KiNS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {25151,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Forsvarsdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25148,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Risikokonferansen, BDO},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25161,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Utenriksdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25174,
	title = {Digital s{\r a}rbarhet og risiko i det norske samfunnet},
	howpublished = {Narvik},
	year = {2016},
	type = {KiNS - Kommunal informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {24163,
	title = {Digital s{\r a}rbarhet - sikkert samfunn},
	howpublished = {Kommunal- og moderniseringsdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {24159,
	title = {Digital s{\r a}rbarhet - sikkert samfunn},
	howpublished = {Norges Forskningsr{\r a}d, },
	year = {2016},
	author = {Lysne, Olav}
}
@misc {24297,
	title = {Digital s{\r a}rbarhet - sikkert samfunn},
	howpublished = {Samfunnssikkerhetskonferansen, Oslo},
	year = {2016},
	month = {02/2016},
	publisher = {Direktoratet for Samfunnsikkerhet og Beredskap},
	author = {Lysne, Olav}
}
@misc {24298,
	title = {Digital s{\r a}rbrhet og kunnskap},
	howpublished = {Regjeringskvartalet},
	year = {2016},
	address = {Departementenes Nettverk for informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {25155,
	title = {Digital vulnerability in Norway},
	howpublished = {Huawei, Norway},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25165,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Forsvarets operative hovedkvarter},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25159,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Finanstilsynet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25169,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Borgarting lagmannsrett},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25166,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Forsvarsbygg},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25160,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Finansdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25167,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Fylkesmennenes informasjonssikkerhetsseminar, Trondheim},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {24161,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Finansdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {24162,
	title = {Digitale s{\r a}rbarheter som Norge st{\r a}r overfor i dag og i n{\ae}rmeste fremtid},
	howpublished = {Riksrevisjonen},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25177,
	title = {Digitalisering, internasjonalisering og risiko},
	howpublished = {Stortinget, Arbeiderpartiets stortingsgruppe},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25168,
	title = {Digitalt grenseforsvar},
	howpublished = {S{\r a}rbarhetskonferansen},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25162,
	title = {Digitalt Grenseforsvar},
	howpublished = {Forsvardepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25163,
	title = {Digitalt Grenseforsvar},
	howpublished = {Statsministerens kontor},
	year = {2016},
	author = {Lysne, Olav}
}
@misc {25164,
	title = {Digitalt Grenseforsvar},
	howpublished = {Oslo milit{\ae}re samfund},
	year = {2016},
	type = {Pressekonferanse},
	author = {Lysne, Olav}
}
@misc {25178,
	title = {Digitalt grenseforsvar},
	howpublished = {Forsvarsdepartementet},
	year = {2016},
	author = {Lysne, Olav}
}
@book {25881,
	title = {Digitalt grenseforsvar (DGF)},
	year = {2016},
	publisher = {regjeringen.no},
	organization = {regjeringen.no},
	address = {regjeringen.no},
	url = {https://www.regjeringen.no/globalassets/departementene/fd/dokumenter/rapporter-og-regelverk/lysne-ii-utvalgets-rapport-2016.pdf},
	author = {Lysne, Olav and Grytting, Trond and Jarbekk, Eva and Lunde, Einar and Reusch, Christian}
}
@article {24157,
	title = {Protecting the digitized society {\textendash} the challenge of balancing surveillance and privacy},
	journal = {Cyber Defense Review},
	year = {2016},
	publisher = { Army Cyber Institute and U.S. Marine Corps Forces Cyberspace Command (MARFORCYBER)},
	author = {Hagen, Janne and Lysne, Olav}
}
@misc {25158,
	title = {Trust, but verify!  How do you verify electronic equipment?},
	howpublished = {Cyber Science 2016, London},
	year = {2016},
	author = {Lysne, Olav}
}
@article {25098,
	title = {Vendor malware: detection limits and mitigation},
	journal = {IEEE Computer},
	volume = {49},
	year = {2016},
	month = {08/2016},
	pages = {62-69},
	publisher = {IEEE},
	abstract = {Computing device vendors can introduce malware that is nearly impossible to detect with known methods, but microservice solutions can limit the negative impact. Malware contains instructions whose execution negatively impacts stakeholders, typically leading to unauthorized access and computation, data theft, loss of privacy, inability to inspect data, or prolonged downtime. A computing system\&$\#$39;s robustness to malware attacks strongly depends on the ability of the technical system and its stakeholders to either detect inactive malware before it executes or to detect active executing malware as soon as possible, before it causes serious damage. Many previous works discuss the general difficulty of detecting malware, but we focus on the ability of buyers and other legitimate stakeholders to detect malware inserted in computing devices by vendors and other insiders with access to the devices before they reach the buyers.},
	keywords = {Computer architecture, Computer crime, Computer security, Malware, Software Engineering, Supply chain management},
	issn = {0018-9162},
	doi = {10.1109/MC.2016.227},
	author = {Lysne, Olav and Kjell J{\o}rgen {Hole} and Otterstad, Christian and Ytrehus, {\O}yvind and Aarseth, Raymond and Tellnes, J{\o}rgen}
}
@misc {24173,
	title = {Digital s{\r a}barhet - sikkert samfunn},
	howpublished = {Press conference},
	year = {2015},
	month = {11/15},
	type = {Presentation and handover to the Minister of Justice of a National Report on Digital Vulnerability},
	author = {Lysne, Olav}
}
@misc {24187,
	title = {Digital s{\r a}barhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {Software 2015},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24179,
	title = {Digital s{\r a}rbarhet},
	howpublished = {Presentasjon for Sikkerhetslovutvalget},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24171,
	title = {Digital s{\r a}rbarhet - internasjonale utfordringer},
	howpublished = {Norsk Utenrikspolitisk Institutt (NUPI)},
	year = {2015},
	author = {Lysne, Olav}
}
@book {24193,
	title = {Digital s{\r a}rbarhet {\textendash} sikkert samfunn},
	volume = {13},
	number = {NOU},
	year = {2015},
	month = {11/15},
	publisher = {Norwegian Ministry of Justice and Public Security},
	organization = {Norwegian Ministry of Justice and Public Security},
	address = {Oslo},
	author = {Lysne, Olav and Beitland, Kristine and Gj{\o}steen, Kristian and Hagen, Janne and Holmgren, {\r A}ke and Jarbekk, Eva and Lunde, Einar and Manne, Fredrik and Nystr{\o}m, Sofie}
}
@misc {24189,
	title = {Digital s{\r a}rbarhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {Teknologir{\r a}det},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24185,
	title = {Digital s{\r a}rbarhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {HACKON},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24183,
	title = {Digital s{\r a}rbarhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {{\r A}pen dag},
	year = {2015},
	publisher = {{\r A}pen dag},
	address = {Universitetet i Oslo},
	author = {Lysne, Olav}
}
@misc {24166,
	title = {Digitale s{\r a}rbarheter i finanssektoren},
	howpublished = {Finanstilsynet},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24167,
	title = {Digitale s{\r a}rbarheter i kommunenorge},
	howpublished = {IT-sjefen i kommunal sektor},
	year = {2015},
	publisher = {Confex Norge},
	author = {Lysne, Olav}
}
@misc {24175,
	title = {Digitale s{\r a}rbarheter i Norge},
	howpublished = {Direktoratet for forvaltning og IKT (DIFI)},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24168,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Abelia},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {Olav1,
	title = {Digitale s{\r a}rbarheter - internasjonale utfordringer},
	howpublished = {Datatilsynet},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24174,
	title = {Digitalt s{\r a}rbarhetsutvalg},
	howpublished = {Sentralt Totalforsvarsforum},
	year = {2015},
	author = {Lysne, Olav}
}
@article {23383,
	title = {Early experiences with live migration of SR-IOV enabled InfiniBand},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {78},
	year = {2015},
	month = {04/2015},
	pages = {39-52},
	publisher = {Elsevier},
	abstract = {Virtualization is the key to efficient resource utilization and elastic resource allocation in cloud computing. It enables consolidation, the on-demand provisioning of resources, and elasticity through live migration. Live migration makes it possible to optimize resource usage by moving virtual machines (VMs) between physical servers in an application transparent manner. It does, however, require a flexible, high-performance, scalable virtualized I/O architecture to reach its full potential. This is challenging to achieve with high-speed networks such as InfiniBand and remote direct memory access enhanced Ethernet, because these devices usually maintain their connection state in the network device hardware. Fortunately, the single root IO virtualization (SR-IOV) specification addresses the performance and scalability issues. With SR-IOV, each VM has direct access to a hardware assisted virtual device without the overhead introduced by emulation or para-virtualization. However, SR-IOV does not address the migration of the network device state. In this paper we present and evaluate the first available prototype implementation of live migration over SR-IOV enabled InfiniBand devices.},
	keywords = {Architecture, IO virtualization, SR-IOV, VM migration},
	doi = {http://dx.doi.org/10.1016/j.jpdc.2015.01.004},
	author = {Wei Lin {Guay} and Reinemo, Sven-Arne and Bj{\o}rn Dag {Johnsen} and Yen, Chien-Hua and Skeie, Tor and Lysne, Olav and T{\o}rudbakken, Ola}
}
@article {Simula.simula.2620,
	title = {Efficient and Cost-Effective Hybrid Congestion Control for HPC Interconnection Networks},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {26},
	number = {pp},
	year = {2015},
	pages = {107-119},
	publisher = {IEEE},
	abstract = {Interconnection networks are key components in High-Performance Computing (HPC) systems, their performance having a strong influence on the overall system one. However, at high load, congestion and its negative effects (e.g. Head-of-line blocking) threaten the performance of the network, and so the one of the entire system. Congestion control (CC) is crucial to ensure an efficient utilization of the interconnection network during congestion situations. As one major trend is to reduce the effective wiring in interconnection networks to reduce cost and power consumption, the network will operate very close to its capacity. Thus, congestion control becomes essential. Existing CC techniques can be divided into two general approaches. One is to throttle traffic injection at the sources that contribute to congestion, and the other is to isolate the congested traffic in specially designated resources. However, both approaches have different, but non-overlapping weaknesses: injection throttling techniques have a slow reaction against congestion, while isolating traffic in special resources may lead the system to run out of those resources. In this paper we propose EcoCC, a new Efficient and Cost-Effective CC technique, that combines injection throttling and congested-flow isolation to minimize their respective drawbacks and maximize overall system performance. This new strategy is suitable for current commercial switch architectures, where it could be implemented without requiring significant complexity. Experimental results, using simulations under synthetic and real tracebased traffic patterns, show that this technique improves by up to 55\% over some of the most successful congestion control techniques.},
	doi = {10.1109/TPDS.2014.2307851},
	author = {Escudero-Sahuquillo, Jes{\'u}s and Ernst Gunnar {Gran} and Pedro J. {Garcia} and Flich, Jos{\'e} and Skeie, Tor and Lysne, Olav and Francisco Jos{\'e} {Quiles} and Duato, Jose}
}
@misc {24170,
	title = {Konklusjoner fra det Digitale S{\r a}rbarhetsutvalget},
	howpublished = {IKT-Norge},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24169,
	title = {Konklusjoner fra det digitale s{\r a}rbarhetsutvalget},
	howpublished = {Polyteknisk forening},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24177,
	title = {Norges digitale s{\r a}rbarheter},
	howpublished = {Forsvarets H{\o}gskole},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24176,
	title = {Norges digitale s{\r a}rbarheter},
	howpublished = {Partnerforum, University of Oslo},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24172,
	title = {Norges digitale s{\r a}rbarheter},
	howpublished = {Prime Ministers Office},
	year = {2015},
	type = {Presentation for selected ministers and leaders from the opposition},
	author = {Lysne, Olav}
}
@misc {24178,
	title = {Norges digitale s{\r a}rbarhetsutvalg},
	howpublished = {Presentation for det Svenska Informationss{\"a}kerhetsr{\r a}d},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24181,
	title = {Telekom og s{\r a}rbarhet},
	howpublished = {TEK-konferansen},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {25368,
	title = {V{\r a}r avhengighet av Telenor},
	year = {2015},
	publisher = {Verdens Gang},
	type = {Newspaper article},
	author = {Lysne, Olav}
}
@misc {24182,
	title = {V{\r a}r digitale s{\r a}rbarhet},
	howpublished = {Norges Vassdrag- og Energivesen (NVE)},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24180,
	title = {V{\r a}r digitale s{\r a}rbarhet},
	howpublished = {Departementenes Nettverk for Informasjonssikkerhet},
	year = {2015},
	type = {Presentasjon for Departementenes Nettverk for Informasjonssikkerhet},
	author = {Lysne, Olav}
}
@misc {24184,
	title = {V{\r a}r digitale s{\r a}rbarhet},
	howpublished = {Justisdepartementet},
	year = {2015},
	author = {Lysne, Olav}
}
@misc {24186,
	title = {V{\r a}r digitale s{\r a}rbarhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {Sikkerhetskonferansen, Litteraturhuset},
	year = {2015},
	publisher = {Nasjonal Sikkerhetsmyndighet (NSM)},
	author = {Lysne, Olav}
}
@misc {24186,
	title = {V{\r a}r digitale s{\r a}rbarhet - teknologi og {\r a}pne sp{\o}rsm{\r a}l},
	howpublished = {Sikkerhetskonferansen, Litteraturhuset},
	year = {2015},
	publisher = {Nasjonal Sikkerhetsmyndighet (NSM)},
	author = {Lysne, Olav}
}
@misc {24192,
	title = {Hva kan gj{\o}res n{\r a}r man ikke stoler p{\r a} de som lager utstyret til Ekom-nettet v{\r a}rt?},
	howpublished = {Justisdepartementet},
	year = {2014},
	publisher = {Kriser{\r a}det},
	author = {Lysne, Olav and Kjell J{\o}rgen {Hole}}
}
@article {Simula.simula.2218,
	title = {A New Proposal to Deal With Congestion in InfiniBand-Based Fat-Trees},
	journal = {Journal of Parallel and Distributed Computing},
	volume = {74},
	number = {1},
	year = {2014},
	month = {January},
	pages = {1802-1819},
	publisher = {Elsevier},
	abstract = {The overall performance of High-Performance Computing applications may depend largely on the performance achieved by the network interconnecting the end-nodes, thus high-speed interconnect technologies like InfiniBand are used to provide high throughput and low latency. Nevertheless, network performance may be degraded due to congestion, thus using techniques to deal with the problems derived from congestion has become practically mandatory. In this paper we propose a straightforward congestion-management method suitable for fat-tree topologies built from InfiniBand components. Our proposal is based on a traffic-flow-to-service-level mapping that prevents, as much as possible with the resources available in current InfiniBand components (basically Virtual Lanes), the negative impact of the two most common problems derived from congestion: head-of-line blocking and buffer-hogging. We also provide a mathematical approach to analyze the efficiency of our proposal and several ones, by means of a set of analytical metrics. In certain traffic scenarios, we observe up to a 68\% of the ideal performance gain that could be achieved in HoL-blocking and buffer-hogging prevention.},
	keywords = {Congestion management, Fat-trees, High-performance computing, InfiniBand, Interconnection networks},
	doi = {http://dx.doi.org/10.1016/j.jpdc.2013.09},
	author = {Escudero-Sahuquillo, Jes{\'u}s and Pedro Javier {Garc{\'\i}a} and Francisco Jos{\'e} {Quiles} and Reinemo, Sven-Arne and Skeie, Tor and Lysne, Olav and Duato, Jose}
}
@techreport {24026,
	title = {Robusthet i norske mobilnett Tilstandsrapport 2013},
	year = {2014},
	month = {02/2014},
	publisher = {Simula},
	address = {Oslo},
	author = {Kvalbein, Amund and Stein Erlend {Arge} and Baltrunas, D{\v z}iugas and Elmokashfi, Ahmed and Lysne, Olav}
}
@inproceedings {ICCProceedings2013,
	title = {Increased Robustness With Interface Based Permutation Routing},
	journal = {IEEE ICC 2013},
	year = {2013},
	type = {Conference},
	abstract = {A prime objective of fault tolerant routing methods is the availability of multiple routing options at each hop. The methods that are currently implemented in IP networks, such as Equal-Cost Multi-Path (ECMP) and Loop Free Alternates (LFA), share the following four properties: First, they work with a hop-by-hop forwarding strategy optimized for the fault free case. Second, they do not require information associated with network faults included in the packet header. Third, they do not form forwarding loops, even under multiple failures in the network. Finally, they are compatible with standard link state routing protocols. However, ECMP and LFA give very poor fault coverage; in most cases fewer than 50\% of primary next-hops are protected when using typical link weight settings. This paper presents a new routing method that combines the concept of permutation routing with interface-specific forwarding. Our method results in a routing strategy that strictly adheres to the four stated design properties. Through experiments we show that we protect more than 97\% of the primary next-hops for all tested ISP networks.},
	keywords = {Conference},
	author = {Hung Quoc {Vo} and Lysne, Olav and Kvalbein, Amund}
}
@misc {Simula.simula.2496,
	title = {Prototyping Live Migration With SR-IOV Supported InfiniBand HCAs},
	howpublished = {HPC Advisory Council Spain Conference},
	year = {2013},
	month = {September},
	abstract = {Live migration is challenging to achieve with high-speed networks because these devices usually maintain their connection state in the network device hardware. In this work we i) describe the challenges with live migration over SR-IOV enabled InfiniBand devices, ii) present and evaluate the first available prototype implementation of live migration over SR-IOV enabled InfiniBand devices.},
	keywords = {Conference},
	author = {Tasoulas, Evangelos and Wei Lin {Guay} and Reinemo, Sven-Arne and Bj{\o}rn Dag {Johnsen} and Yen, Chien-Hua and Skeie, Tor and Lysne, Olav and Torudbakken, Ola}
}
@inproceedings {ifipNetworking2013-05-22.0889864366,
	title = {Routing With Joker Links for Maximized Robustness},
	journal = {Proceedings of IFIP Networking 2013 Conference},
	year = {2013},
	pages = {1-9},
	publisher = {IEEE},
	type = {Conference},
	abstract = {IP Fast Reroute methods that are currently deployed in link-state routing protocols with hop-by-hop forwarding, such as Equal-Cost Multi-Path (ECMP) and Loop Free Alternates (LFA), share two common important properties. First, they never form forwarding loops, even when there are multiple independent failures in the network. Second, they do not introduce non- standard packet marking to convey information associated with network faults. However, these Fast Reroute methods give very poor fault coverage; in most cases below 50\% of links are protected when using typical link weight settings. This paper presents a new routing method that combines the concept of permutation routings with joker links, called joker-capable permutation routings. Our method results in a routing strategy that shares with ECMP and LFA the stated important properties. Through experiments we show that we protect more than 95\% of links for all tested ISP networks. Measurements also show that our method is computationally feasible and performs traffic distribution efficiently under high fluctuations of traffic demands.},
	keywords = {Conference},
	author = {Hung Quoc {Vo} and Lysne, Olav and Kvalbein, Amund}
}
@misc {Simula.simula.2228,
	title = {Tjenesteavbrudd Over Mobilt Bredb{\r a}nd I Norge},
	howpublished = {Det Norske Videnskaps-Akademi {\r A}rbok 2012},
	year = {2013},
	abstract = {Digitale kommunikasjonsnettverk inntar en stadig mer sentral rolle i moderne samfunn. Faktorer som kompleksitet i teknologi og eierskapsforhold, nettets totale st{\o}rrelse og hemmelighold gj{\o}r imidlertid at en nasjons kommunikasjonsinfrastruktur bare i begrenset grad kan studeres som en syntese av sine bestanddeler. Den b{\o}r i stedet studeres gjennom m{\r a}linger av dens egenskaper. I denne artikkelen gir vi et eksempel p{\r a} et forskningsoppsett hvis m{\r a}l det er {\r a} gi innsikt i stabilitetsbildet for mobilt bredb{\r a}nd (MBB) i Norge. M{\r a}lingene er utf{\o}rt over tre forskjellige nettverk for mobilt bredb{\r a}nd. Vi har foretatt aktive m{\r a}linger over en 4-m{\r a}neders periode fra 90 stemmelokaler som ble benyttet til elektronisk pr{\o}vevalg i ved lokalvalgene i Norge h{\o}sten 2011. M{\r a}lestasjonene v{\r a}re er spredt ut over hele Norge, og gir derfor en oversikt over stabiliteten til landets infrastruktur p{\r a} en m{\r a}te som tidligere ikke har v{\ae}rt tilgjengelig.},
	isbn = {978-82-7099-730-5},
	author = {Lysne, Olav}
}
@misc {Simula.simula.1444,
	title = {Et Kritisk Blikk P{\r a} N{\o}dnettet},
	howpublished = {Telecom World},
	year = {2012},
	author = {Lysne, Olav}
}
@inproceedings {Simula.simula.866,
	title = {Exploring the Scope of the InfiniBand Congestion Control Mechanism},
	journal = {2012 IEEE International Symposium on Parallel \& Distributed Processing (IPDPS)},
	year = {2012},
	pages = {1131-1143},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {In a lossless interconnection network, network congestion needs to be detected and resolved to ensure high performance and good utilization of network resources at high network load. If no countermeasure is taken, congestion at a node in the network will stimulate the growth of a congestion tree that not only affects contributors to congestion, but also other traffic flows in the network. Left untouched, the congestion tree will block traffic flows, lead to underutilization of network resources and result in a severe drop in network performance. The InfiniBand standard specifies a congestion control (CC) mechanism to detect and resolve congestion before a congestion tree is able to grow and, by that, hamper the network performance. The InfiniBand CC mechanism includes a rich set of parameters that can be tuned in order to achieve effective CC. Even though it has been shown that the CC mechanism, properly tuned, is able to improve both throughput and fairness in an interconnection network, it has been questioned whether the mechanism is fast enough to keep up with dynamic network traffic, and if a given set of parameter values for a topology is robust when it comes to different traffic patterns, or if the parameters need to be tuned depending on the applications in use. In this paper we address both these questions. Using the three-stage fat-tree topology from the Sun Datacenter InfiniBand Switch 648 as a basis, and a simulator tuned against CC capable InfiniBand hardware, we conduct a systematic study of the efficiency of the InfiniBand CC mechanism as the network traffic becomes increasingly more dynamic. Our studies show that the InfiniBand CC, even when using a single set of parameter values, performs very well as the traffic patterns becomes increasingly more dynamic, outperforming a network without CC in all cases. Our results show throughput increases varying from a few percent, to a seventeen-fold increase.},
	doi = {10.1109/IPDPS.2012.104},
	author = {Ernst Gunnar {Gran} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor and Zahavi, Eitan and Shainer, Gilad},
	editor = {Werner, Bob}
}
@techreport {Simula.simula.1540,
	title = {Increased Robustness With Interface Based Permutation Routing},
	number = {2012-18},
	year = {2012},
	publisher = {Simula Research Laboratory},
	abstract = {A prime objective of fault tolerant routing methods is the availability of multiple routing options at each hop. The methods that are currently implemented in IP networks, such as Equal-Cost Multi-Path (ECMP) and Loop Free Alternates (LFA), share the following four properties: First, they work with a hop-by-hop forwarding strategy optimized for the fault free case. Second, they do not require information associated with network faults included in the packet header. Third, they do not form forwarding loops, even under multiple failures in the network. Finally, they are compatible with standard link state routing protocols. However, ECMP and LFA give very poor fault coverage; in most cases fewer than 50\% of primary next-hops are protected when using typical link weight settings. This paper presents a new routing method that combines the concept of permutations with interface based routing. Our method results in a routing strategy that strictly adheres to the four stated design properties. Through experiments we show that we protect more than 97\% of the primary next-hops for all tested ISP networks.},
	author = {Vo, Hung and Lysne, Olav and Kvalbein, Amund}
}
@misc {Simula.simula.1218,
	title = {Kan Markedet Gi Oss Robuste Telenett?},
	year = {2012},
	month = {February},
	author = {Lysne, Olav and Kvalbein, Amund}
}
@misc {Simula.simula.1340,
	title = {Kan Markedet Gi Oss Robuste Telenett?},
	howpublished = {Telecruice},
	year = {2012},
	month = {April},
	author = {Lysne, Olav}
}
@misc {Simula.simula.1470,
	title = {Kan Markedet Gi Robuste Telenett?},
	howpublished = {Telecruice},
	year = {2012},
	author = {Lysne, Olav}
}
@article {Simula.simula.1350,
	title = {Permutation Routing for Increased Robustness in IP Networks},
	journal = {Networking},
	volume = {1},
	number = {LNCS 7289},
	year = {2012},
	pages = {217-231},
	publisher = {Springer Berlin Heidelberg},
	type = {Conference},
	abstract = {We present Permutation Routing as a method for increased robustness in IP networks with traditional hop-by-hop forwarding. Permutation Routing treats routers involved in traffic forwarding as a sequence of resources, and creates permutations of these resources that give several forwarding options. We introduce Permutation Routing as a concept, and use it to create routings where we seek to maximize single link fault coverage. Analogous to the IETF standardized Loop-Free Alternate (LFA), Permutation Routing can easily be implemented for OSPF or IS-IS networks to augment existing ECMP forwarding with additional loop-free forwarding entries for improved load balancing or fault tolerance. Our evaluations show that Permutation Routing can increase single link fault coverage by up to 28\% compared to LFA in inferred network topologies.},
	author = {Vo, Hung and Lysne, Olav and Kvalbein, Amund},
	editor = {Bestak et {al.}}
}
@misc {Simula.simula.1332,
	title = {Research in ICT: What We Should Do, and Why It Matters},
	howpublished = {VERDIKT Conference},
	year = {2012},
	month = {April},
	author = {Lysne, Olav}
}
@article {Simula.ND.41,
	title = {A Survey and Evaluation of Topology Agnostic Routing Algorithms},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {23},
	number = {3},
	year = {2012},
	month = {March},
	pages = {405-425},
	publisher = {IEEE},
	abstract = {Most standard interconnect technologies that have emerged over the last decade, mainly for clusters, are flexible with respect to network topology. This has spawned a substantial amount of research on topology agnostic routing algorithms, and some of the developed algorithms are widely deployed. These algorithms make no assumption about the structure of the network, thus they provide the flexibility needed to route on a network in the presence of faulty components. On the other hand, the advent of massive multi-core chips challenges the state of the art in interconnection networks. The topology of choice for point to point Networks on-chip (NoC) is the two dimensional mesh which is well understood, but the need of high yield, out of a production line for such chips requires that they should be functional even if some components suffer from manufacturing defects. Such defects will turn the regular topology into a slightly irregular one, making topology dependent routing algorithms inapplicable. Also, heterogeneous multi-core chips, where different cores could have different sizes and shapes, naturally lead to (slightly) irregular topologies. Therefore, topology agnostic routing algorithms proposed for clusters find a new environment to be applied since they provide the flexibility needed to route on a NoC in the presence of faulty or missing components. Moreover, in some cases, they have been shown to perform comparably to special purpose algorithms for regular topologies. Unfortunately, the existing topology agnostic routing algorithms have been developed for varying purposes, giving them different and not always comparable properties. Furthermore, the information on these routing algorithms is scattered on different papers where they have been evaluated under different and not comparable conditions. In this paper, we present a comprehensive overview of the topology agnostic routing algorithms that have been proposed to date. The algorithms are classified with respect to their most important properties, and their performance under equal, but varying conditions is analyzed. Thereby, we provide significant new insight into the properties of the different routing algorithms, and give substantial support for, given a set of requirements, finding the most suitable both for the on and off-chip environments.},
	author = {Flich, Jos{\'e} and Skeie, Tor and Mej{\'\i}a, Andres and Lysne, Olav and Lopez, Pedro and Robles, Antonio and Duato, Jose and Koibuchi, Michihiro and Rokicki, Tomas and Sancho, Jos{\'e}}
}
@inproceedings {Simula.simula.1500,
	title = {A Theory and Methodology for Combining Data Centre Networks},
	journal = {In proceedings of IEEE International Conference on High Performance Computing (HiPC)},
	year = {2012},
	pages = {1-8},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Existing methods for routing of interconnection networks are optimized for a small group of well defined topologies. Currently, system owners and system integrators are looking for ways to connect two or more existing topologies into one, and thereby create a unified system out of several subsystems. Such integration of multiple networks is supported through e.g. The subnet routing functionality i InfiniBand. In this paper we show that the routing problem of such integration is unsolved, because the integration of two deadlockfree subsystems may lead to routing deadlock. Thereafter we present a theory and a methodology for combining multiple networks in a deadlock-free manner. Through experiments we show that the methodology is able to connect different classes of pre-defined topologies with a definable number of interconnecting links. We demonstrate that we are able to maintain the original routing strategy in the sub-networks, and still get close to full utilization of the bridging links. Finally we show that the methodology is computationally feasible.},
	isbn = {978-1-4673-2372-7},
	doi = {10.1109/HiPC.2012.6507493},
	author = {Frank Olaf {Sem-Jacobsen} and Lorentzen, Ralph and Lysne, Olav}
}
@inproceedings {Simula.simula.1134,
	title = {Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection Networks},
	journal = {Proceedings of The 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing},
	year = {2012},
	month = {May},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Toleration of faults in the interconnection networks is of vital importance in todays huge computer installations. Still, the existing solutions are short of being satisfactory. They require that the system defaults into a routing algorithm that is inferior to the original, either in terms of performance, or in terms of the need for virtual channels, or both. Furthermore, since support for dynamic reconfiguration is not supported in current hardware, existing methods require the system to be halted while reconfiguration takes place in order to avoid deadlocks. In this paper we present a method that efficiently generates a new routing function in the presence of faults. The new routing function only reroutes the traffic that is affected by the fault, so that the performance of the original routing function is preserved to the extent possible. No specific functionality in the switches is required, we only require exactly the same number of virtual channels in the presence of faults as the original routing algorithm did. Finally, the new routing function is compatible with the old one, so that deadlock free dynamic transition between the old and the new routing function is immediately available. This means that our solution can easily be implemented on current InfiniBand platforms, e.g. through the OFED software stack. We demonstrate that the method is workable for meshes, tori and fat-trees, and that it is able to guarantee one-fault tolerance for all of these topologies.},
	author = {Frank Olaf {Sem-Jacobsen} and Lysne, Olav},
	editor = {Balaji, Pavan and Buyya, Rajkumar}
}
@inproceedings {Simula.simula.834,
	title = {Combining Congested-Flow Isolation and Injection Throttling in HPC Interconnection Networks},
	journal = {International Conference on Parallel Processing, ICPP 2011},
	year = {2011},
	month = {September},
	pages = {662-672},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Existing congestion control mechanisms in interconnects can be divided into two general approaches. One is to throttle traffic injection at the sources that contribute to congestion, and the other is to isolate the congested traffic in specially designated resources. These two approaches have different, but non-overlapping weaknesses. In this paper we present in detail a method that combines injection throttling and congested-flow isolation. Through simulation studies we first demonstrate the respective flaws of the injection throttling and of flow isolation. Thereafter we show that our combined method extracts the best of both approaches in the sense that it gives fast reaction to congestion, it is scalable and it has good fairness properties with respect to the congested flows.},
	isbn = {978-1-4577-1336-1},
	doi = {10.1109/ICPP.2011.80},
	author = {Escudero-Sahuquillo, Jes{\'u}s and Ernst Gunnar {Gran} and Pedro Javier {Garc{\'\i}a} and Flich, Jos{\'e} and Skeie, Tor and Lysne, Olav and Francisco Jos{\'e} {Quiles} and Duato, Jose},
	editor = {Bilof, Randall}
}
@inproceedings {Simula.simula.818,
	title = {DFtree - a Fat-Tree Routing Algorithm Using Dynamic Allocation of Virtual Lanes to Alleviate Congestion in InfiniBand Networks},
	journal = {The Network-Aware Data Management Workshop to be held in conjunction with the IEEE/ACM International Conference for High Performance Computing, Networking, Storage and Analysis (SC{\textquoteright}11)},
	year = {2011},
	month = {November},
	pages = {1-10},
	publisher = {ACM},
	type = {Workshop},
	abstract = {End-point hotspots can cause major slowdowns in interconnection networks due to head-of-line blocking and congestion. Therefore, avoiding congestion is important to ensure high performance for the network traffic. It is especially important in situations where permanent congestion, which results in permanent slowdown, can occur. Permanent congestion occurs when traffic has been moved away from a failed link, when multiple jobs run on the same system, and compete for network resources, or when a system is not balanced for the application that runs on it. In this paper we suggest a mechanism for dynamic allocation of virtual lanes and live optimisation of the distribution of flows between the allocated virtual lanes. The purpose is to alleviate the negative effect of permanent congestion by separating network flows into slow lane and fast lane traffic. Flows destined for an end-point hot-spot is placed in the slow lane and all other flows are placed in the fast lane. Consequently, the flows in the fast lane are unaffected by the head-of-line blocking created by the hot-spot traffic. We demonstrate the feasbility of this approach using a modified version of OFED and OpenSM with fat-tree routing on a small InfiniBand cluster. Our experiments show an increase in throughput ranging from 150\% to 468\% compared to the conventional fat-tree algorithm in OFED.},
	isbn = {978-1-4503-1132-8},
	author = {Wei Lin {Guay} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor},
	editor = {Balman, Mehmet and Byna, Surendra}
}
@inbook {Simula.simula.882,
	title = {Direct Networks},
	booktitle = {Encyclopedia of Parallel Computing},
	year = {2011},
	month = {January},
	pages = {1304-1310},
	publisher = {Springer},
	organization = {Springer},
	chapter = {Unknown},
	isbn = {978-0-387-09844-9},
	author = {Lysne, Olav and Frank Olaf {Sem-Jacobsen}},
	editor = {Padua, David}
}
@article {Simula.ND.64,
	title = {Dynamic Fault Tolerance in Fat-Trees},
	journal = {IEEE Transactions on Computers},
	volume = {60},
	number = {4},
	year = {2011},
	month = {April},
	pages = {508-525},
	publisher = {IEEE},
	abstract = {Fat-trees are a very common communication architecture in current large-scale parallel computers. The probability of failure increases with the number of components. We present a routing method for deterministically and adaptively routed fat trees, applicable to both distributed and source routing, that is able to handle several concurrent faults and that transparently returns to the original routing strategy once the faulty components have recovered. The method is local and dynamic, completely masking the fault from the rest of the system. It only requires a small extra functionality in the switches to handle misrouting around a fault. The method guarantees connectedness and deadlock and livelock freedom for up to radix/2 -1 arbitrary simultaneous faults. Our simulation experiments show a graceful degradation of performance as faults are added. Furthermore, they demonstrate that for most fault combinations, our method will even be able to handle significantly more faults beyond the radix/2-1 limit with high probability.},
	doi = {10.1109/TC.2010.97},
	author = {Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav and Duato, Jose}
}
@inproceedings {Simula.ND.303,
	title = {Efficient and Contention-Free Virtualisation of Fat-Trees},
	journal = {IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum},
	year = {2011},
	month = {September},
	pages = {754-760},
	publisher = {IEEE Computer Society Washington},
	type = {Workshop},
	address = {Washington DC, USA},
	abstract = {Maintaining high system utilisation is a key factor for data centres. However, strictly partitioning the datacentre resources to fully isolate the concurrent applications (contention freedom) leads to poor system utilisation because of fragmentation. We present an allocation algorithm for fat-trees (which are commonly found in large-scale data centres) capable of increasing system utilisation while maintaining application isolation. Results show at least a 10\% increase in system utilization compared to regular contention free allocation mechanisms, at the cost of a slight reduction in network performance or application isolation.},
	isbn = {978-0-7695-4577-6},
	author = {Frank Olaf {Sem-Jacobsen} and {\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Skeie, Tor and S{\o}dring, Thomas}
}
@misc {Simula.simula.3062,
	title = {High Node Count - Scalability Challenges for Interconnection Networks},
	howpublished = {Second International Workshop on HyperTransport Research and Applications},
	year = {2011},
	month = {February},
	author = {Lysne, Olav}
}
@misc {Simula.simula.822,
	title = {InfiniBand Congestion Control},
	howpublished = {Contributed talk at the 2011 OpenFabrics International Workshop, Monterey, USA},
	year = {2011},
	month = {April},
	abstract = {In InfiniBand networks congestion control (CC) can be an effective mechanism to achieve high performance and high utilisation of network resources. Without CC, congestion in one node may severely degrade overall performance. In this talk we introduce the problem of congestion and how it can be avoided with InfiniBand congestion control.},
	author = {Reinemo, Sven-Arne and Ernst Gunnar {Gran} and Skeie, Tor and Lysne, Olav}
}
@inbook {Simula.simula.884,
	title = {Multistage Networks},
	booktitle = {Encyclopedia of Parallel Computing},
	year = {2011},
	month = {January},
	pages = {1316-1321},
	publisher = {Springer},
	organization = {Springer},
	chapter = {Unknown},
	isbn = {978-0-387-09844-9},
	author = {Frank Olaf {Sem-Jacobsen} and Lysne, Olav},
	editor = {Padua, David}
}
@inproceedings {Simula.simula.364,
	title = {On the Relation Between Congestion Control, Switch Arbitration and Fairness},
	journal = {11th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing (CCGrid 2011)},
	year = {2011},
	month = {May},
	pages = {342-351},
	publisher = {IEEE},
	type = {Conference},
	abstract = {In lossless interconnection networks such as InfiniBand, congestion control (CC) can be an effective mechanism to achieve high performance and good utilization of network resources. The InfiniBand standard describes CC functionality for detecting and resolving congestion, but the design decisions on how to implement this functionallity is left to the hardware designer. One must be cautious when making these design decisions not to introduce fairness problems, as our study shows. In this paper we study the relationship between congestion control, switch arbitration, and fairness. Specifically, we look at fairness among different traffic flows arriving at a hot spot switch on different input ports, as CC is turned on. In addition we study the fairness among traffic flows at a switch where some flows are exclusive users of their input ports while other flows are sharing an input port (the parking lot problem). Our results show that the implementation of congestion control in a switch is vulnerable to unfairness if care is not taken. In detail, we found that a threshold hysteresis of more than one MTU is needed to resolve arbitration unfairness. Furthermore, to fully solve the parking lot problem, proper configuration of the CC parameters are required.},
	isbn = {978-1-4577-0129-0},
	doi = {10.1109/CCGrid.2011.67},
	author = {Ernst Gunnar {Gran} and Zahavi, Eitan and Reinemo, Sven-Arne and Skeie, Tor and Shainer, Gilad and Lysne, Olav},
	editor = {Buyya, Rajkumar}
}
@techreport {Simula.simula.852,
	title = {Topology Agnostic Dynamic Quick Reconfiguration for Large-Scale Interconnection Networks},
	year = {2011},
	month = {November},
	publisher = {Simula Research Laboratory},
	abstract = {Toleration of faults in the interconnection networks is of vital importance in todays huge computer installations. Still, the existing solutions are short of being satisfactory. They require that the system defaults into a routing algorithm that is inferior to the original, either in terms of performance, or in terms of the need for virtual channels, or both. Furthermore, since support for dynamic reconfiguration is not supported in current hardware, existing methods require the system to be halted while reconfiguration takes place in order to avoid deadlocks. In this paper we present a method that efficiently generates a new routing function in the presence of faults. The new routing function only reroutes the traffic that is affected by the fault, so that the performance of the original routing function is preserved to the extent possible. We require exactly the same number of virtual channels in the presence of faults as the original routing algorithm did. Finally, the new routing function is compatible with the old one, so that deadlock free dynamic transition between the old and the new routing function is immediately available. This means that our solution can easily be implemented on current InfiniBand platforms, e.g. through the OFED software stack. We demonstrate that the method is workable for meshes, tori and fat-trees, and that it is able to guarantee one-fault tolerance for all of these topologies.},
	author = {Frank Olaf {Sem-Jacobsen} and Lysne, Olav}
}
@misc {Simula.simula.824,
	title = {VFtree - a Fat-Tree Routing Algorithm Using Virtual Lanes to Alleviate Congestion},
	howpublished = {Invited talk at the HPC Advisory Council Switzerland Workshop 2011, Lugano, Switzerland.},
	year = {2011},
	month = {March},
	abstract = {A large number of clusters using InfiniBand is based on fat-tree topologies that can be routed deadlock-free using only one virtual lane. Consequently, all the remaining virtual lanes are left unused. In this talk we present an enhancement to the fat-tree algorithm that utilizes virtual lanes to improve performance when hot-spots are present. In a congested environment, results show that we are able to achieve throughput increases up to 38\% on a small cluster and from 221\% to 757\% depending on the hot-spot scenario for a 648-port simulated cluster.},
	author = {Reinemo, Sven-Arne and Wei Lin {Guay} and Bogdanski, Bartosz and Lysne, Olav and Skeie, Tor}
}
@inproceedings {Simula.simula.184,
	title = {VFtree - a Fat-Tree Routing Algorithm Using Virtual Lanes to Alleviate Congestion},
	journal = {Proceedings of the 25th IEEE International Parallel \& Distributed Processing Symposium},
	year = {2011},
	pages = {197-208},
	publisher = {IEEE Computer Society Press},
	type = {Conference},
	abstract = {It is a well known fact that multiple virtual lanes can improve performance in interconnection networks, but this knowledge has had little impact on real clusters. Currently, a large number of clusters using InfiniBand is based on fat-tree topologies that can be routed deadlock-free using only one virtual lane. Consequently, all the remaining virtual lanes are left unused. In this paper we suggest an enhancement to the fat-tree algorithm that utilizes virtual lanes to improve performance when hot-spots are present. Even though the bisection bandwidth in a fat-tree is constant, hot-spots are still possible and they will degrade performance for flows not contributing to them due to head-of-line blocking. Such a situation may be alleviated through adaptive routing or congestion control, however, these methods are not yet readily available in InfiniBand technology. To remedy this problem, we have implemented an enhanced fat-tree algorithm in OpenSM that distributes traffic across all available virtual lanes without any configuration needed. We evaluated the performance of the algorithm on a small cluster and done a large-scale evaluation through simulations. In a congested environment, results show that we are able to achieve throughput increases up to 38\% on a small cluster and from 221\% to 757\% depending on the hot-spot scenario for a 648-port simulated cluster.},
	isbn = {978-1-61284-372-8},
	author = {Wei Lin {Guay} and Bogdanski, Bartosz and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor},
	editor = {Xin, Yuan}
}
@misc {Simula.simula.490,
	title = {Deadlock Free Network Routing},
	year = {2010},
	author = {Lysne, Olav}
}
@inproceedings {Simula.nd.417,
	title = {First Experiences With Congestion Control in InfiniBand Hardware},
	journal = {2010 IEEE International Symposium on Parallel \& Distributed Processing (IPDPS)},
	year = {2010},
	pages = {1-12},
	publisher = {IEEE},
	type = {Conference},
	abstract = {In lossless interconnection networks congestion control (CC) can be an effective mechanism to achieve high performance and good utilization of network resources. Without CC, congestion on one link may grow into a congestion tree that can degrade the performance severely. This degradation can affect not only contributors to the congestion, but also throttles innocent traffic flows in the network. The InfiniBand standard describes CC functionality for detecting and resolving congestion. The InfiniBand CC concept is rich in the way that it specifies a set of parameters that can be tuned in order to achieve effective CC. There is, however, limited experience with the InfiniBand CC mechanism. To the best of our knowledge, only a few simulation studies exist. Recently, InfiniBand CC has been implemented in hardware, and in this paper we present the first experiences with such equipment. We show that the implemented InfiniBand CC mechanism effectively resolves congestion and improves fairness by solving the parking lot problem, if the CC parameters are appropriately set. By conducting extensive testing on a selection of the CC parameters, we have explored the parameter space and found a subset of parameter values that leads to efficient CC for our test scenarios. Furthermore, we show that the InfiniBand CC increases the performance of the well known HPC Challenge benchmark in a congested network.},
	isbn = {978-1-4244-6442-5},
	doi = {10.1109/IPDPS.2010.5470419},
	author = {Ernst Gunnar {Gran} and Eimot, Magne and Reinemo, Sven-Arne and Skeie, Tor and Lysne, Olav and Lars Paul {Huse} and Shainer, Gilad},
	editor = {Phillips, Cynthia}
}
@misc {Simula.netsys.10,
	title = {First Experiences With Congestion Control in InfiniBand Hardware},
	howpublished = {Invited talk at the HPC Advisory Council Switzerland Workshop 2010},
	year = {2010},
	month = {March},
	abstract = {In InfiniBand networks congestion control (CC) can be an effective mechanism to achieve high performance and high utilisation of network resources. Without CC, congestion in one node may severely degrade overall performance. In this talk we introduce the problem of congestion and how it can be avoided with InfiniBand congestion control.},
	author = {Reinemo, Sven-Arne and Ernst Gunnar {Gran} and Eimot, Magne and Skeie, Tor and Lysne, Olav and Lars Paul {Huse} and Shainer, Gilad}
}
@inproceedings {Simula.netsys.12,
	title = {Host Side Dynamic Reconfiguration With InfiniBand},
	journal = {2010 IEEE International Conference on Cluster Computing},
	year = {2010},
	pages = {126-135},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Rerouting around faulty components and migration of jobs both require reconfiguration of data structures in the Queue Pairs residing in the hosts on an InfiniBand cluster. In this paper we report an implementation of dynamic reconfiguration of such host side data-structures. Our implementation preserves the Queue Pairs, and lets the application run without being interrupted. With this implementation, we demonstrate a complete solution to fault tolerance in an InfiniBand network, where dynamic network reconfiguration to a topology-agnostic routing function is used to avoid malfunctioning components. This solution is in principle able to let applications run uninterruptedly on the cluster, as long as the topology is physically connected. Through measurements on our test-cluster we show that the increased cost of our method in setup latency is negligible, and that there is only a minor reduction in throughput during reconfiguration.},
	isbn = {978-0-7695-4220-1},
	author = {Wei Lin {Guay} and Reinemo, Sven-Arne and Lysne, Olav and Skeie, Tor and Bj{\o}rn Dag {Johnsen} and Holen, Line},
	editor = {Gu, Xiaohui and Ma, Xiaosong}
}
@misc {Simula.simula.492,
	title = {Resilient Routing Systems and Methods},
	year = {2010},
	issn = {US7724674B2},
	author = {Lysne, Olav and Kvalbein, Amund and Audun Fosselie {Hansen} and Gjessing, Stein and Cicic, Tarik}
}
@misc {24156,
	title = {Resilient routing systems, computer software product and method},
	year = {2010},
	issn = {EP1821472B1},
	author = {Cicic, Tarik and Gjessing, Stein and Audun Fosselie {Hansen} and Kvalbein, Amund and Lysne, Olav}
}
@misc {Simula.netsys.14,
	title = {VFtree- Fat Tree Routing With Virtual Lanes in InfiniBand},
	howpublished = {Poster, HiPEAC ACACES, Barcelona, Spain},
	year = {2010},
	abstract = {Even though the bisectional bandwidth in a fat-tree is constant, hot spots are still possible. Such a situation may be alleviated through adaptive routing or congestion control, however, these methods are not fully supported in InfiniBand technology. We propose an inexpensive approach for reducing the hot-spot problem in fat-trees, which is based on the application of virtual lanes.},
	author = {Wei Lin {Guay} and Bogdanski, Bartosz and Reinemo, Sven-Arne and Lysne, Olav}
}
@inbook {Simula.simula.592,
	title = {Bridging the Gap Between Industry and Research},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {533-540},
	publisher = {Springer},
	organization = {Springer},
	chapter = {38},
	isbn = {978-3-642-01155-9},
	author = {Are Magnus {Bruaset} and Marianne M. {Sundet}},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SC.482,
	title = {Can ECG Recordings and Mathematics Tell the Condition of Your Heart?},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {287-319},
	publisher = {Springer},
	organization = {Springer},
	chapter = {22},
	address = {Heidelberg},
	isbn = {978-3-642-01156-6},
	author = {Nielsen, Bj{\o}rn Fredrik and Ola Marius {Lysaker} and Gr{\o}ttum, Per and Mardal, Kent-Andre and Tveito, Aslak and Tarrou, Christian and Haugaa, Kristina and Abildgaard, Andreas and Jan Gunnar {Fjeld}},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SC.536,
	title = {Computer Simulations of the Heart},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {259-276},
	publisher = {Springer},
	organization = {Springer},
	chapter = {20},
	address = {Heidelberg},
	isbn = {978-3-642-01155-9},
	author = {Glenn T. {Lines} and Sundnes, Joakim},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@techreport {Simula.nd.413,
	title = {Dynamic Fault Tolerance in Fat-Trees - Research Note},
	year = {2009},
	month = {November},
	publisher = {Simula},
	abstract = {Fat-trees are a very common communication architecture in current large-scale parallel computers. The probability of failure in these systems increases with the number of components. We present a routing method for deterministically and adaptively routed fat-trees, applicable to both distributed and source routing, that is able to handle several concurrent faults and that transparently returns to the original routing strategy once the faulty components have recovered. The method is local and dynamic, completely masking the fault from the rest of the system. It only requires a small extra functionality in the switches to handle misrouting around a fault. The method guarantees connectedness and deadlock and livelock freedom for up to k -1 arbitrary simultaneous switch and/or link faults where k is half the number of ports in the switches. Our simulation experiments show a graceful degradation of performance as more faults occur. Furthermore, we demonstrate that for most fault combinations, our method will even be able to handle significantly more faults beyond the k-1 limit with high probability.},
	author = {Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav and Duato, Jose}
}
@inbook {Simula.simula.590,
	title = {Educating Researchers - a Virtue of Necessity},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {483-494},
	publisher = {Springer},
	organization = {Springer},
	chapter = {31},
	isbn = {ISBN 978-3-642-01155-9},
	author = {Are Magnus {Bruaset} and Vinje, Kristin},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inproceedings {Simula.ND.54,
	title = {Efficient and Deadlock-Free Reconfiguration for Source Routed Networks},
	journal = {Communication Architecture for Clusters (CAC)},
	year = {2009},
	publisher = {IEEE Computer Society},
	type = {Workshop},
	abstract = {Overlapping Reconfiguration is currently the most efficient method to reconfigure an interconnection network, but is only valid for systems that apply distributed routing. This paper proposes a solution which enables utilization of Overlapping Reconfiguration in a source routed environment. We demonstrate how a synchronized injection of tokens has a significant impact on the performance of the method. Furthermore, we propose and evaluate an optimization of the original algorithm that reduces (and in some cases even eliminates) performance issues caused by the token forwarding regime, such as increased latency and decreased throughput.},
	isbn = {978-1-4244-3750-4},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Berm{\'u}dez, Aurelio and Casado, Rafael and S{\o}dring, Thomas and Skeie, Tor and Robles-Gomez, Antonio},
	editor = {Yang, Yuanyuan}
}
@inproceedings {Simula.ND.293,
	title = {A Framework for Routing and Resource Allocation in Network Virtualization},
	journal = {International Conference on High Performance Computing (HiPC{\textquoteright}09)},
	year = {2009},
	pages = {129-139},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Computer architectures for high performance computing have traditionally been based on an assumption of one parallel application running alone on one machine. The current trend is, however, that huge computer installations offer compute power to a set of users or customers, each demanding only a subset of the available compute resources. This places new requirements on the architecture, in that it must support dynamic partitioning of the resources into several virtual servers as demand changes. We introduce a novel framework which supports flexible formation of such virtual servers while preventing interference between the communication of different virtual servers. This paper investigates the impacts of a shared interconnection network on applications running on virtual compute servers. We show that the interconnect performance supplied to each job is highly unpredictable, and that a job can experience a performance degradation of 97\% when its traffic interferes with the traffic of concurrent jobs. With a minor reduction in the utilization of each processing node, this can be considerably improved through a combination of routing-containment in the interconnection network and a carefully designed resource allocation strategy.},
	isbn = {978-1-4244-4921-7},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Skeie, Tor and S{\o}dring, Thomas and Reinemo, Sven-Arne},
	editor = {Yang, Yuanyuan and Parashar, M. and Muralidhar, R. and V. K. {Prasanna}}
}
@inbook {Simula.SC.516,
	title = {The Hamming Experience},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {33-36},
	publisher = {Springer},
	organization = {Springer},
	chapter = {5},
	isbn = {ISBN 978-3-642-01155-9},
	author = {Hans Petter {Langtangen} and Lysne, Olav},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SE.447,
	title = {The Industry Is Our Lab - Organization and Conducting of Empirical Studies in Software Engineering at Simula},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {443-458},
	publisher = {Springer},
	organization = {Springer},
	chapter = {29},
	address = {Heidelberg},
	abstract = {The society is completely dependent on reliable and efficient software. Development of such software requires the use of appropriate processes, method and tools. To evaluate their appropriateness in various industrial settings, empirical studies are needed. At present, most studies in software engineering are run with students in artificial settings. The strategy of Simula Research Laboratory to invest in experiment infrastructures and hire professionals as subjects has contributed to a significant improvement of state of the art regarding the realism and scale of experiments and control in real-life case studies. During its first eight years, Simula has conducted studies that have included about 6000 professional software developers and managers from 273 companies in 25 countries. However, increasing the realism of tasks and systems in experiments and control in case studies is still a challenge for Simula and the rest of the research community.},
	isbn = {978-3-642-01155-9},
	author = {Sj{\o}berg, Dag Ingar Kondrup},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@article {Simula.ND.4,
	title = {Multiple Routing Configurations for Fast IP Network Recovery},
	journal = {IEEE/ACM Transactions on Networking},
	volume = {17},
	number = {2},
	year = {2009},
	month = {April},
	pages = {473-486},
	abstract = {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.},
	doi = {10.1109/TNET.2008.926507},
	author = {Kvalbein, Amund and Audun Fosselie {Hansen} and Cicic, Tarik and Gjessing, Stein and Lysne, Olav}
}
@inbook {Simula.ND.279,
	title = {Network Reconfiguration in High-Performance Interconnection Networks},
	booktitle = {Autonomic Computing and Networking},
	year = {2009},
	pages = {313-332},
	publisher = {Springer},
	organization = {Springer},
	chapter = {8},
	abstract = {High-performance interconnection networks like InfiniBand, ASI, Autonet andMyrinet have the property of link level flow control. As such alterating the routing function while the network is operational is a complex process, because the danger of packet deadlocks must be addressed. Over the last 5-6 years this problem has been addressed and solved by the research community. This chapter collects several proposals for updating a routing function in interconnection networks after the occurrence of a topological change. Both traditional and recent reconfiguration schemes are covered, and the selection includes both technology-dependant and generic techniques.},
	isbn = {978-0-387-89827-8},
	author = {Casado, Rafael and Berm{\'u}dez, Aurelio and Robles-Gomez, Antonio and Lysne, Olav and Skeie, Tor and {\r A}shild Gr{\o}nstad {Solheim} and S{\o}dring, Thomas},
	editor = {Mieso K. {Denko} and Laurence Tianruo {Yang} and Zhang, Yan}
}
@inbook {Simula.nd.475,
	title = {Networks and Distributed Systems - Why, What, How and What{\textquoteright}s Next},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {123-128},
	publisher = {Springer},
	organization = {Springer},
	chapter = {13},
	address = {Heidelberg},
	isbn = {978-3642011559},
	author = {Griwodz, Carsten and Lysne, Olav},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SC.492,
	title = {Past and Future Perspectives on Scientific Software},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {321-362},
	publisher = {Springer},
	organization = {Springer},
	chapter = {23},
	address = {Heidelberg},
	isbn = {978-3-642-01155-9},
	author = {Logg, Anders and Hans Petter {Langtangen} and Cai, Xing},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.ND.299,
	title = {Providing Resilience in Communications Networks},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {163-188},
	publisher = {Springer},
	organization = {Springer},
	chapter = {15},
	address = {Heidelberg},
	abstract = {The purpose of the Resilient Networks Project at Simula is to provide resilience in communications networks with cost-efficient approaches. In particular, we identify and solve challenges for both Internet and wireless networks. In the Internet context, we focus on scalable solutions for maintaining network operations during failures or other challenging scenarios. This includes providing fast recovery from component failures, increasing robustness to failures and traffic fluctuations by spreading traffic on multiple paths, and investigating the scalability limitations of the current interdomain routing protocol BGP. Wireless resilience is highly dependent on a specific kind of wireless system and it is closely related to Quality-of-Service (QoS) provisioning. For this, we have investigated the resilience in resource-constrained sensor networks and QoS in OFDM-based wireless networks. It has been shown that the proposed strategies are able to substantially enhance network throughput and increase service reliability. In this chapter, we give an overview of the recent activities in the project, and briefly discuss future plans. Further technical details can be found in our journal and conference papers.},
	isbn = {978-3-642-01156-6},
	author = {Kvalbein, Amund and Zhang, Yan},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inproceedings {Simula.ND.295,
	title = {RecTOR: a New and Efficient Method for Dynamic Network Reconfiguration},
	journal = {Euro-Par 2009},
	year = {2009},
	pages = {1052-1064},
	publisher = {Springer Berlin / Heidelberg},
	type = {Conference},
	abstract = {Reconfiguration of an interconnection network is fundamental for the provision of a reliable service. Current reconfiguration methods either include deadlock-avoidance mechanisms that impose performance penalties during the reconfiguration, or are tied to the Up*/Down* routing algorithm which achieves relatively low performance. In addition, some of the methods require complex network switches, and some are limited to distributed routing systems. This paper presents a new dynamic reconfiguration method, RecTOR, which ensures deadlock-freedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. Moreover, it is based on a simple concept, is easy to implement, is applicable for both source and distributed routing systems, and assumes Transition-Oriented Routing which achieves excellent performance. Our simulation results confirm that RecTOR supports a better network service to the applications than Overlapping Reconfiguration does.},
	isbn = {978-3-642-03868-6},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Skeie, Tor},
	editor = {Epema H. {Sips} and Lin, H.-X.}
}
@article {Simula.ND.351,
	title = {Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures},
	journal = {IEEE Transactions on Network and Service Management},
	volume = {6},
	number = {1},
	year = {2009},
	month = {March},
	pages = {1-14},
	publisher = {IEEE},
	abstract = {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 {\textquoteleft}{\textquoteleft}relaxed MRC\&$\#$39;\&$\#$39; (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.},
	doi = {10.1109/TNSM.2009.090301},
	author = {Cicic, Tarik and Audun Fosselie {Hansen} and Kvalbein, Amund and Hartmann, Matthias and Menth, Michael and Martin, R{\"u}diger and Gjessing, Stein and Lysne, Olav}
}
@inbook {Simula.ND.305,
	title = {RELAY - on the Performance and Resource Utilization of Time-Dependent Large-Scale Distributed Systems},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {199-236},
	publisher = {Springer},
	organization = {Springer},
	chapter = {17},
	address = {Heidelberg},
	abstract = {Powerful end-systems and faster access networks make large-scale distributed multimedia applications such as streaming and gaming increasingly popular. This popularity does, of course, also mean that the increase in available computing power and network bandwidth does not solve all existing problems, but rather that other parts of distributed systems will become bottlenecks. To relieve these, RELAY addresses issues of resource utilization in such distributed systems by investigating network and operating system support that provides quantifiably better support than the state-of-the-art. One of our main goals is to integrate and combine mechanisms to get more scalable, less resource demanding, high performance systems for time-dependent large-scale distributed multimedia systems. RELAY designs, implements and evaluates algorithms, mechanisms and tools to improve resource utilization, increase throughput, reduce/hide latency and support soft Quality-of-Service. The development takes user experience into account, since adaptation specific to this can reduce the necessary resource consumption considerably. We consider architectural, application-level, kernel and protocol support to achieve our goals, and we investigate combinations of performance-enhancing mechanisms such that they do not counteract each other. RELAY{\textquoteright}s approach is application-driven, where the best way of achieving performance improvements determines the research methodology. As an example, we report several of our findings in investigating support for distributed interactive applications, and massive multiplayer games in particular.},
	isbn = {978-3642011559},
	author = {Griwodz, Carsten and Halvorsen, P{\r a}l},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.ND.309,
	title = {Scalable Interconnection Networks},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {129-162},
	publisher = {Springer},
	organization = {Springer},
	chapter = {14},
	address = {Heidelberg},
	abstract = {A modern supercomputer or large scale server consists of a huge set of processing units and units that perform different forms of input/output and memory functions. These components unite in a complex collaboration to perform the main tasks of the system. Such collaboration requires communication between the components, which is supported by an infrastructure called the interconnection network. This book chapter describes the interconnection networks research activity at Simula the last five years done by the ICON group. ICON has focused on how to connect point-to-point links and switches into scalable network topologies, and how to route packets efficiently in order to yield the highest possible performance. This also poses various requirements regarding fault tolerance, quality of service (QoS), congestion control, virtualization, and other non-functional aspects. ICON\&$\#$39;s research results have been published in several of the most respected IEEE journals and magazines within our field. Furthermore, some of ICON\&$\#$39;s solutions have had a major impact on the routing architecture of modern supercomputers.},
	isbn = {978-3-642-01155-9},
	author = {Lysne, Olav and Skeie, Tor and Reinemo, Sven-Arne and Frank Olaf {Sem-Jacobsen} and Nils Agne {Nordbotten}},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SC.514,
	title = {Scientific Computing: Why - How - What - What{\textquoteright}s Next},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {237-248},
	publisher = {Springer},
	organization = {Springer},
	chapter = {18},
	isbn = {978-3-642-01155-9},
	author = {Hans Petter {Langtangen} and Sundnes, Joakim},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SE.433,
	title = {A Series of Controlled Experiments on Software Maintenance},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {459-479},
	publisher = {Springer},
	organization = {Springer},
	chapter = {30},
	address = {Heidelberg},
	abstract = {Research background Software maintenance is both difficult and costly, and software organizations have little tangible evidence with regards to how they can improve their software maintenance practices and precisely what elements comprise the tradeoffs, the expected costs, and the benefits of alternative solutions. Scientific challenges The effort required to maintain software systems depends on many interacting factors, such as the software system\&$\#$39;s structural properties; the use of analysis, design principles and patterns; available documentation of requirements; design and code; tool support; and developer skills. Given the complexities of the problems at hand, empirical studies in realistic yet controlled settings are needed to better understand how such factors drive the costs of software maintenance and the quality of the software artefacts. In the Maintenance of Object-Oriented Software (MOOSE) project at Simula Research Laboratory, we have pursued large-scale, controlled experiments that combine a high degree of realism with the necessary degree of control, so as to obtain credible results that are applicable to the problems faced by the software industry. Obtained and expected results The studies reported herein contribute to a significantly improved understanding of software maintenance performance by pushing the boundaries of state-of-the-art empirical software engineering research. The results can help software maintenance organizations improve the efficiency of their maintenance processes and the quality of the products being maintained. Specifically, the results provide empirical evidence on tradeoffs and expected costs and benefits when applying design principles and patterns, simple task prioritization techniques, the Unified Modelling Language (UML), and pair programming in different maintenance contexts.},
	isbn = {978-3-642-01155-9},
	author = {Arisholm, Erik},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@book {Simula.SC.530,
	title = {Simula Research Laboratory - by Thinking Constantly About It},
	year = {2009},
	publisher = {Springer},
	address = {Heidelberg},
	abstract = {Through a mix of articles and interviews, this book describes the philosophy behind Simula Research Laboratory; how it has been implement, and the results that have come out of it. Most of the book is intended for anyone interested in research, whereas some of the articles are written for experts interested in Simula\&$\#$39;s research subjects. Read more about the book at http://simula.no/about/the-simula-book},
	isbn = {ISBN 978-3-642-01155-9},
	author = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.simula.588,
	title = {Simula - the Language},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {113-118},
	publisher = {Springer},
	organization = {Springer},
	chapter = {11},
	isbn = {978-3-642-01155-9},
	author = {Lysne, Olav and Are Magnus {Bruaset}},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SE.427,
	title = {Software Development Effort Estimation: Demystifying and Improving Expert Estimation},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {381-404},
	publisher = {Springer},
	organization = {Springer},
	chapter = {26},
	address = {Heidelberg},
	abstract = {Research background: Inaccurate estimation of software development effort is one of the most important reasons of IT-project failures. While too low effort estimates may lead to project management problems, delayed deliveries, budget overruns and low software quality, too high effort estimates may lead to lost business opportunities and inefficient use of resources. These IT-project problems motivated the BEST (Better Estimation of Software Tasks) project at Simula Research Laboratory to conduct research with the goal of improving effort estimation methods. Scientific challenges: The project{\textquoteright}s main focus is to improve judgment-based effort estimation (expert estimation), which is the estimation approach most frequently used by the software industry. We argue that a better understanding of the mental steps involved in expert estimation is necessary to achieve robust improvement of software development estimation processes. A great challenge when studying expert judgment is to understand the unconscious steps involved. To study these steps, we make use of multidisciplinary competencies, especially psychology and software engineering, and financial resources enabling studies in realistic software development effort estimation contexts. Obtained and expected results: In this section, we present the main results of the project from its beginnings in 2001 until today and describe how the project has benefited from being an integrated part of Simula Research Laboratory, especially through the opportunity to conduct large-scale, controlled experiments in field settings. The section includes practical results on how to improve estimation methods, scientific results leading to a better understanding of the mental processes involved in judgment-based effort estimation, and our innovative research methods in the field of empirical software engineering. Results of the BEST project are currently in use by several software companies, as well as by researchers in forecasting and psychology, and they are also included in project management and software engineering textbooks. The BEST project plans to continue its multidisciplinary effort with the goal of constructing and evaluating better models of the mental steps involved in judgment-based effort estimation. An improved model of these steps will enhance our ability to accurately estimate software development effort and to predict when different types of estimation methods can be expected to deliver accurate effort estimates. This will in turn lead to a reduction of the number of IT-project failures and make better use of scarce financial and human resources.},
	isbn = {978-3642011559},
	author = {J{\o}rgensen, Magne and Grimstad, Stein},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SE.637,
	title = {Software Engineering: Why - How - What - What{\textquoteright}s Next},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {363-368},
	publisher = {Springer},
	organization = {Springer},
	chapter = {24},
	isbn = {ISBN: 978-3642011559},
	author = {Sj{\o}berg, Dag Ingar Kondrup and Grimstad, Stein},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SE.431,
	title = {Software Verification: a Scalable, Model-Driven, Empirically Grounded Approach},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {415-442},
	publisher = {Springer},
	organization = {Springer},
	chapter = {28},
	address = {Heidelberg},
	isbn = {978-3-642-01155-9},
	author = {Briand, Lionel},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.simula.594,
	title = {Spinning Off From Simula},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {613-626},
	publisher = {Springer},
	organization = {Springer},
	chapter = {42},
	isbn = {978-3-642-01155-9},
	author = {Are Magnus {Bruaset} and Viktor S. Wold {Eide} and Eliassen, Frank and Hans Enger {Gallis} and Tarrou, Christian},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@inbook {Simula.SC.480,
	title = {Turning Rocks Into Knowledge - Experiences and Results From an Industrial Collaboration in Computational Geosciences},
	booktitle = {Simula Research Laboratory - by thinking constantly about it},
	year = {2009},
	pages = {553-600},
	publisher = {Springer},
	organization = {Springer},
	chapter = {40},
	address = {Heidelberg},
	abstract = {Since early 2005, Simula Research Laboratory and StatoilHydro have built a strong and long-term research collaboration in computational geosciences. The main goal for this collaboration is to strengthen the procedures in oil and gas exploration through new and improved computer-based models of geological and geophysical processes. So far, the 4D Lithosphere Model and a new generation of the Compound Modelling technology have been sucessfully established, and the collaboration has become strategically important for both organisations. Even more contributions are in fast progress, possibly leading to improved reliability of depositional models, better insight in the physics of underwater gravity flows of sediments, and more accurate descriptions of deformations in sedimentary basins. This paper describes the background for the research collaboration, as well as the contents of the ongoing scientific activities. Using the obtained academic and industrial results as a backdrop, we also summarize the key factors for the successful implementation of a close link between the basic research community and industry. The coupling between research tasks of academic nature and technology development has proven to be bidirectional, in that development-oriented activities lead to new PhD and postdoctoral research projects, and vice versa. The intimate connection between the axes of research and development is a particular strength in the StatoilHydro-Simula collaboration. This feature is a consequence of both companies being committed to long-term research, and the flexibility offered by Simula{\textquoteright}s organisation.},
	isbn = {ISBN 978-3-642-01155-9},
	author = {Are Magnus {Bruaset}},
	editor = {Tveito, Aslak and Are Magnus {Bruaset} and Lysne, Olav}
}
@article {Simula.ND.22,
	title = {An Efficient and Deadlock-Free Network Reconfiguration Protocol},
	journal = {IEEE Transactions on Computers},
	volume = {57},
	number = {6},
	year = {2008},
	month = {June},
	pages = {762-779},
	abstract = {Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over time. Such changes may require the network to be reconfigured such that the existing routing function is replaced by one which enables packets to reach their intended destinations amid the changes. Efficient reconfiguration methods are desired that allow the network to function uninterruptedly over the course of the reconfiguration process while remaining free from deadlocking behavior. In this paper, we propose, evaluate, and prove deadlock freedom of a new network reconfiguration protocol that overlaps various phases of {\textquotedblleft}static{\textquotedblright} reconfiguration processes traditionally used in commercial and research systems to provide performance efficiency on par with that of recently proposed {\textquotedblleft}dynamic{\textquotedblright} reconfiguration processes, but without their complexity. Simulation results show that the proposed Overlapping Static Reconfiguration protocol can reduce reconfiguration time by up to 50\%, reduce packet latency by several orders of magnitude, reduce packet dropping by an order of magnitude, and provide unhalted packet injection as compared to traditional static reconfiguration while allowing network throughput similar to dynamic reconfiguration.},
	author = {Lysne, Olav and Jose Miguel {Montanana} and Flich, Jos{\'e} and Duato, Jose and Timothy Mark {Pinkston} and Skeie, Tor}
}
@inproceedings {Simula.ND.61,
	title = {Fault Tolerance With Shortest Paths in Regular and Irregular Networks},
	journal = {22nd IEEE International Parallel \& Distributed Processing Symposium},
	year = {2008},
	month = {April},
	publisher = {IEEE},
	type = {Conference},
	abstract = {Fault tolerance has become an important part of current supercomputers. Local dynamic fault tolerance is the most expedient way of tolerating faults by preconfiguring the network with multiple paths from every node/switch to every destination. In this paper we present a local shortest path dynamic fault-tolerance mechanism inspired by a solution developed for the Internet that can be applied to any shortest path routing algorithm such as Dimension Ordered Routing, Fat Tree Routing, Layered Shortest Path, etc., and provide a solution for achieving deadlock freedom in the presence of faults. Simulation results show that 1) for fat trees this yields the to this day highest throughput and lowest requirements on virtual layers for dynamic one-fault tolerance, 2) we require in general few layers to achieve deadlock freedom, and 3) for irregular topologies it gives at most a 10 times performance increase compared to FRoots.},
	isbn = {978-1-4244-1693-6},
	author = {Frank Olaf {Sem-Jacobsen} and Lysne, Olav},
	editor = {Robert, Yves}
}
@article {Simula.ND.18,
	title = {The Interconnection Network - Architectural Challenges for Utility Computing Data Centres},
	journal = {IEEE Computer Magazine},
	volume = {41},
	number = {9},
	year = {2008},
	month = {September},
	pages = {62-69},
	publisher = {IEEE},
	abstract = {The mode of operation employed by Computational Data Centres that offer Utility Computing differs significantly from that of traditional supercomputers and server clusters and as such present new architectural problems that should be studied and solved. In this paper we concentrate on issues facing the interconnection network. We argue that this is a part of the overall architecture where shortcomings in present day solutions are most severe and present a model for the mode of operation of a Utility Computing Data Centre where virtualisation is a main ingredient. Based on this model we identify several areas where the interconnection network faces new challenges and needs new solutions. In each of these areas we give a brief introduction to previous results before we identify the new challenges.},
	author = {Lysne, Olav and Reinemo, Sven-Arne and Skeie, Tor and {\r A}shild Gr{\o}nstad {Solheim} and S{\o}dring, Thomas and Lars Paul {Huse} and Bj{\o}rn Dag {Johnsen}}
}
@inproceedings {Simula.ND.84,
	title = {Making an SCI Fabric Dynamically Fault Tolerant},
	journal = {Workshop on Communication Architecture for Clusters (CAC 2008)},
	year = {2008},
	month = {April},
	pages = {1-8},
	publisher = {IEEE},
	type = {Conference},
	abstract = {In this paper we present a method for dynamic fault tolerant routing for SCI networks implemented on Dolphin Interconnect Solutions hardware. By dynamic fault tolerance, we mean that the interconnection network reroutes affected packets around a fault, while the rest of the network is fully functional. To the best of our knowledge this is the first reported case of dynamic fault tolerant routing available on commercial off the shelf interconnection network technology without duplicating hardware resources. The development is focused around a 2-D torus topology, and is compatible with the existing hardware, and software stack. We look into the existing mechanisms for routing in SCI. We describe how to make the nodes that detect the faulty component do routing decisions, and what changes are needed in the existing routing to enable support for local rerouting. The new routing algorithm is tested on clusters with real hardware. Our tests show that distributed databases like MySQL can run uninterruptedly while the network reacts to faults. The solution is now part of Dolphin Interconnect Solutions SCI driver, and hardware development to further decrease the reaction time is underway.},
	isbn = {9781424416936},
	author = {H{\r a}kon Kvale {Stensland} and Lysne, Olav and Nordstr{\o}m, Roy and Kohmann, Hugo},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.71,
	title = {On the Potential of NoC Virtualization for Multicore Chips},
	journal = {International Workshop on Multi-Core Computing Systems (MuCoCoS{\textquoteright}08)},
	year = {2008},
	month = {March},
	pages = {801-807},
	publisher = {IEEE},
	type = {Workshop},
	abstract = {As the end of Moores-law is on the horizon, power becomes a limiting factor to the continuous increases in performance gains for single-core processors. Processor engineers have shifted to the multicore paradigm and many-core processors are reality. Within the context of these multi-core, three key metrics point themselves out as being of major importance, performance, fault-tolerance (including yield), and power consumption. A solution that optimizes all three of these metric is challenging. As the number of cores increases the importance of the interconnection network-on-chip (NoC) grows as well, and chip designers should aim to optimize these three key metrics. In this paper we identify and discuss the main properties that a NoC must exhibit in order to enable such optimizations. In particular, we propose the use of virtualization techniques at the NoC level. The implementation of routing algorithms for NoC is a key design parameter in order to achieve an effective virtualization of the chip that should also support broadcast within the virtualized context. The intention behind this paper is for it to serve a position paper on the topic of virtualization for NoC and the challenges that should be met at the routing layer in order to maximize performance, fault-tolerance and power consumption.},
	author = {Flich, Jos{\'e} and Samuel Rodrigo {Mocholi} and Duato, Jose and S{\o}dring, Thomas and {\r A}shild Gr{\o}nstad {Solheim} and Skeie, Tor and Lysne, Olav},
	editor = {Pllana, Sabri}
}
@article {Simula.ND.277,
	title = {On the Potential of NoC Virtualization for Multicore Chips},
	journal = {Scalable Computing: Practice and Experience},
	volume = {9},
	number = {3},
	year = {2008},
	month = {September},
	pages = {165-177},
	abstract = {As the end of Moores-law is on the horizon, power becomes a limiting factor to continuous increases in performance gains for single-core processors. Processor engineers have shifted to the multicore paradigm and many-core processors are a reality. Within the context of these multicore chips, three key metrics point themselves out as being of major importance, performance, fault-tolerance (including yield), and power consumption. A solution that optimizes all three of these metrics is challenging. As the number of cores increases the importance of the interconnection network-on-chip (NoC) grows as well, and chip designers should aim to optimize these three key metrics in the NoC context as well. In this paper we identify and discuss the main properties that a NoC must exhibit in order to enable such optimizations. In particular, we propose the use of virtualization techniques at the NoC level. As a major finding, we identify the implementation of unicast and broadcast routing algorithms to become a key design parameter in order to achieve an effective virtualization of the chip. The intention behind this paper is for it to serve as a position paper on the topic of virtualization for NoC and the challenges that should be met at the routing layer in order to optimize performance, fault-tolerance and power consumption in multicore chips.},
	author = {Flich, Jos{\'e} and Samuel Rodrigo {Mocholi} and Duato, Jose and S{\o}dring, Thomas and {\r A}shild Gr{\o}nstad {Solheim} and Skeie, Tor and Lysne, Olav}
}
@inproceedings {Simula.ND.7,
	title = {Fast Proactive Recovery From Concurrent Failures},
	journal = {IEEE International Conference on Communications (ICC 2007)},
	year = {2007},
	month = {June},
	publisher = {IEEE},
	type = {Conference},
	abstract = {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.},
	isbn = {1-4244-0353-7},
	author = {Audun Fosselie {Hansen} and Lysne, Olav and Cicic, Tarik and Gjessing, Stein},
	editor = {IEEE, }
}
@inproceedings {Simula.ND.29,
	title = {How Can Multi-Topology Routing Be Used for Intradomain Traffic Engineering?},
	journal = {ACM SIGCOMM Workshop on Internet Network Management 2007},
	year = {2007},
	month = {August},
	publisher = {ACM sigcomm},
	type = {Workshop},
	abstract = {The concept of Multi-Topology routing allows each router in a network to maintain several valid routes to each destination. This increases the possibilities to spread traffic towards a destination over multiple paths with connectionless routing protocols like OSPF or IS-IS. In this paper, we report early ideas on how this can be utilized as a Traffic Engineering tool. We look at both offline and online approaches, and argue that a Multi-Topology based solution has advantages over previous solutions in both paradigms.},
	isbn = {unknown},
	author = {Kvalbein, Amund and Lysne, Olav}
}
@techreport {25342,
	title = {The Interconnection Network - Architectural Challenges for Utility Computing Data Centres},
	year = {2007},
	note = {This technical report is an earlier version of a published journal article. The published version can be found here:https://www.simula.no/publications/interconnection-network-architectural-challenges-utility-computing-data-centres},
	publisher = {Simula Research Laboratory},
	author = {Lysne, Olav and Reinemo, Sven-Arne and Skeie, Tor and {\r A}shild Gr{\o}nstad {Solheim} and S{\o}dring, Thomas and Lars Paul {Huse} and Bj{\o}rn Dag {Johnsen}}
}
@techreport {Simula.ND.24,
	title = {Robust Load Balancing Using Multi-Topology Routing},
	number = {2007-03},
	year = {2007},
	publisher = {Simula},
	abstract = {Current methods for traffic engineering with traditional link state routing protocols like OSPF and IS-IS are based on optimizing link weights to fit a given estimate of the traffic demands. These methods are not good at handling natural changes in the traffic over time. In this paper, we introduce new methods for IGP load balancing based on the upcoming standard for Multi-Topology routing. The main advantage of our approach is that it is far more robust to changes in the traffic demands. Our initial evaluations indicate that our method significantly reduces the chances of losing packets due to congestion.},
	author = {Kvalbein, Amund and Lysne, Olav}
}
@inproceedings {Simula.ND.25,
	title = {Routing-Contained Virtualization Based on Up*/Down* Forwarding},
	journal = {High Performance Computing - HiPC 2007},
	year = {2007},
	pages = {500-513},
	publisher = {Springer-Verlag},
	type = {Conference},
	edition = {4873},
	address = {Berlin Heidelberg},
	abstract = {Virtualization of computing resources is becoming increasingly important both in high-end servers and in multi-core CPUs. In a virtualized system, the set of resources that constitute a virtual compute entity should be spatially separated from each other. Dividing the cores on a chip, or the CPUs in a high end server into disjoint sets for each task is a trivial problem. Ensuring that they use disjoint parts of the interconnection network is, however, complex, and in existing methods the requirement of routing-containment of each virtual partition severely degrades the utilization of the system. In this paper, we present an allocation strategy that is based on Up*/Down* routing. Through simulations, we demonstrate increases (in some cases above 30\%) in system utilization relative to state-of- the-art in a Dimension Order routed mesh - a topology that is assumed to be widely deployed in Networks on Chip.},
	isbn = {978-3-540-77219-4},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and S{\o}dring, Thomas and Skeie, Tor and Jakob Aleksander {Libak}},
	editor = {Aluru et {al.}}
}
@inproceedings {Sem-jacobsen.2006.2,
	title = {Combining Source Routing and Dynamic Fault Tolerance},
	journal = {Proceedings of The 18{\textquoteright}th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)},
	year = {2006},
	month = {October},
	pages = {151-158},
	publisher = {IEEE Computer Society},
	type = {Conference},
	address = {Washington, DC, USA},
	abstract = {An increasing amount of current and emerging interconnect technologies rely on source routing to forward packets through the network. It is therefore important to develop methods for fault tolerance that are well suited for source routed networks. Dynamic fault tolerance allows the network to remain available through the occurrence of faults, as opposed to static fault tolerance which requires the network to be halted to reconfigure it. Source routing readily supports the source node choosing a different path when a fault occurs, but using this approach, packets already in the network will be lost. Local dynamic fault tolerance, where the packet is routed around the fault locally, would prevent much of the traffic being lost during failures, but this is cumbersome to achieve in source routed networks since packets encountering a fault will need to follow a path different from that encoded in the packet header. In this paper we present a mechanism to achieve local dynamic fault tolerance in source routed fat trees, a topology that has widespread use in supercomputer systems, and compare it with endpoint dynamic fault tolerance. We also show that by combining the two approaches we achieve performance superior to any of the two individually.},
	isbn = {0-7695-2704-3},
	author = {Frank Olaf {Sem-Jacobsen} and Lysne, Olav and Skeie, Tor},
	editor = {Alberto F. {De Souza} and Buyya, Rajkumar and Wagner {Meira, Jr.}}
}
@inproceedings {Sem-jacobsen.2006.1,
	title = {Dynamic Fault Tolerance With Misrouting in Fat Trees},
	journal = {Proceedings of the International Conference on Parallel Processing (ICPP)},
	year = {2006},
	month = {August},
	pages = {33-45},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Fault tolerance is critical for efficient utilisation of large computer systems. Dynamic fault tolerance allows the network to remain available through the occurance of faults as opposed to static fault tolerance which requires the network to be halted to reconfigure it. Although dynamic fault tolerance may lead to less efficient solutions than static fault tolerance, it allows for a much higher availability of the system. In this paper we devise a dynamic fault tolerant adaptive routing algorithm for the fat tree, a much used interconnect topology, which relies on misrouting around link faults. We show that we are guaranteed to tolerate any combination of less than (num\_switch\_ports/2) link faults without the need for additional network resources for deadlock freedom. There is also a high probability of tolerating an even larger number of link faults. Simulation results show that network performance degrades very little when faults are dynamically tolerated.},
	isbn = {22},
	author = {Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav and Duato, Jose},
	editor = {Feng, Wu-chi}
}
@inproceedings {Kvalbein.2006.1,
	title = {Fast IP Network Recovery Using Multiple Routing Configurations},
	journal = {INFOCOM 2006},
	year = {2006},
	month = {April},
	pages = {23-29},
	publisher = {IEEE},
	type = {Conference},
	address = {Barcelona, Spain},
	abstract = {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.},
	isbn = {1-4244-0222-0},
	author = {Kvalbein, Amund and Audun Fosselie {Hansen} and Cicic, Tarik and Gjessing, Stein and Lysne, Olav},
	editor = {Azcorra, Arturo and Touch, Joe and Zhang, Zhili}
}
@misc {Simula.simula.494,
	title = {Fremgangsm{\r a}te Og Innretning for Nettverkskonfigurering},
	year = {2006},
	author = {Lysne, Olav and Duato, Jose and Pinkston, T.}
}
@article {Theiss.2006.1,
	title = {FRoots, a Fault Tolerant and Topology Agnostic Routing Technique},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {17},
	number = {10},
	year = {2006},
	month = {October},
	pages = {1136-1150},
	abstract = {Existing solutions for fault tolerant routing in interconnection networks either work for only one given regular topology, or they require slow and costly network reconfigurations which cannot allow full and continuous network access. In this paper we present FRroots, a routing method for fault tolerance in topology-agnostic network technologies. Our method is based on redundant paths, and it can handle single dynamic faults without the need for sending control messages. In the fault-free networks under non-uniform traffic it performs comparable to, or even better than, topology specific and non-fault tolerant routing algorithms in regular networks like meshes and tori. FRoots does not require any other features in the switches than a flexible routing table, and a modest number of virtual channels. For that reason it can be directly applied to several present day technologies like InfiniBand and Advanced Switching.},
	author = {Ingebj{\o}rg Thelin The {Theiss} and Lysne, Olav}
}
@article {Petrini.2006.1,
	title = {High Performance Interconnects. Guest Editors Introduction},
	journal = {IEEE Micro},
	volume = {26},
	number = {3},
	year = {2006},
	month = {May/June},
	pages = {7-9},
	author = {Petrini, Fabrizio and Lysne, Olav and Brightwell, Ron}
}
@article {Lysne.2006.1,
	title = {Layered Routing in Irregular Networks},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {17},
	number = {1},
	year = {2006},
	month = {january},
	pages = {51-65},
	publisher = {IEEE},
	abstract = {Freedom from deadlock is a key issue in Cut-Through, Wormhole and Store and Forward networks, and such freedom is usually obtained through careful design of the routing algorithm. Most existing deadlock-free routing methods for irregular topologies do, however, impose severe limitations on the available routing paths. We present a method called Layered Routing, which gives rise to a series of routing algorithms, some of which perform considerably better than previous ones. Our method groups virtual channels into network layers, and to each layer it assigns a limited set of source/destination address pairs. This separation of traffic yields a significant increase in routing efficiency. We show how the method can be used to improve the performance of irregular networks, both through load balancing and by guaranteeing shortest-path routing. The method is simple to implement, and its application does not require any features in the switches other than the existence of a modest number of virtual channels. The performance of the approach is evaluated through extensive experiments within three classes of technologies. These experiments reveal a need for virtual channels as well as an improvement in throughput for each technology class.},
	author = {Lysne, Olav and Skeie, Tor and Reinemo, Sven-Arne and Ingebj{\o}rg Thelin {Theiss}}
}
@article {Reinemo.2006.2,
	title = {An Overview of QoS Capabilities in InfiniBand, Advanced Switching Interconnect, and Ethernet},
	journal = {IEEE Communications Magazine},
	volume = {44},
	number = {7},
	year = {2006},
	month = {july},
	pages = {32-38},
	publisher = {IEEE},
	abstract = {A recent trend in interconnection network technologies is the inclusion of various mechanisms to support a variety of Quality of Service concepts. This has been necessitated by an increasing number of application areas that require some level of performance guarantees from the network for parts of its traffic. In this paper we describe and compare the capabilities and support for Quality of Service of the three most important interconnection network technology standards of today. Equalities between the technologies are explained and differences are clarified.},
	author = {Reinemo, Sven-Arne and Skeie, Tor and S{\o}dring, Thomas and Lysne, Olav and T{\o}rudbakken, Ola}
}
@misc {Simula.ND.19,
	title = {The Realization of Virtual Compute Resources in a Utility Computing Data Center (UCDC) in the Many Core Era},
	howpublished = {2006 Workshop on On- and Off-Chip Interconnection Networks for Multicore Systems},
	year = {2006},
	author = {Lysne, Olav and Reinemo, Sven-Arne and Skeie, Tor and {\r A}shild Gr{\o}nstad {Solheim} and S{\o}dring, Thomas}
}
@article {Solheim.2006.1,
	title = {Routing for the ASI Fabric Manager},
	journal = {IEEE Communications Magazine},
	volume = {44},
	number = {7},
	year = {2006},
	month = {July},
	pages = {39-44},
	author = {{\r A}shild Gr{\o}nstad {Solheim} and Lysne, Olav and Skeie, Tor and S{\o}dring, Thomas and Ingebj{\o}rg Thelin {Theiss} and Johnsen, Ian}
}
@article {Gomez.2006.1,
	title = {A Routing Methodology for Achieving Fault Tolerance in Direct Networks},
	journal = {IEEE Transactions on Computers},
	volume = {55},
	number = {4},
	year = {2006},
	month = {April},
	pages = {400-415},
	abstract = {Massively parallel computing systems are being built with thousands of nodes. The interconnection network plays a key role for the performance of such systems. However, the high number of components significantly increases the probability of failure. Additionally, failures in the interconnection network may isolate a large fraction of the machine. It is therefore critical to provide an efficient fault-tolerant mechanism to keep the system running, even in the presence of faults. This paper presents a new fault-tolerant routing methodology that does not degrade performance in the absence of faults and tolerates a reasonably large number of faults without disabling any healthy node. In order to avoid faults, for some source-destination pairs, packets are first sent to an intermediate node and then from this node to the destination node. Fully adaptive routing is used along both subpaths. The methodology assumes a static fault model and the use of a checkpoint/restart mechanism. However, there are scenarios where the faults cannot be avoided solely by using an intermediate node. Thus, we also provide some extensions to the methodology. Specifically, we propose disabling adaptive routing and/or using misrouting on a per-packet basis. We also propose the use of more than one intermediate node for some paths. The proposed fault-tolerant routing methodology is extensively evaluated in terms of fault tolerance, complexity, and performance.},
	author = {Maria Engracia {G{\'o}mez} and Nils Agne {Nordbotten} and Flich, Jos{\'e} and Lopez, Pedro and Robles, Antonio and Duato, Jose and Skeie, Tor and Lysne, Olav}
}
@inproceedings {Mora.2006.1,
	title = {Towards and Efficient Switch Architecture for High-Radix Switches},
	journal = {ACM/IEEE Symposium on Architectures for Networking and Communications Systems},
	year = {2006},
	month = {December},
	pages = {11-20},
	publisher = {ACM Press},
	type = {Conference},
	isbn = {1-59593-580-0},
	author = {Mora, Gaspar and Flich, Jos{\'e} and Duato, Jose and Lopez, Pedro and Lysne, Olav},
	editor = {Dubois, Michel and Eatherton, Will}
}
@inproceedings {Cicic.2005.2,
	title = {Applicability of Resilient Routing Layers for K-Fault Network Recovery},
	journal = {Proceedings of International Conference on Networking (ICN), Reunion, France April 17-21},
	year = {2005},
	note = {ISSN 0302-9743, ISBN 3-540-25339-4,},
	pages = {173-183},
	publisher = {Springer-Verlag GmbH},
	type = {1},
	edition = {Vol. 3421},
	abstract = {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.},
	author = {Cicic, Tarik and Audun Fosselie {Hansen} and Gjessing, Stein and Lysne, Olav}
}
@techreport {Hansen.2005.6,
	title = {A Comparison of Different Approaches for Calculating Resilient Routing Layers and Multiple Routing Configurations},
	number = {2005-15},
	year = {2005},
	month = {September},
	publisher = {Simula Research Laboratory},
	abstract = {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.},
	author = {Audun Fosselie {Hansen} and Kvalbein, Amund and Cicic, Tarik and Gjessing, Stein and Lysne, Olav}
}
@inproceedings {Sem-jacobsen.2005.2,
	title = {A Dynamic Fault-Torlerant Routing Algorithm for Fat-Trees},
	journal = {International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, USA, June 27-30},
	year = {2005},
	pages = {318-324},
	publisher = {CSREA Press},
	type = {Conference},
	abstract = {The fat tree is a network topology well suited for use as the interconnection network in systems such as parallel computers. Its large number of paths between every source/destination pair gives the fat tree the ability to provide high throughput. This also gives it a high probability of tolerating network faults statically, but few algorithms to dynamically tolerate faults in fattrees have previously been proposed. In this paper we present a deadlock free routing method for providing dynamic fault tolerance through misrouting downwards in the network. We show that the algorithm is one fault-tolerant, and that it with a certain probability can tolerate a large number of faults.},
	isbn = {1-932415-58-0},
	author = {Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav},
	editor = {Hamid R. {Arabnia}}
}
@inproceedings {Hansen.2005.3,
	title = {Fast, Effective and Stable IP Recovery Using Resilient Routing Layers},
	journal = {The 19th International Teletraffic Congress (ITC19) Beijing, China},
	year = {2005},
	note = {ISBN 7-5635-1141-5},
	month = {August},
	pages = {1631-1640},
	publisher = {Beijing University of Posts and Telecommunications Press},
	type = {1},
	abstract = {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.},
	author = {Audun Fosselie {Hansen} and Kvalbein, Amund and Cicic, Tarik and Gjessing, Stein and Lysne, Olav and Jensen, Terje and Olav Norvald {{\O}sterb{\o}}},
	editor = {Liang, Xiongjian and Xin, Zhanhong and V. B. {Iversen} and G. S. {Kuo}}
}
@inproceedings {Kvalbein.2005.1,
	title = {Fast Recovery From Link Failures Using Resilient Routing Layers},
	journal = {10th IEEE Symposium on Computers and Communications (ISCC 2005)},
	year = {2005},
	note = {ISSN 1530-1346, ISBN 0-7695-2373-0},
	month = {June},
	pages = {554-560},
	publisher = {IEEE Communications Society},
	type = {1},
	address = {Cartagena, Spain, June 27-30},
	abstract = {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.},
	author = {Kvalbein, Amund and Audun Fosselie {Hansen} and Cicic, Tarik and Gjessing, Stein and Lysne, Olav}
}
@article {Lysne.2005.2,
	title = {A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {16},
	number = {5},
	year = {2005},
	month = {May},
	pages = {428-443},
	publisher = {IEEE},
	abstract = {Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches either require virtual channels in the network or they work only for a limited set of routing algorithms and/or fault patterns. In this paper, we present a methodology for devising deadlock free and dynamic transitions between old and new routing functions that is consistent with recently proposed theory. The methodology is independent of topology, can be applied to any deadlock-free routing function, and puts no restrictions on the routing function changes that can be supported. Furthermore, it does not require any virtual channels to guarantee deadlock freedom. This research is motivated by current trends toward using increasingly larger Internet and transaction processing servers based on clusters of PCs that have very high availability and dependability requirements, as well as other local, system, and storage area network-based computing systems.},
	isbn = {1045-9219},
	doi = {10.1109/TPDS.2005.59},
	author = {Lysne, Olav and Timothy Mark {Pinkston} and Duato, Jose}
}
@inproceedings {Hansen.2005.4,
	title = {Resilient Routing Layers: an Overview of Technology and Applications},
	journal = {EURO NGI Workshop on Traffic Engineering, Protection and Restoration, Rome April 18-20},
	year = {2005},
	month = {April},
	publisher = {EuroNGI},
	type = {1},
	abstract = {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.},
	author = {Audun Fosselie {Hansen} and Kvalbein, Amund and Cicic, Tarik and Gjessing, Stein and Lysne, Olav}
}
@inproceedings {Hansen.2005.1,
	title = {Resilient Routing Layers for Recovery in Packet Networks},
	journal = {International Conference on Dependable Systems and Networks (DSN 2005) Yokohama, Japan, June 28-July 1},
	year = {2005},
	note = {ISBN 0-7695-2282-3},
	month = {June},
	publisher = {IEEE Computer Society},
	type = {1},
	abstract = {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 {\textquotedblleft}safe layer{\textquotedblright}, 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.},
	author = {Audun Fosselie {Hansen} and Kvalbein, Amund and Cicic, Tarik and Gjessing, Stein and Lysne, Olav},
	editor = {Werner, Bob}
}
@inproceedings {Sem-jacobsen.2005.1,
	title = {Siamese-Twin: a Dynamically Fault-Tolerant Fat Tree},
	journal = {International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado, USA, April 4-8},
	year = {2005},
	publisher = {IEEE Computer Society},
	type = {Conference},
	abstract = {Fat-trees are a special case of multistage interconnection networks with quite good static fault tolerance capabilities. They are however straightforwardly unable to provide local dynamic fault tolerance. In this paper we propose a network topology based on the fat-tree using two parallel networks with crossover links between them in an effort to enable dynamic fault tolerance. We evaluate and compare this topology with two other similar fat-tree topologies and show through simulations that the new topology is able to improve slightly upon the ability to tolerate faults statically. More importantly, we show that the new network topology is the only one of the evaluated topologies able to tolerate one fault dynamically, with a superior network performance in the face of dynamically handled faults.},
	isbn = {0-7695-2312-9},
	author = {Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav and T{\o}rudbakken, Ola and Rongved, Eivind and Bj{\o}rn Dag {Johnsen}}
}
@article {Duato.2005.1,
	title = {A Theory for Deadlock-Free Dynamic Network Reconfiguration},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {16},
	number = {5},
	year = {2005},
	month = {May},
	pages = {412-427},
	abstract = {This paper develops theoretical support useful for determining deadlock properties of dynamic network reconfiguration techniques and serves as a basis for the development of design methodologies useful for deriving such techniques. It is applicable to interconnection networks typically used in multiprocessor servers, network-based computing clusters and distributed storage systems, and also has potential application to system-on-chip networks. This theory builds on basic principles established by previous theories while pioneering new concepts fundamental to the case of dynamic reconfiguration.},
	author = {Duato, Jose and Lysne, Olav and Pang, Ruoming and Timothy Mark {Pinkston}}
}
@inproceedings {ND.5.Sem-Jacobsen.2004,
	title = {Achieving Flow Level QoS in Cut-Through Networks Through Admission Control and DiffServ},
	journal = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA)},
	year = {2004},
	month = {June 21-24},
	pages = {1084-1090},
	publisher = {CSREA Press},
	type = {1},
	address = {Las Vegas, Nevada},
	abstract = {Cluster networks will serve as the future access networks for multimedia streaming, massive multiplayer online gaming, e-commerce, network storage etc. And for those application areas provisioning of Quality of Service (QoS) is becoming and important issue. DiffServ as specified by the IETF is foreseen to be the most prominent concept for providing predictability in the future Internet. To enable seamless interoperation with the higher level IETF concepts the QoS architecture of the lower layers should comply with the DiffServ paradigm as well. Previous work on predictability in cut-through networks has only studied class based QoS. In this paper we set out to achieve flow level QoS using flow aware admission control in combination with a flow negligent DiffServ inspired QoS mechanism. Our results show that flow level bandwidth guarantees are achievable with the use of the Link-by-Link and the Probe based schemes. In addition we are able to achieve an order of magnitude improvement in jitter and latency in individual flows.},
	author = {Frank Olaf {Sem-Jacobsen} and Reinemo, Sven-Arne and Skeie, Tor and Lysne, Olav},
	editor = {Hamid R. {Arabnia}}
}
@inproceedings {ND.5.Gomez.2004,
	title = {An Effective Fault-Tolerant Routing Methodology for Direct Networks},
	journal = {Proceedings of International Conference on Parallel Processing},
	year = {2004},
	month = {August 15-18},
	pages = {222-231},
	publisher = {IEEE Computer Society Press},
	type = {1},
	abstract = {Current massively parallel computing systems are being built with thousands of nodes, which significantly affect the probability of failure. M. E. Gomex proposed a methodology to design fault-tolerant routing algorithms for direct interconnection networks. The methodology uses a simple mechanism: for some source-destination pairs, packets are first forwarded to an intermediate node, and later, from this node to the destination node. Minimal adaptive routing is used along both subpaths. For those cases where the methodology cannot find a suitable intermediate node, it combines the use of intermediate nodes with two additional mechanisms: disabling adaptive routing and using misrouting on a per-packet basis. While the combination of these three mechanisms tolerates a large number of faults, each one requires adding some hardware support in the network and also introduces some overhead. In this paper, we perform an in-depth detailed analysis of the impact of these mechanisms on network behaviour. We analyze the impact of the three mechanisms separately and combined. The ultimate goal of this paper is to obtain a suitable combination of mechanisms that is able to meet the trade-off between fault-tolerance degree, routing complexity, and performance.},
	author = {M. E. {G{\'o}mez} and Flich, J. and Lopez, Pedro and Robles, Antonio and Duato, J. and N. A. {Nordbotten} and Lysne, Olav and Skeie, Tor}
}
@article {ND.4.Gomez.2004,
	title = {An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori},
	journal = {IEEE Computer Architecture Letters},
	volume = {3},
	year = {2004},
	month = {May},
	pages = {3},
	publisher = {IEEE},
	abstract = {In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. The methodology is mainly based on the selection of an intermediate node (if needed) for each source-destination pair. Packets are adaptively routed to the intermediate node and, at this node, without being ejected, they are adaptively forwarded to their destinations. In order to allow deadlock-free minimal adaptive routing, the methodology requires only one additional virtual channel (for a total of three), even for tori. Evaluation results for a 4x4x4 torus network show that the methodology is 5-fault tolerant. Indeed, for up to 14 link failures, the percentage of fault combinations supported is higher than 99.96\%. Additionally, network throughput degrades by less than 10\% when injecting three random link faults without disabling any node. In contrast, a mechanism similar to the one proposed in the BlueGene/L, that disables some network planes, would strongly degrade network throughput by 79\%.},
	doi = {10.1109/L-CA.2004.1},
	author = {M. E. {G{\'o}mez} and Duato, J. and Flich, J. and Lopez, Pedro and Robles, Antonio and N. A. {Nordbotten} and Lysne, Olav and Skeie, Tor}
}
@inproceedings {ND.5.Horn.2004,
	title = {The Existence of a Network of Fixed-Sized Switches That Satisfies Any Communication Needs},
	journal = {The 2004 International Conference},
	year = {2004},
	pages = {1056-1062},
	publisher = {CSREA Press},
	type = {1},
	address = {Las Vegas, Nevada, USA},
	author = {Horn, G. and Lysne, Olav and Skeie, Tor}
}
@inproceedings {ND.5.Nordbotten.2004,
	title = {A Fully Adaptive Fault-Tolerant Routing Methodology Based on Intermediate Nodes},
	journal = {Proceedings of IFIP International Conference on Network and Parallel Computing},
	year = {2004},
	month = {October 18-20},
	pages = {341-356},
	publisher = {Springer-Verlag},
	type = {1},
	abstract = {Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the presence of failures. Interconnection networks play a key-role in these systems, and this paper proposes a fault-tolerant routing methodology for use in such networks. The methodology supports any minimal routing function (including fully adaptive routing), does not degrade performance in the absence of faults, does not disable any healthy node, and is easy to implement both in meshes and tori. In order to avoid network failures, the methodology uses a simple mechanism: for some source-destination pairs, packets are forwarded to the destination node through a set of intermediate nodes (without being ejected from the network). The methodology is shown to tolerate a large number of faults (e.g., five/nine faults when using two/three intermediate nodes in a 3D torus). Furthermore, the methodology offers a gracious performance degradation: in an 8 {\texttimes} 8 {\texttimes} 8 torus network with 14 faults the throughput is only decreased by 6.49\%.},
	author = {N. A. {Nordbotten} and M. E. {G{\'o}mez} and Flich, J. and Lopez, Pedro and Robles, Antonio and Skeie, Tor and Lysne, Olav and Duato, J.}
}
@misc {ND.8.Musunoori.2004.d,
	title = {The Interconnection Network: Architectural Challenges for Datacenters in the Computational GRID},
	howpublished = {Presented at the eVITA Workshop},
	year = {2004},
	note = {Presented at the eVITA Workshop on eScience and Applications},
	month = {October 12-13},
	author = {Lysne, Olav and Skeie, Tor and Theiss, I. and Bj{\o}rn Dag {Johnsen} and Rognved, E. and T{\o}rudbakken, O.}
}
@inproceedings {ND.5.Skeie.2004,
	title = {LASH-TOR: a Generic Transition-Oriented Routing Algorithm},
	journal = {Proceedings of the IEEE International Conference on Parallel and Distributed Systems (ICPADS)},
	year = {2004},
	pages = {595-604},
	publisher = {IEEE Computer Society Press},
	type = {1},
	author = {Skeie, Tor and Lysne, Olav and Flich, J. and Lopez, Pedro and Robles, Antonio and Duato, J.}
}
@inproceedings {ND.5.Theiss.2004,
	title = {LORE - Local Reconfiguration for Fault Management in Irregular Interconnects},
	journal = {International Parallel and Distributed Processing Symposium},
	year = {2004},
	publisher = {IEEE Computer Society Press},
	type = {1},
	author = {Theiss, I. and Lysne, Olav}
}
@misc {Hansen.2004.1,
	title = {A Method for Recovery in Packet Networks},
	howpublished = {Norwegian Network Research Seminar 2004},
	year = {2004},
	note = {The same content as the Simula Technical Report 2004-13},
	month = {October},
	author = {Audun Fosselie {Hansen} and Cicic, Tarik and Gjessing, Stein and Lysne, Olav}
}
@inproceedings {ND.5.Gomez.2004.b,
	title = {A New Adaptive Fault-Tolerant Routing Methodology for Direct Networks},
	journal = {Proceedings of the International Conference on High Performance Computing},
	year = {2004},
	month = {December 19-22},
	pages = {462-473},
	publisher = {Springer-Verlag},
	type = {1},
	abstract = {Interconnection networks play a key role in the fault tolerance of massively parallel computers, since faults may isolate a large fraction of the machine containing many healthy nodes. In this paper, we present a methodology to design fully adaptive fault-tolerant routing algorithms for direct interconnection networks that can be applied to different regular topologies. The methodology is mainly based on the selection of an intermediate node (if needed) for each source-destination pair. Packets are adaptively routed to the intermediate node and, from this node, they are adaptively forwarded to their destination. This methodology requires only one additional virtual channel, even for tori. Evaluation results show that the methodology is 7-fault tolerant, and for up to 14 faults, more than 99\% of the combinations are tolerated, also without significantly degrading performance in the presence of faults.},
	author = {M. E. {G{\'o}mez} and Duato, J. and Flich, J. and Lopez, Pedro and Robles, Antonio and N. A. {Nordbotten} and Skeie, Tor and Lysne, Olav}
}
@techreport {ND.7.Hansen.2004,
	title = {Resilient Routing Layers: a Simple and Flexible Approach for Resilience in Packet Networks},
	number = {2004-13},
	year = {2004},
	note = {This report has later been updated and refined as "Resilient Routing Layers for Recovery in Packet Networks".},
	publisher = {Simula Research Laboratory},
	author = {Audun Fosselie {Hansen} and Cicic, T. and Gjessing, Stein and Lysne, Olav}
}
@inproceedings {Lysne.2004.1,
	title = {Simple Deadlock-Free Dynamic Network Reconfiguration},
	journal = {High Performance Computing - HiPC 2004: 11th International Conference, Bangalore, India, December 19-22, 2004},
	year = {2004},
	month = {December},
	pages = {504-515},
	publisher = {Springer Verlag},
	type = {1},
	author = {Lysne, Olav and Jose Miguel {Montanana} and Timothy Mark {Pinkston} and Duato, Jose and Skeie, Tor and Flich, Jos{\'e}},
	editor = {Victor Prasanna L {Bouge}}
}
@inproceedings {ND.5.Gjessing.2004,
	title = {The Vine Project: Towards Predictable Communication in Heterogeneous Networks},
	journal = {Proceedings of the 3rd International Conference on Networking (ICN{\textquoteright}04)},
	year = {2004},
	month = {February 29 - March 4},
	pages = {830-837},
	publisher = {IEEE Computer Society Press},
	type = {1},
	address = {Guadeloupe, French Caribbean},
	author = {Gjessing, Stein and Lysne, Olav and Audun Fosselie {Hansen} and Kvalbein, Amund}
}
@inproceedings {ND.5.Reinemo.2003.b,
	title = {Admission Control for DiffServ Based Quality of Service in Cut-Through Networks},
	journal = {Proceedings of the 10th International Conference on High Performance Computing (HiPC 2003)},
	year = {2003},
	month = {December 17-20},
	pages = {118-129},
	publisher = {Springer},
	type = {1},
	address = {Heidelberg},
	abstract = {Previous work on Quality of Service in Cut-through networks shows that resource reservation mechanisms are only effective below the saturation point. Admission control in these networks will therefore need to keep network utilization below the saturation point, while still utilising the network resources to the maximum extent possible. In this paper we propose and evaluate three admission control schemes. Two of these use a centralised bandwidth broker, while the third is a distributed measurement based approach. We combine these admission control schemes with a DiffServ based QoS scheme for virtual cut-through networks to achieve class based bandwidth and latency guarantees. Our simulations show that the measurement based approach favoured in the Internet communities performs poorly in cut-through networks. Furthermore it demonstrates that detailed knowledge on link utilization improves performance significantly.},
	author = {Reinemo, Sven-Arne and Frank Olaf {Sem-Jacobsen} and Skeie, Tor and Lysne, Olav},
	editor = {Timothy Mark {Pinkston} and Viktor K. {Prasanna}}
}
@inproceedings {ND.5.Reinemo.2003.a,
	title = {Applying the DiffServ Model on Cut-Through Networks},
	journal = {Proceedings of the 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA2003)},
	year = {2003},
	month = {June 23 - 26},
	pages = {1089-1095},
	publisher = {CSREA Press},
	type = {1},
	address = {Las Vegas, Nevada},
	abstract = {Understanding the nature of traffic in high-speed communication systems is essential for achieving QoS in these networks. A first step towards this goal is understanding how basic QoS mechanisms work and affects the network predictability before we introduce more complex mechanisms such as admission control. In this paper we analyse the effect of a DiffServ inspired QoS concept applied to virtual cut-through networks. The main findings from our study are that (i) throughput differentiation can be achieved by weighting of virtual lanes (VL) and by classifying VLs as either low or high priority, (ii) the balance between VL weighting and VL load is not crucial when the network is operating below the saturation point, (iii) jitter, however, is large and good jitter characteristics seems unachievable with such a relative scheme.},
	author = {Reinemo, Sven-Arne and Skeie, Tor and Lysne, Olav},
	editor = {Arabnia, H.R. and Mun, Youngsong}
}
@inproceedings {ND.5.Horn.2003,
	title = {A Criterion for Cost Optimal Construction of Irregular Networks},
	journal = {IPDPS{\textquoteright}03: 17th International Parallel and},
	year = {2003},
	note = {Workshop on Communication Architecture for Clusters (D. K. Panda, J. Duato and C. Stunkel eds.)},
	publisher = {IEEE},
	type = {1},
	address = {Nice, France},
	author = {Horn, G. and Lysne, Olav and Skeie, Tor},
	editor = {Cosnard, Michel and Gottlieb, Allan and Jack, }
}
@techreport {ND.7.Eide.2003,
	title = {Extending Content-Based Publish/Subscribe Systems With Multicast Support},
	number = {2003-03},
	year = {2003},
	publisher = {Simula Research Laboratory},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Lysne, Olav and Granmo, Ole-Christoffer}
}
@inproceedings {ND.5.Theiss.2003,
	title = {FROOTS - Fault Handling in Up*/Down* Routed Networks With Multiple Roots},
	journal = {Proceedings of the International Conference on High Performance Computing HiPC},
	year = {2003},
	publisher = {Springer-Verlag},
	type = {1},
	author = {Theiss, I. and Lysne, Olav}
}
@misc {SC.8.Daehlen.2003.b,
	title = {Internett Og Trafikkork},
	howpublished = {Sommer{\r a}pent, NRK, 2. Juli},
	year = {2003},
	author = {D{\ae}hlen, Morten and Lysne, Olav}
}
@techreport {ND.7.Lysne.2003,
	title = {A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Proceses},
	number = {10},
	year = {2003},
	publisher = {Simula Research Laboratory},
	author = {Lysne, Olav and Duato, J. and Pinkston, T.}
}
@inproceedings {ND.5.Lysne.2003,
	title = {A Methodology for Developing Dynamic Network Reconfiguration Processes},
	journal = {Proceedings of the 2003 International Conference on Parallel Processing},
	year = {2003},
	pages = {77-86},
	publisher = {IEEE Computer Society},
	type = {1},
	author = {Lysne, Olav and Pinkston, T. and Duato, J.}
}
@inproceedings {ND.5.Eide.2003,
	title = {Supporting Timeliness and Accuracy in Real-Time Content-Based Video Analysis},
	journal = {Proceedings of the 11th ACM International Conference on Multimedia},
	year = {2003},
	month = {November 2 - 8},
	pages = {21-32},
	publisher = {ACM},
	type = {1},
	address = {Berkeley, California, USA},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Granmo, Ole-Christoffer and Lysne, Olav}
}
@inproceedings {ND.5.Granmo.2003,
	title = {Techniques for Parallel Execution of the Particle Filter},
	journal = {Proceedings of Scandinavian Conference on Image Analysis (SCIA 2003)},
	year = {2003},
	publisher = {Springer-Verlag},
	type = {1},
	author = {Granmo, Ole-Christoffer and Eliassen, Frank and Lysne, Olav and Viktor S. Wold {Eide}}
}
@inproceedings {ND.5.Skeie.2002.c,
	title = {Evaluation of Minimal Deterministic Routing in Irregular Networks},
	journal = {Proceedings of the SSGRR International Conference on Infrastructure for e-Business, e-education, e-Science, and e-Medicine (SSGRR)},
	year = {2002},
	type = {1},
	author = {Skeie, Tor and Theiss, I. and Lysne, Olav}
}
@inproceedings {ND.5.Skeie.2002.a,
	title = {Layered Shortest Path (LASH) Routing in Irregular System Area Networks},
	journal = {Proceedings of Communication Architecture for Clusters (CAC{\textquoteright}02)},
	year = {2002},
	publisher = {IEEE Computer Society},
	type = {1},
	author = {Skeie, Tor and Lysne, Olav and Theiss, I.}
}
@inproceedings {ND.5.Theiss.2002,
	title = {Minimal Routing in Irregular Networks},
	journal = {Proceedings of the International Conference on Communications in Computing (CIC)},
	year = {2002},
	publisher = {CSREA Press},
	type = {1},
	author = {Theiss, I. and Skeie, Tor and Lysne, Olav}
}
@inproceedings {ND.5.Eide.2002.a,
	title = {Real-Time Processing of Media Streams: a Case for Event-Based Interaction},
	journal = {Proceedings of 1st International Workshop on Distributed Event-Based Systems (DEBS{\textquoteright}02), IEEE},
	year = {2002},
	note = {ISBN 0-7695-1588-6},
	month = {July 2nd and 3rd},
	pages = {555-562},
	type = {1},
	address = {Vienna, Austria},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Lysne, Olav and Granmo, Ole-Christoffer}
}
@inproceedings {ND.5.Eide.2002.b,
	title = {Scalable Independent Multi-Level Distribution in Multimedia Content Analysis},
	journal = {Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems (IDMS/PROMS 2002)},
	year = {2002},
	note = {ISBN 3-540-00169-7},
	month = {November 26th - 29th},
	pages = {37-48},
	publisher = {Springer-Verlag},
	type = {1},
	address = {Coimbra, Portugal},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Granmo, Ole-Christoffer and Lysne, Olav}
}
@inproceedings {ND.5.Pinkston.2002,
	title = {Theoretical Support for Dynamic Network Reconfiguration},
	journal = {Proceedings of the ICS Workshop on Self-Healing, Adaptive and Self-Managed Systems (SHAMAN)},
	year = {2002},
	month = {June},
	publisher = {ACM Press},
	type = {1},
	author = {Pinkston, T. and Duato, J. and Lysne, Olav and Pang, R.}
}
@article {ND.4.Krogdahl.2002,
	title = {On Verification of Parallel Message-Passing Processes},
	journal = {Formal Aspects of Computing},
	volume = {13},
	number = {6},
	year = {2002},
	pages = {471-492},
	publisher = {Springer},
	author = {Krogdahl, Stein and Lysne, Olav}
}
@inproceedings {ND.5.Granmo.2001,
	title = {Dynamic Object-Oriented Bayesian Networks for Flexible Resource-Aware Content-Based Indexing of Media Streams},
	journal = {12th Scandinavian Conference on Image Analysis (SCIA2001)},
	year = {2001},
	month = {June},
	type = {1},
	address = {Bergen},
	author = {Granmo, Ole-Christoffer and Eliassen, Frank and Lysne, Olav}
}
@inproceedings {ND.5.Lysne.2001,
	title = {Load Balancing of Irregular System Area Networks Through Multiple Roots},
	journal = {Proceedings of the International Conference on Communication in Computing, CIC 2001},
	year = {2001},
	pages = {165-171},
	publisher = {CSREA Press},
	type = {1},
	author = {Lysne, Olav and Skeie, Tor}
}
@inproceedings {ND.5.Eide.2001,
	title = {Supporting Distributed Processing of Time-Based Media Streams},
	journal = {Proceedings of Distributed Objects and Applications (DOA{\textquoteright}01), IEEE},
	year = {2001},
	month = {September},
	pages = {281-288},
	type = {1},
	address = {Rome, Italy},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Lysne, Olav}
}
@inproceedings {ND.5.Reinemo.2001,
	title = {Topologies and Routing in Gigabit Switching Fabrics},
	journal = {Proceedings of 2nd International Conference on Communications in Computing (CIC2001)},
	year = {2001},
	month = {June 25 - 28},
	pages = {142-149},
	publisher = {CSREA Press},
	type = {1},
	address = {Las Vegas, Nevada},
	abstract = {Cluster networks will serve as the future access networks for multimedia streaming, massive multiplayer online gaming, e-commerce, network storage etc. And for those application areas provisioning of Quality of Service (QoS) is becoming and important issue. DiffServ as specified by the IETF is foreseen to be the most prominent concept for providing predictability in the future Internet. To enable seamless interoperation with the higher level IETF concepts the QoS architecture of the lower layers should comply with the DiffServ paradigm as well. Previous work on predictability in cut-through networks has only studied class based QoS. In this paper we set out to achieve flow level QoS using flow aware admission control in combination with a flow negligent DiffServ inspired QoS mechanism. Our results show that flow level bandwidth guarantees are achievable with the use of the Link-by-Link and the Probe based schemes. In addition we are able to achieve an order of magnitude improvement in jitter and latency in individual flows.},
	author = {Reinemo, Sven-Arne and Dobinson, B. and Haas, S. and Lysne, Olav and Martin, B. and Skeie, Tor},
	editor = {Abdullah Abonamah B {d{\textquoteright}Auriol} and Al-Ayyoub, Abdel-Elah}
}
@inproceedings {ND.5.Manzke.2001,
	title = {Tuning and Verification of Simulation Models for High Speed Interconnect Fabrics},
	journal = {Proceedings of PDPTA},
	year = {2001},
	type = {1},
	address = {Las Vegas (USA)},
	author = {Manzke, M. and Kenny, S. and Coghlan, B. and Lysne, Olav}
}
@inproceedings {ND.5.Theiss.2000,
	title = {Deadlock Avoidance for Wormhole Based Switches},
	journal = {Proceedings of Euro-Par 2000},
	year = {2000},
	pages = {890-899},
	publisher = {Springer-Verlag},
	type = {1},
	author = {Theiss, I. and Lysne, Olav}
}
@inproceedings {ND.6.Eide.2000,
	title = {Distributed Journaling of Distributed Media},
	journal = {Proceedings of Norsk Informatikkonferanse (NIK)},
	year = {2000},
	month = {November,},
	type = {1},
	address = {Bod{\o}, Norway},
	author = {Viktor S. Wold {Eide} and Eliassen, Frank and Granmo, Ole-Christoffer and Lysne, Olav}
}
@techreport {ND.7.Granmo.2000,
	title = {Dynamic Object-Oriented Bayesian Networks and Particle Filters for Flexible Resource-Aware Content-Based Indexing of Media Streams},
	number = {290},
	year = {2000},
	publisher = {Department of Informatics, University of Oslo},
	author = {Granmo, Ole-Christoffer and Eliassen, Frank and Lysne, Olav}
}
@inproceedings {ND.5.Lysne.2000.a,
	title = {Fast Dynamic Reconfiguration in Irregular Networks},
	journal = {Proceedings of the 2000 International Conference of Parallel Processing},
	year = {2000},
	publisher = {IEEE Computer Society},
	type = {1},
	address = {Toronto (Canada),},
	author = {Lysne, Olav and Duato, J.}
}
@inproceedings {ND.5.Lysne.2000.b,
	title = {Fault Tolerant Routing in SCI},
	journal = {Proceedings of SCI Europe{\textquoteright}2000},
	year = {2000},
	pages = {79-85},
	type = {1},
	address = {Munich (Germany),},
	author = {Lysne, Olav and Tangen, S.}
}
@misc {ND.7.LYSNE.2000.b,
	title = {Scalability Simulation of Detexis{\textquoteright} Torus Network},
	howpublished = {SCI-Europe Deliverable D.2.3.5 - project report},
	year = {2000},
	author = {Lysne, Olav and Tangen, S.}
}
@inproceedings {ND.5.Lysne.1999,
	title = {Deadlock Avoidance for Switches Based on Wormhole Networks},
	journal = {Proceedings of the 1999 International Conference of Parallel Processing},
	year = {1999},
	pages = {68-74},
	publisher = {IEEE Computer Society},
	type = {1},
	address = {Aizu-Wakamatsu (Japan),},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.Roenneberg.1999,
	title = {Evaluation and Suggested Improvements for the SCI Flow Control},
	journal = {Proceedings of SCI Europe{\textquoteright}99},
	year = {1999},
	note = {ISBN 82-14-00014-9},
	month = {2-3 September},
	pages = {101-112},
	type = {1},
	address = {Toulouse, France},
	author = {R{\o}nneberg, G. and Horn, G. and Lysne, Olav},
	editor = {Horn, G. and Karl, W.}
}
@misc {ND.8.Lysne.1999,
	title = {Forvirring Og Fremtidsfrykt},
	howpublished = {Kronikk i Aftenposten, 17. February},
	year = {1999},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.Lysne.1999.b,
	title = {An OPNET-Based Simulation Model of SCI-Nodes},
	journal = {Conference Proceedings of SCI Europe{\textquoteright}99},
	year = {1999},
	pages = {101-112},
	type = {1},
	address = {Toulouse (France),},
	author = {R{\o}nneberg, G. and Lysne, Olav}
}
@misc {ND.7.LYSNE.1999.b,
	title = {SCI-Components Specification for the Simulator},
	howpublished = {SCI-Europe Deliverable D.2.3.2 - project report},
	year = {1999},
	author = {R{\o}nneberg, G. and Lysne, Olav and Theiss, I.}
}
@techreport {ND.7.LYSNE.1999,
	title = {On Verification of Parallel and Interleaved Executions},
	number = {277},
	year = {1999},
	publisher = {Department of Informatics, University of Oslo},
	author = {Krogdahl, O. and Lysne, Olav}
}
@techreport {ND.7.LYSNE.1998,
	title = {Adapting to Faults in Deterministic Wormhole Networks},
	number = {260},
	year = {1998},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav and Skeie, Tor}
}
@article {ND.4.LYSNE.1998,
	title = {One-Fault Tolerance and Beyond in Wormhole Routed Meshes},
	journal = {Microprocessors and Microsystems},
	volume = {21},
	year = {1998},
	pages = {471-481,},
	publisher = {Elsevier},
	author = {Lysne, Olav and Skeie, Tor and Waadeland, Thomas}
}
@inproceedings {ND.5.Horn.1998,
	title = {Switched SCI Systems},
	journal = {Proceedings of SCI Europe{\textquoteright}98},
	year = {1998},
	note = {ISBN 1-901864-02-2},
	month = {29-30 September},
	pages = {13-24},
	type = {1},
	address = {Bordeaux, France},
	author = {Horn, G. and Theiss, I. and Lysne, Olav and Skeie, Tor},
	editor = {Hellwagner, H. and Reinefeld, A.}
}
@article {ND.4.LYSNE.1998.c,
	title = {Towards an Analytical Model of Wormhole Routing Networks},
	journal = {Microprocessors and Microsystems},
	volume = {21},
	year = {1998},
	pages = {491-498,},
	publisher = {Elsevier},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.Skeie.1997,
	title = {Scalable Non-Blocking Networks With Fixed Size Routers},
	journal = {Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA{\textquoteright}97)},
	year = {1997},
	pages = {1308-1314,},
	type = {1},
	author = {Skeie, Tor and Lysne, Olav and Horn, G.}
}
@article {ND.4.Krogdahl.1997,
	title = {Verifying a Distributed List System: a Case History},
	journal = {Formal Aspects of Computing},
	volume = {9},
	year = {1997},
	pages = {98-118,},
	author = {Krogdahl, Stein and Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1996,
	title = {Constructing SCI-Configurations That Are Free From Deadlocks},
	journal = {Proceedings of The Fifth International Workshop on SCI-based High-performance Low-Cost Computing},
	year = {1996},
	pages = {55-62},
	type = {1},
	address = {Santa Clara (California),},
	author = {Lysne, Olav and Gjessing, Stein}
}
@inproceedings {ND.5.Lysne.1995.c,
	title = {Higher Order Proof by Consistency},
	journal = {Foundations of Software Technology and Theoretical Computer Science, 16th Conference},
	year = {1996},
	month = {December},
	publisher = {Springer-Verlag},
	type = {1},
	address = {Hyderabad, India},
	author = {Linnestad, H. and Prehofer, C. and Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1996.b,
	title = {Order-Sorted Termination: the Unsorted Way},
	journal = {Proceedings 5th International Conference on Algebraic and Logic Programming},
	year = {1996},
	pages = {92-106},
	publisher = {Springer-Verlag},
	type = {1},
	address = {Aachen (Germany)},
	author = {{\"O}lveczky, Peter Csaba and Lysne, Olav}
}
@misc {ND.7.LYSNE.1996,
	title = {On SCI-Configurations and Deadlocks},
	howpublished = {Proceedings from NIK{\textquoteright}96: Norsk Informatikk Konferanse},
	year = {1996},
	author = {Lysne, Olav and Gjessing, Stein}
}
@inproceedings {ND.6.Gjessing.1995,
	title = {Aspects of Running the SCI-Protocol Over HIC Networks},
	journal = {Proceedings of the Second International Workshop on SCI-based High-performance Low-Cost Computing},
	year = {1995},
	pages = {31-638},
	type = {1},
	address = {Santa Clara (California),},
	author = {Gjessing, Stein and Lysne, Olav and L{\o}chsen, K.}
}
@techreport {ND.7.LYSNE.1995.a,
	title = {Aspects of Running the SCI-Protocol Over HIC-Networks},
	number = {198},
	year = {1995},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav and Gjessing, Stein}
}
@inproceedings {ND.5.LYSNE.1995.a,
	title = {Aspects of Running the SCI-Protocol Over HIC-Networks},
	journal = {Proceedings of The Second International Workshop on SCI-based High-performance Low-Cost Computing},
	year = {1995},
	pages = {31-38},
	type = {1},
	address = {Santa Clara (California),},
	author = {Lysne, Olav and Gjessing, Stein and L{\o}chsen, K.}
}
@misc {ND.8.Lysne.1995,
	title = {Internett - Ikke Livsn{\o}dvendig},
	howpublished = {Kronikk i Aftenposten, 13. Desember},
	year = {1995},
	author = {Lysne, Olav and Sj{\o}berg, Dag Ingar Kondrup}
}
@misc {ND.7.LYSNE.1995.b,
	title = {Order-Sorted Termination: the Unsorted Way},
	howpublished = {Proceedings from NIK{\textquoteright}95: Norsk Informatikk Konferanse, Gran},
	year = {1995},
	author = {{\"O}lveczky, Peter Csaba and Lysne, Olav}
}
@misc {ND.7.Lysne.1995,
	title = {Requirements Imposed by SCI and ATM},
	howpublished = {OMI-MACRAM{\'E} project deliverable D3.1.1},
	year = {1995},
	author = {Lysne, Olav and Gjessing, Stein}
}
@inproceedings {ND.5.LYSNE.1995,
	title = {A Termination Ordering for Higher Order Rewrite Systems},
	journal = {Proceedings 6th International Conference on Rewriting Techniques and Applications},
	year = {1995},
	pages = {26-40},
	publisher = {Springer-Verlag},
	type = {1},
	address = {Kaiserslautern (Germany)},
	author = {Lysne, Olav and Piris, J.}
}
@inproceedings {ND.5.LYSNE.1994.a,
	title = {On the Connection Between Narrowing and Proof by Consistency},
	journal = {Proceedings 12th International Conference on Automated Deduction, Nancy (France)},
	year = {1994},
	pages = {133-147},
	publisher = {Springer-Verlag},
	type = {1},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1994.d,
	title = {E-Unification by Consistency},
	journal = {Proceedings 5th Nordic Workshop on Program Correctness},
	year = {1994},
	pages = {127-136},
	type = {1},
	address = {bo Akademi},
	author = {Lysne, Olav}
}
@article {ND.4.LYSNE.1994.c,
	title = {Extending Bachmair{\textquoteright}s Method for Proof by Consistency to the Final Algebra},
	journal = {Information Processing Letters},
	volume = {51},
	year = {1994},
	pages = {303-310,},
	publisher = {Elsevier},
	author = {Lysne, Olav}
}
@article {ND.4.LYSNE.1994.b,
	title = {Heuristics for Completion in Automatic Proofs by Structural Induction},
	journal = {Nordic Journal of Computing},
	volume = {1},
	year = {1994},
	pages = {135-156,},
	publisher = {NJC},
	author = {Lysne, Olav}
}
@misc {ND.7.Lysne.1994,
	title = {A Termination Ordering for Higher Order Rewrite Systems},
	howpublished = {Proceedings Journees du GDR Programmation, Lille (France), GDR Programmation du CNRS},
	year = {1994},
	author = {Lysne, Olav and Piris, J.}
}
@article {ND.4.Lysne.1993.a,
	title = {The Equational Part of Proofs by Structural Induction},
	journal = {BIT},
	volume = {33},
	year = {1993},
	pages = {596-618,},
	author = {Lysne, Olav}
}
@techreport {ND.7.Lysne.1993.c,
	title = {Initial Equality As a Function in Algebraic Specification},
	number = {179},
	year = {1993},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav}
}
@techreport {ND.7.Lysne.1993.b,
	title = {Linear Proofs in the Final Algebra},
	number = {139},
	year = {1993},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav}
}
@techreport {ND.7.Lysne.1993,
	title = {Verifying a Distributed List System: a Case History},
	number = {182},
	year = {1993},
	publisher = {Department of Informatics, University of Oslo},
	author = {Krogdahl, Stein and Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1992,
	title = {Proof by Consistency in Constructive Systems With Final Algebra Semantics},
	journal = {Proceedings 3rd International Conference on Algebraic and Logic Programming},
	year = {1992},
	pages = {276-290},
	type = {1},
	address = {Pisa (Italy)},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1992.a,
	title = {Towards Mechanizing Proofs by Structural Induction},
	journal = {Proceedings from NIK{\textquoteright}92: Norsk Informatikk Konferanse},
	year = {1992},
	pages = {243-255},
	publisher = {TAPIR,},
	type = {1},
	author = {Lysne, Olav}
}
@techreport {ND.7.LYSNE.1991,
	title = {Definedness and Strictness in Generator Inductive Definitions},
	number = {161},
	year = {1991},
	note = {Also presented at the 3rd Nordic Workshop on Program Correctness, G\&ouml;teborg (Sweden)},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav and Owe, O.}
}
@phdthesis {ND.3.LYSNE.1991,
	title = {Term Rewriting Techniques for Systems Based on Generator Induction},
	year = {1991},
	school = {Department of Informatics, University of Oslo},
	type = {phd},
	author = {Lysne, Olav}
}
@inproceedings {ND.5.LYSNE.1990,
	title = {A Width First Approach to Completion},
	journal = {Proceedings from NIK{\textquoteright}90: Norsk Informatikk Konferanse},
	year = {1990},
	pages = {145-154},
	publisher = {TAPIR},
	type = {1},
	address = {Bergen,},
	author = {Lysne, Olav}
}
@techreport {ND.7.LYSNE.1990.a,
	title = {A Width First Approach to Completion},
	number = {139},
	year = {1990},
	publisher = {Department of Informatics, University of Oslo},
	author = {Lysne, Olav}
}
