• 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  

      Direct routing: Algorithms and complexity 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios; Spirakis, Paul G. (2004)
      Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
    • Article  

      Distributed Balancing of Commodity Networks Under Flow Interval Constraints 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (2018)
      We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
    • Article  

      New Zn 2+ metal organic frameworks with unique network topologies from the combination of trimesic acid and amino-alcohols 

      Manos, Manolis J.; Moushi, Eleni E.; Papaefstathìou, Giannis S.; Tasiopoulos, Anastasios J. (2012)
      A series of new Zn 2+-trimesate (btc 3-) metal organic frameworks (MOFs) has been isolated in the presence of various amino-alcohols under solvothermal conditions. Thus, the reaction of ZnCl 2 with trimesic acid (H 3btc) ...
    • Conference Object  

      On constructing internet-scale P2P information retrieval systems 

      Zeinalipour-Yazdi, Constantinos D.; Kalogeraki, Vana; Gunopulos, Dimitrios (2005)
      We initiate a study on the effect of the network topology on the performance of Peer-to-Peer (P2P) information retrieval systems. The emerging P2P model has become a very powerful and attractive paradigm for developing ...
    • Article  

      A process calculus for dynamic networks 

      Kouzapas, D.; Philippou, Anna (2011)
      In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery ...
    • Conference Object  

      Qualifying explore and exploit for efficient data dissemination in emergency adhoc networks 

      Kolios, Panayiotis; Pitsillides, Andreas; Mokryn, O.; Papadaki, Katerina P. (IEEE Computer Society, 2014)
      The literature of wireless adhoc networks includes a plethora of alternative dissemination strategies that aim for efficient delivery of data traffic from source to destination. Hence, the majority of these strategies ...