Marios Lestas

Learn More
The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. In this paper we developed and analyzed a generic Integrated Dynamic Congestion Control (IDCC) scheme for controlling traffic using(More)
Vehicular Ad Hoc Networks (VANETs) are emerging as the preferred network design for intelligent transportation systems and are envisioned to be useful in road safety and commercial applications. A significant issue in VANETs is the design of an effective broadcast scheme which can facilitate the fast and reliable dissemination of critical safety messages to(More)
Vehicular Ad-hoc Networks (VANETS) have recently received great attention as a tool to disseminate information among vehicles with the dual purpose of increasing road safety and comfort in driving. Most of the messages that vehicles exchange are characterized by a finite lifetime period, after which, their level of usefulness is greatly reduced. Thus, an(More)
Information Hovering applies in many applications in Vehicular Ad Hoc Networks, where useful information needs to be made available to all vehicles within a confined geographical area for a specific time interval. A straightforward approach is to have all vehicles within the hovering area exchange messages with each other. However, this method does not(More)
There is strong evidence that the current implementation of TCP will perform poorly in future high speed networks. To address this problem many congestion control protocols have been proposed in literature which, however, fail to satisfy key design requirements of congestion control protocols, as these are outlined in the paper. In this work we develop an(More)
This paper deals with the congestion control problem in computer networks which is viewed as a resource allocation problem constrained by the additional requirement that the queue sizes need to be bounded. We propose a distributed algorithm which converges to the max-min fair allocation of resources among the users of the network and at the same time(More)
Wireless data broadcasting is an efficient, bandwidth preserving way of data dissemination. However, as the amount of data increases, the waiting time of the clients becomes unacceptably high. The present paper proposes the combination of optimal wireless broadcasting and information hovering, as an effective means of performance improvement in vehicular(More)
Data dissemination via periodic broadcasting considers a set of items, each with a given request probability, size and scheduling cost. The goal is to construct a broadcast schedule that minimizes the mean query serving time and the mean scheduling cost at the same time. This task has been proven to be NP-Hard, and related studies have gradually discarded(More)
In this paper we present new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulate the queue size at each link so that it tracks a reference queue size chosen by the designer. To achieve the latter, the protocol implements at each link a certainty equivalent(More)