• Conference Object  

      An abstract channel specification and an algorithm implementing it using Java sockets 

      Georgiou, Chryssis; Shvartsman, A. A.; Musiał, Peter M.; Sonderegger, E. L. (2008)
      Models and specifications can be used in the design of distributed applications to formally reason about their safety properties. However, the benefits of using formal methods are often negated by the ad hoc process of ...
    • Article  

      Adaptive virtual circuit routing 

      Economides, Anastasios A.; Ioannou, Petros A.; Silvester, J. A. (1996)
      The paper deals with the adaptive routing problem in virtual circuit communication networks. A newly arriving call at a source node is routed along the minimum length path to its destination node. All packets belonging to ...
    • Conference Object  

      Applying trust mechanisms in an agent-based P2P network of service providers and requestors 

      Tamani, E.; Evripidou, Paraskevas (2006)
      Building an agent-based network of service providers and requestors requires the effective management of the interactions among peers. These interactions, as in real life, require the mutual trust of the peers participating ...
    • Article  

      Bounds on the number of markings consistent with label observations in petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2009)
      In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
    • Conference Object  

      Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2002)
      The development of algorithms with guaranteed work efficiency for any pattern of fragmentations and merges of the underlying network is addressed. Current results are discussed for the abstract setting where asynchronous ...
    • Article  

      CFP taxonomy of the approaches for dynamic web content acceleration 

      Papastavrou, Stavros; Samaras, George S.; Evripidou, Paraskevas; Chrysanthis, Panos K. (2005)
      Approximately a decade since it was first introduced, dynamic Web content technology has been gaining in popularity over static means for content dissemination. Its rising demand for computational and network resources has ...
    • Doctoral Thesis  Open Access

      Clustering attributed multi-graphs 

      Papadopoulos, Andreas N. (Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences, 2017-06)
      Ένα δικτύων πληροφοριών (information networks) μπορεί να μοντελοποιηθεί αποτελεσματικά ως ένας πολυγράφος ιδιοτήτων (attributed multi-graph). Σε ένα πολυγράφο ιδιοτήτων μια κορυφή (vertex) αντιπροσωπεύει ένα αντικείμενο. ...
    • Article  

      A combinatorial treatment of balancing networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
    • Conference Object  

      Communities: Concept-based querying for mobile services 

      Skouteli, C.; Panayiotou, Christoforos; Samaras, George S.; Pitoura, Evaggelia 1967- (2005)
      In this paper, we consider semantic service discovery in a global computing environment. We propose creating a dynamic overlay network by grouping together semantically related services. Each such group is termed a community. ...
    • Conference Object  

      A congestion control algorithm for max-min resource allocation and bounded queue sizes 

      Lestas, Marios; Ioannou, Petros A.; Pitsillides, Andreas (2004)
      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 ...
    • Article  

      Content Delivery Networks: Status and Trends 

      Vakali, Athena I.; Pallis, George C. (2003)
      An insight into the content delivery networks (CDN) architecture and popular CDN service providers is performed. CDNs improve network performance and offer fast and reliable applications and services by distributing content ...
    • Conference Object  

      Contention in balancing networks resolved 

      Hadjimitsis, Leonidas; Mavronicolas, Marios (ACM, 1998)
      Counting networks have been originally presented by Aspnes et al. as a new class of distributed/coordinated data structures suitable for solving many fundamental, multi-processor coordination problems that can be expressed ...
    • Conference Object  

      Control of jump linear systems over jump communication channels - Source-channel matching approach 

      Donic, S. Z.; Charalambous, Charalambos D. (2007)
      The control of partially observed jump linear systems over jump communication channels is investigated when the Plant State Information (I*SI) and the Channel Slate Information (CSI) are present at the transmitter and the ...
    • Doctoral Thesis  Open Access

      Cooperative interactions in converged heterogeneous communication networks 

      Antoniou, Josephina (Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences, 2010-05)
      Τα δίκτυα πρόσβασης που συμμετέχουν στα Δίκτυα Επικοινωνίας Επόμενης Γενιάς έχουν διαφορετικά χαρακτηριστικά και ικανότητες, ενθαρρύνοντας τη διαφοροποίηση του χειρισμού της μεταφοράς από τον χειρισμού του περιεχομένου ...
    • Article  

      Cooperative task-oriented computing : algorithms and complexity 

      Georgiou, Chryssis; Shvartsman, Alex Allister (2011)
    • Article  

      DBGlobe: A service-oriented P2P system for global computing 

      Pitoura, Evaggelia 1967-; Abiteboul, S.; Pfoser, D.; Samaras, George S.; Vazirgiannis, M. (2003)
      The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a super-database. Our goal is to develop a data management system ...
    • Conference Object  

      Designing mechanisms for reliable internet-based computing 

      Fernández Anta, Antonio; Georgiou, Chryssis; Mosteiro, Miguel A. (2008)
      In this work, using a game-theoretic approach, cost-sensitive mechanisms that lead to reliable Internet-based computing are designed. In particular, we consider Internet-based master-worker computations, where a master ...
    • Conference Object  

      A discrete event based simulation environment for enhanced UMTS 3 rd generation networks 

      Antoniou, Josephina; Vassiliou, Vasos; Pitsillides, Andreas; Hadjipollas, George; Jacovides, N. (2004)
      This paper presents a new system level simulator that has been developed to evaluate E-UMTS (Enhanced Universal Mobile Telecommunication Systems) 3G Networks. The article describes how the simulator supports different ...
    • Doctoral Thesis  Open Access

      Enabling smart homes using web technologies 

      Kamilaris, Andreas (Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences, 2013-01)
      Νέες τεχνολογικές ανακαλύψεις επιτρέπουν στο Διαδίκτυο (Internet) να διεισδύσει στον κόσμο των ενσωματωμένων υπολογιστικών μηχανών (embedded computing devices). Ο Ιστός των Αντικειμένων (Web of Things) διασυνδέει αυτές τις ...
    • Conference Object  

      Enhanced UMTS cellular planning for multiple traffic classes in offices scenarios 

      Cabral, O.; Velez, F. J.; Hadjipollas, George; Stylianou, Marios; Antoniou, Josephina; Vassiliou, Vasos; Pitsillides, Andreas (2006)
      It is shown that Enhanced UMTS will be an affordable solution for providing the required network quality and to reduce infrastructure investments in offices scenarios. System capacity results are obtained by using a system ...