Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
This is a framework for resource allocation in a heterogeneous system composed of various access networks, for instance Third Generation wireless networks (3G) and WLAN, in the pre...
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...