Lars Rasmusson, Lars Rasmusson, Gabriel Paues, Gabriel Paues
components for market-based network
1 A Price Dynamics in Bandwidth Markets for Point-to-point (2007)
Lars Rasmusson, Lars Rasmusson, Erik Aurell, Erik Aurell
We describe a model of a network of N sub-networks (or routers) where M network users making concurrent point-to-point connections by selling and buying router capacity to and from each other. The...
dynamically routed point-to-point (2007)
Lars Rasmusson, Lars Rasmusson, Erik Aurell, Erik Aurell
Simulation of a network capacity market and three middle-man strategies t o price and sell
Erik Aurell, Magnus Boman, Mats Carlsson, Joakim Eriksson, Niclas Finne, Sverker Janson, ...
constraint programming agent for
Untrusted Code Reactive Security and Social Control (2007)
Lars Rasmusson, Andreas Rasmusson, Sverker Janson
A major security problem for a network oriented environment is executing untrusted code. Private information risks being disclosed or tampered with if unveri ed remote code manages to gain access to...
Untrusted Code Reactive Security and Social Control (2007)
Lars Rasmusson, Andreas Rasmusson, Sverker Janson
A major security problem for a network oriented environment is executing untrusted code. Private information risks being disclosed or tampered with if unveri�ed remote code manages to gain access...
Libra, a Multi-hop Radio Network Bandwidth Market (2007)
Rasmusson, Lars, Janson, Sverker
Libra is a two-level market which assigns fractional shares of time to the transmitting nodes in local regions of a multi-hop network. In Libra, users are assigned budgets by management and users...
Kevin Lai, Lars Rasmusson, Eytan Adar, Li Zhang, Bernardo A. Huberman
Distributed clusters like the Grid and PlanetLab enable the same statistical multiplexing efficiency gains for computing as the Internet provides for networking. One major challenge is allocating...
Tycoon: an Implementation of a Distributed, Market-based Resource Allocation System (2004)
Lai, Kevin, Rasmusson, Lars, Adar, Eytan, Sorkin, Stephen, Zhang, Li, Huberman, Bernardo A.
Distributed clusters like the Grid and PlanetLab enable the same statistical multiplexing efficiency gains for computing as the Internet provides for networking. One major challenge is allocating...
Tycoon: an Implemention of a Distributed Market-Based Resource Allocation System (2004)
Kevin Lai, Lars Rasmusson, Eytan Adar, Stephen Sorkin, Li Zhang, Bernardo A. Huberman
Distributed clusters like the Grid and PlanetLab enable the same statistical multiplexing efficiency gains for computing as the Internet provides for networking. One major challenge is allocating...
A design of anautomatic network capacity markets, oftenreferred to as a bandwidth market, is presented. Three topicsare investigated. First, a network model is proposed. Theproposed model is based...
A design of anautomatic network capacity markets, oftenreferred to as a bandwidth market, is presented. Three topicsare investigated. First, a network model is proposed. Theproposed model is based...
A design of an automatic network capacity markets, often referred to as a bandwidth market, is presented. Three topics are investigated. First, a network model is proposed. The proposed model is...
In a simulation of a computer network, the capacity between pairs of border routers in a network domain is sold on a spot market. End-users establish point-to-point connections across several domains...
Network components for market-based network admission and routing (2002)
Rasmusson, Lars, Paues, Gabriel
We describe the architecture of a network, in which the traffic ow is controlled by a market. The network access is controlled by a trusted access node, that separates traffic into best effort and...
Analytical Expressions for Parrondo Games (2002)
Rasmusson, Lars, Boman, Magnus
We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are...
A constraint programming agent for automated trading (2002)
Aurell, Erik, Boman, Magnus, Carlsson, Mats, Finne, Niclas, Janson, Sverker, Kreuger, Per, ...
Evaluating the CDF for m weighted sums of n correlated lognormal random variables (2002)
We show that one can evaluate the cumulative probability density function m weighted sums of n correlated lognormal variables with Monte Carlo simulation rapidly, by deriving its joint probability...
Title/Titel: Communication and Services in Open Networks / Kommunikation och (2002)
Kommunikation Tjänster, Tomas Englund, Author/författare Krisitina Höök, Jarmo Laaksolahti, Per Persson, Lars Rasmusson, ...
Publisher/Utgivare: VINNOVA – Swedish Agency for Innovation Systems/Verket för innovationssystem Record no/Diarienr: 2001-03856 Abstract (aim, method, results): The project has conducted research...
A Price Dynamics in Bandwidth Markets for Point-to-point Connections (2001)
We describe a model of a network of N sub-networks (or routers) where M network users making concurrent point-to-point connections by selling and buying router capacity to and from each other. The...
Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle Derivatives (2001)
We describe a model of a communication network that allows us to price complex network services as financial derivative contracts based on the spot price of the capacity in individual routers. We...
Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle Derivatives (2001)
We describe a model of a communication network that allows us to price complex network services as financial derivative contracts based on the spot price of the capacity in individual routers. We...
A Price Dynamics in Bandwidth Markets for Point-to-point Connections (2001)
We simulate a network of N routers and M network users making concurrent point-to-point connections by buying and selling router capacity from each other. The resources need to be acquired in...
A Price Dynamics in Bandwidth Markets for Point-to-point Connections (2001)
We describe a model of a network of N sub-networks (or routers) where M network users making concurrent point-to-point connections by selling and buying router capacity to and from each other. The...
Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle Derivatives, unpublished (2001)
Lars Rasmusson, Lars Rasmusson
We describe a model of a communication network that allows us to price complex network services as nancial derivative contracts based on the spot price of the capacity in individual routers. We prove...
Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle Derivatives, unpublished (2001)
Abstract. We describe a model of a communication network that allows us to price complex network services as financial derivative contracts based on the spot price of the capacity in individual...
Evaluating resource bundle derivatives for multi-agent negotiation of resource allocation (2001)
Consider continuous negotiations where the goal is to obtain exactly one complete bundle of resources and there exists alternative bundles that solve the task. This paper presents a market-based...
Agents, self-interest and electronic markets (1999)
Lars Rasmusson, Sverker Janson
How free are our software agents to take the best possible care of our interests? How free can we make them? In what sense and to what extent do currently proposed mechanisms and agent behaviors...
Using agents to secure the Internet marketplace - Reactive Security and Social Control (1997)
Lars Rasmusson, Andreas Rasmusson, Sverker Janson
We present the idea to let agents handle security issues in Internet markets. The motivation for this is the di culties in having external or centralized control over a system as open as the...
Decentralized coordination for open distributed systems (1997)
This paper gives a survey of work on decentralized coordination techniques, sources mainly taken from multi-agent research, coordination science and market-oriented control by the use of virtual...
Decentralized Coordination for Open Distributed Systems (1997)
This paper gives a survey of work on decentralized coordination techniques,
Simulated social control for secure Internet commerce (1996)
Lars Rasmusson, Sverker Jansson
In this paper we suggest that soft security such associal control has to be used to create secure open systems. Social control means that it is the participants themselves who are responsible for the...
Socially Controlled Global Agent Systems (1996)
Lars Rasmusson, Kungl Tekniska Hogskolan, Sverker Janson, Magnus Boman
In a socially controlled system it is the participants themselves who are responsible for cooperatively maintaining the security, as opposed to leaving security issues to some external or global...
Simulated Social Control for Secure Internet Commerce (1996)
Lars Rasmusson, Sverker Janson
In this paper we suggest that soft security such as social control has to be used to create secure open systems. Social control means that it is the participants themselves who are responsible for...
Tycoon: an Implementation of a Distributed, Market-based Resource Allocation System
Distributed clusters like the Grid and PlanetLab enable the same statistical multiplexing efficiency gains for computing as the Internet provides for networking. One major challenge is allocating...
Evaluating the CDF for m weighted sums of n correlated lognormal random variables
Lognormal variables, Monte Carlo methods, numerical integration, option pricing, exotic options, automated trading, combinatorial auctions.