We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
In this paper we propose a method for on-line max auditing of dynamic statistical databases. The method extends the Bayesian approach presented in [2], [3] and [4] for static data...
— A Mobile Ad-Hoc Network (MANET) is considered with nodes that may act selfishly or maliciously by simply dropping data packets rather than forwarding them. We study a distribu...
Arnab Das 0002, George Kesidis, Venkat Pothamsetty