George C. Polyzos

Learn More
We present heuristics for multicast tree construction for communication that depends on: i) bounded end-to-end delay along the paths from source to each destination, and ii) minimum cost of the multicast tree, where edge cost and edge delay can be independent metrics. This problem of computing such a constrained multicast tree is NP-complete. We show that(More)
The current Internet architecture was founded upon a host-centric communication model, which was appropriate for coping with the needs of the early Internet users. Internet usage has evolved however, with most users mainly interested in accessing (vast amounts of) information, irrespective of its physical location. This paradigm shift in the usage model of(More)
PSIRP (Publish-Subscribe Internet Routing Paradigm) is an EU FP7 funded project that has developed a clean-slate architecture for the future Internet, based on the publish-subscribe primitives (rather than the send-receive ones), all the way down to the core networking functions. The PSIRP vision is a pure information-centric Internet architecture, possibly(More)
The relative performance of different data collection methods in the assessment of various traffic parameters is significant when the amount of data generated by a complete trace of a traffic interval is computationally overwhelming, and even capturing summary statistics for all traffic is impractical. This paper presents a study of the performance of(More)
We investigate multicast routing for high-bandwidth delay-sensitive applications in a point-to-point network as an optimization problem. We associate an edge cost and an edge delay with each edge in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so that the delay on the path from source(More)
This paper surveys research in service advertising, discovery and selection for mobile ad hoc networks (MANETs) and related issues. We include a categorization of service discovery architectures for MANETs and their modes of operation, presenting their merits and drawbacks. We pay particular attention to cross-layer service discovery a special class of(More)
-In this paper, we introduce a new scheduling policy which provides guaranteed service for a session based on a flexible service specification called the Service Curve. This policy, referred to as the Service Curve based Earliest Deadline first policy (SCED), is a generalized policy to which well-known policies such as VirtualClock and the Earliest Deadline(More)
Multiple Access protocols are distributed algorithms that enable a set of geographically dispersed stations to communicate using a single, common, broadcast channel. We concentrate on the class of Conflict Resolution Algorithms. This class exhibits very good performance characteristics for ‘‘bursty’’ computer communications traffic, including high capacity,(More)