Simple Deadlock-Free Dynamic Network Reconfiguration (2008)
Olav Lysne, José Miguel Montañana, Timothy Mark Pinkston, José Duato, Tor Skeie, José Flich
Abstract. Dynamic reconfiguration of interconnection networks is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge...
Fast Proactive Recovery from Concurrent Failures (2008)
Audun Fosselie Hansen, Olav Lysne, Tarik Čičić, Stein Gjessing
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...
Abstract. A method for proof by structural induction is studied, and problems of automatizing the method is investigated. We specially consider the equational part of such proofs and we observe that...
Tor Skeie, Sven-arne Reinemo, Tor Skeie, Thomas Sødring, Olav Lysne, ...
This work is financed in part by the EU under the 6th framework program for IST as part of the
Fast, Effective and Stable IP Recovery using Resilient Routing Layers (2008)
Audun Fosselie Hansen, Amund Kvalbein, Stein Gjessing, Tarik Čičić, Olav N. Østerbø, Olav Lysne
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....
How to use IEEE 1355 (HIC) as transport layer protocol for SCI (2007)
Introduction HIC (Heterogeneous InterConnect) [7] is a technology that o#ers full duplex point to point serial links with speeds up to 1 Gbaud. This is an European technology that has been developed...
O.: Achieving flow level qos in cutthrough networks through admission control and diffserv (2007)
Sven-arne Reinemo, Tor Skeie, Olav Lysne
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...
and Seitz on wormhole routing [4,5]wehave (2007)
Abstract In recent years we have seen an increasing interest in irregular topologies in the interconnect communities. The predominant routing strategy for such networks is the up*/down * algorithm...
Sven-arne Reinemo, Olav Lysne, Tor Skeie, Robert Dobinson, Stefan Haas, Brian Martin
Abstract — The ever increasing demand for bandwidth in computer networking has seen an evolution from the 3 Mbps Ethernet of 1976 to 1 Gbps Ethernet today with 10 Gbps available soon. This...
100 PROCEEDINGS OF SCI EUROPE'98 Switched SCI Systems (2007)
Geir Horn, Ingebjørg Theiss, Olav Lysne, Tor Skeie
Abstract The SCI standard describes the interconnection of computing nodes by a ring structure. Although the SCIringlet has the bene t of facilitating small con gurations without requiring switches,...
Towards a Generic Analytical Model of Wormhole Routing Networks ∗ (2007)
We study the problem of predicting the performance of wormhole routed networks. A model of a single wormhole router is developed, and unlike previous methods we dothe developmentby a probability...
Higher-Order Proof by Consistency (2007)
Henrik Linnestad, Christian Prehofer, Olav Lysne
Abstract. We investigate an integration of the first-order method of proof by consistency (PBC), also known as term rewriting induction, into theorem proving in higher-order specifications. PBC may...
Abstract. We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and...
Ole-christoffer Granmo, Frank Eliassen, Olav Lysne
particle filters for flexible resource-aware
Layered routing in irregular networks (2006)
Olav Lysne, Tor Skeie, Sven-arne Reinemo, Ingebjørg Theiss
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...
Lash-tor: A generic transition-oriented routing algorithm (2004)
Tor Skeie, Olav Lysne, J. Flich, P. López, A. Robles, J. Duato
Cluster networks are seen as the future access networks for multimedia streaming, E-commerce, network storage, etc. For these applications, performance and high availability are particularly crucial....
Extending Content-based Publish/Subscribe Systems with Multicast Support (2003)
Frank Eliassen, Olav Lysne, Ole-christoffer Granmo
Event-based interaction is recognized as being well suited for loosely coupled distributed applications. Current distributed content-based event notifications services are often architectured to...
Techniques for Parallel Execution of the Particle Filter (2003)
Ole-christoffer Granmo, Frank Eliassen, Olav Lysne
frank,olavly,viktore§ Abstract. Dynamic Bayesian networks are a promising approach to automatic video content analysis which allows statistical inference and learning to be combined with domain...
Applying the DiffServ Model on Cut-through Networks (2003)
Sven-Arne Reinemo, Tor Skeie, Olav Lysne
Understanding the nature of traffc 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...
Supporting Timeliness and Accuracy in Distributed Real-time Content-based Video Analysis (2003)
Frank Eliassen, Ole-christoffer Granmo, Olav Lysne
Real-time content-based access to live video data requires content analysis applications that are able to process the video data at least as fast as the video data is made available to the...
Scalable independent multi-level distribution in multimedia content analysis (2002)
Frank Eliassen, Ole-christoffer Granmo, Olav Lysne
Abstract. Due to the limited processing resources available on a typical host, monolithic multimedia content analysis applications are often restricted to simple content analysis tasks, covering a...
Ole-christoffer Granmo, Frank Eliassen, Olav Lysne
To effectively utilize the growing number of digital media sources in todays electronic world, easy to use computational flexible content-based access is a necessity. In contrast, content-based...
Supporting distributed processing of time-based media streams (2001)
There are many challenges in devising solutions for online content processing of live networked multimedia sessions. These include content analysis under uncertainty (evidence of content are missed...
Distributed Journaling of Distributed Media (2000)
Frank Eliassen, Ole-christoffer Granmo, Olav Lysne
There are many challenges in devising solutions for on-line automatic content analysis, indexing and annotation of live networked multimedia sessions. These include content analysis under uncertainty...
Distributed Journaling of Distributed Media (2000)
Frank Eliassen, Ole-christoffer Granmo, Olav Lysne
There are many challenges in devising solutions for on-line automatic content analysis, indexing and annotation of live networked multimedia sessions. These include content analysis under uncertainty...
Deadlock avoidance for wormhole based switches (2000)
Abstract This paper considers the architecture of switches. In particular we study how virtual cut-through and wormhole networks can be used as the switch internal interconnect. Introducing such...
Fast Dynamic Reconfiguration in Irregular Networks (2000)
Exploitation of the wiring flexibility in Networks of Workstations demands configuration methods that can handle dynamic changes in irregular topologies. During reconfiguration of a network based on...
Distributed Journaling of Distributed Media (2000)
Frank Eliassen, Ole-christoffer Granmo, Olav Lysne
There are many challenges in devising solutions for on-line automatic content analysis, indexing and annotation of live networked multimedia sessions. These include content analysis under uncertainty...
One-fault tolerance and beyond in wormhole routed meshes (1998)
The ability to tolerate one failing link in communication networks is sufficient for many practical purposes. One-fault tolerance can also be achieved at much lower cost than methods that can...
Higher-Order Proof by Consistency (1996)
Henrik Linnestad Olav, Olav Lysne, Christian Prehofer
Weinvestigate an integration of the first-order method of proof by consistency (PBC), also known as term rewriting induction, into theorem proving in higher-order specifications. PBC...
A termination ordering for higher order rewrite systems (1995)
Abstract. We present anextension ofthe recursive path ordering for the purpose ofshowing termination ofhigher order rewrite systems. Keeping close tothe general path ordering ofDershowitz and Hoot,...
Order-sorted Termination: the Unsorted Way (1995)
Peter Csaba Olveczky, Olav Lysne
Abstract. We consider the problem of proving termination of ordersorted rewrite systems. The dominating method for proving termination of order-sorted systems has been to simply ignore sort...
Extending Bachmair's method for proof by consistency to the final algebra (1994)
Proof by consistency is a method for proving properties of abstract data types, and the pioneering work was done by Musser [10]. The initial idea was that when an equation is added to a specification...
Abstract. We study the connection between narrowing and amethod for proof byconsistencyduetoBachmair,and weshowthatnarrowingand proof byconsistency maybeused...
Verifying a Distributed List System: A Case History (1993)
Abstract. The background for this paper is twofold: One isthe de nition of a caching protocol for shared memory parallel computers called SCI, and the other is the usage of rewriting techniques in...
Heuristics for Completion in Automatic Proofs by Structural Induction ∗ (1993)
A method for proof by structural induction is studied, and problems of automatizing the method is investigated. We specially consider the equational part of such proofs and we observe that the...
Proof by consistency in constructive systems with final algebra semantics (1992)
Abstract. In this paper we study nal algebra semantics for constructive equational systems. A class of models of a constructive system is described, and proven to have a nal algebra. Then we develop...