Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
We consider the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us or flickr. A common fea...
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Most of the solutions proposed to support real-time (i.e. guaranteed performance) communication services in packet-switching networks adopt a connection-oriented and reservation-o...
The research in the field of service discovery in mobile ad-hoc networks is characterised by a lack of quantitative research. Many ideas have been put forward but few have been tes...