• 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  

      Network uncertainty in selfish routing 

      Georgiou, Chryssis; Pavlides, Theophanis; Philippou, Anna (2006)
      We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of ...
    • Conference Object  

      Security in future mobile sensor networks - Issues and challenges 

      Stavrou, E.; Pitsillides, A.; Hadjichristofi, G.; Hadjicostis, Christoforos N. (2010)
      Existing security research in wireless sensor networks is based on specific assumptions about the nodes and the network environment that are tied to specific usage scenarios. Typical scenarios consider sensor nodes that ...
    • Conference Object  

      Security in future mobile sensor networks - Issues and challenges 

      Stavrou, Eliana; Pitsillides, Andreas; Hadjichristofi, George C.; Hadjicostis, Christoforos N. (2010)
      Existing security research in wireless sensor networks is based on specific assumptions about the nodes and the network environment that are tied to specific usage scenarios. Typical scenarios consider sensor nodes that ...
    • Article  

      Universal bufferless packet switching 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2007)
      A packet-switching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packet-switching algorithm is universal if it applies to any network topology and for any batch communication ...