CONCURRENCY AND COMPUTATION : PRACTICE AND EXPERIENCE Concurrency Computat

The increasing complexity of computer systems and communication networks induces tremendous requirements for trust and security. This special issue includes topics on trusted computing, risk and reputation management, network security and survivable computer systems/networks. These issues have evolved into an active and important area of research and development. The past decade has witnessed a proliferation of concurrency and computation systems for practice of highly trust, security and privacy, which has become a key subject in determining future research and development activities in many academic and industrial branches. This special issue aims to present and discuss advances of current research and development in all aspects of trusted computing and network security. In addition, this special issue provides snapshots of contemporary academia work in the field of network trusted computing. We prepared and organized this special issue to record state-of-theart research, novel development and trends for future insight in this domain. In this special issue, 14 papers have been accepted for publication, which demonstrate novel and original work in this field. A detailed overview of the selected works is given below. The first paper entitled Dynamic Malicious Node Detection with Semi-supervised Multivariate Classification in Cognitive Wireless Sensor Networks designed a multivariate classifier to detect malicious nodes in wireless sensor networks [1]. Communication features of normal and malicious node are first extracted and modeled, with the help of multivariate classification algorithm, the type of unknown sensor can be inferred. In addition, this work has presented a promising detecting result, which limited the false detection rate under 1 percentile. The second paper, Efficient Privacy Preserving Matchmaking for Mobile Social Networking against Malicious Users, addressed an interesting topic in the increasingly important area of mobile social networking [2]. The paper presents a protocol that is shown to preserve privacy, by not revealing attribute data to participants, with the intent of being efficient and tolerant of semi-honest and malicious attacks. Theoretical analysis and simulation results are presented to demonstrate the security and efficiency of the protocol. The third paper, A Formal Analysis of Authentication Protocols for Mobile Devices in Next Generation Networks, investigated authentication protocols for in next generation networks (NGNs) [3]. This paper has introduced two authentication protocols, verifies those using formal methods approach and discusses how the developed protocols achieved desired security proprieties. Moreover, this work considered a number of protocols in the literature, which have been proposed to address device authentication in NGNs. The comparison shows that the developed protocols meet the desired security properties without resulting in an additional overhead. The fourth paper, An Efficient Protocol for Two-Party Explicit Authenticated Key Agreement,İ has investigated the authentication protocols in a different insight [4]. This paper examined the issue on authenticated two-party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. Both of these papers have novel developments in authentication protocols in network security. Cloud computing offers the potential for significant cost reductions and increased agility for users. On the other hand, security concerns continue to be raised as a potential barrier to uptake for clouds. The fifth paper, An Overview of Insider-Attacks in Cloud Computing,İ involved a detailed modeling of the threat and vulnerability land scape, including the incentives and motivations which drive attackers [5]. The sixth paper, A Lightweight Software Fault-Tolerance System in the Cloud Environment, investigated the software failures which has significantly impact on high availability for services in cloud computing [6]. This work presented a lightweight software

[1]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[2]  Dileep Bhandarkar,et al.  Analysis of Memory Interference in Multiprocessors , 1975, IEEE Transactions on Computers.

[3]  CORNELIS H. HOOGENDOORN A General Model for Memory Interference in Multiprocessors , 1977, IEEE Transactions on Computers.

[4]  Tharam S. Dillon,et al.  Memory interference in multimicroprocessor systems with a time-shared bus , 1984 .

[5]  Chung-Kuan Cheng,et al.  Ratio cut partitioning for hierarchical designs , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Arjan J. C. van Gemund,et al.  Performance prediction of parallel processing systems: the PAMELA methodology , 1993, ICS '93.

[7]  G. Sohi,et al.  Tetra: Evaluation of Serial Program Performance on Fine-Grain Parallel Processors , 1993 .

[8]  Brian A. Malloy,et al.  Scheduling DAG's for Asynchronous Multiprocessor Execution , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Fred Baker,et al.  Requirements for IP Version 4 Routers , 1995, RFC.

[10]  Giuseppe Serazzi,et al.  Scheduling issues in high-performance computing , 1999, PERV.

[11]  Eddie Kohler,et al.  The Click modular router , 1999, SOSP.

[12]  Udi Manber,et al.  A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING , 1999 .

[13]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[14]  Gunnar Karlsson,et al.  IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..

[15]  Arjan J. C. van Gemund,et al.  Analysis of a shared-memory multiprocessor via a novel queuing model , 1999, J. Syst. Archit..

[16]  William H. Mangione-Smith,et al.  Specialized Hardware for Deep Network Packet Filtering , 2002, FPL.

[17]  Lothar Thiele,et al.  Chapter 4 – Design Space Exploration of Network Processor Architectures , 2003 .

[18]  Tilman Wolf,et al.  A Network Processor Performance and Design Model with Benchmark Parameterization , 2003 .

[19]  Tilman Wolf,et al.  PacketBench: a tool for workload characterization of network processing , 2003, 2003 IEEE International Conference on Communications (Cat. No.03CH37441).

[20]  Stephen D. Goglin Advanced Software Framework , Tools , and Languages for the IXP Family , 2003 .

[21]  Kurt Keutzer,et al.  Chapter 7 – Exploring Trade-Offs in Performance and Programmability of Processing Element Topologies for Network Processors , 2003, HPCA 2003.

[22]  John W. Lockwood,et al.  Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.

[23]  Kurt Keutzer,et al.  NP-Click: A Programming Model for the Intel IXP1200 , 2004 .

[24]  Tilman Wolf,et al.  Power Considerations in Network Processor Design , 2004 .

[25]  Tilman Wolf,et al.  Application analysis and resource mapping for heterogeneous network processor architectures , 2005 .

[26]  Paul D. Franzon,et al.  Configurable string matching hardware for speeding up intrusion detection , 2005, CARN.

[27]  Tsern-Huei Lee,et al.  A parallel automaton string matching with pre-hashing and root-indexing techniques for content filtering coprocessor , 2005, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05).

[28]  Tilman Wolf,et al.  Design considerations for network processor operating systems , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).

[29]  Stamatis Vassiliadis,et al.  Packet pre-filtering for network intrusion detection , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[30]  Tilman Wolf,et al.  Runtime Support for Multicore Packet Processing Systems , 2007, IEEE Network.

[31]  Yu Zhang,et al.  Automated task distribution in multicore network processors using statistical analysis , 2007, ANCS '07.

[32]  Krishnan Srinivasan,et al.  ILP and heuristic techniques for system-level design on network processor architectures , 2007, TODE.

[33]  Tilman Wolf,et al.  On runtime management in multi-core packet processing systems , 2008, ANCS '08.