elysium network 2010

8/8/2019 Elysium Network 2010

1/17


2/17

Elysium Technologies Private LimitedISO 9001:2008A leading Research and Development DivisionMadurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore

#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India: +91 452-4390702, 4392702, 4390651

Website: www.elysiumtechnologies.com,www.elysiumtechnologies.infoEmail: [email protected]

03 Applying TCP-Friendly Congestion Control to Concurrent Multipath Transfer

The steadily growing importance of Internet based applications and their resilience requirements lead to a rising

number of multi-homed sites. The idea of Concurrent Multipath Transfer (CMT) is to exploit the existence of multiple

paths among endpoints to increase application data throughput. However, handling the congestion control of each

path independently lacks of fairness against non-CMT flows. In this paper, we describe our approach of combining

CMT with the idea of Resource Pooling (RP) in order to achieve a performance improvement over non-CMT transfer

while still remaining fair to concurrent flows on congested links. Unlike existing approaches which adapt classic TCP

to a multi-homed CMT protocol, our approach does not depend on specific characteristics of TCP. Instead, we base on

already entrenched functional blocks of CMT transfer, on the example of the CMT-enabled SCTP (Stream Control

Transmission Protocol). In a simulative proof-of-concept analysis, we show that our approach while relatively simple

is already quite effective.

04AACK: Adaptive Acknowledgment Intrusion Detection for MANET with Node Detection Enhancement

A Mobile Ad-hoc NETwork (MANET) is an infrastructureless network consisting of self-configuring mobile nodes

connected by wireless links. Nodes rely on each other to store and forward packets. Most of the proposed MANET

protocols assume cooperative and friendly network context, and do not address security issues. Furthermore,

MANETs are highly vulnerable for passive and active attacks because of their open medium, rapidly changing

topology, lack of centralized monitoring. Encryption and authentication solutions, which are considered as the first

line of defense, are not sufficient to protect MANETs from packet dropping attacks. Most of the current Intrusion

Detection Systems (IDSs) for MANETS rely on the Watchdog technique. In this research we study the behavior of this

technique and propose a novel mechanism, named: Adaptive ACKnowledgment (AACK), for solving two significant

problems: the limited transmission power and receiver collision. This mechanism is an enhancement to the TWOACK

scheme where its detection overhead is reduced while the detection efficiency is increased. NS2 is used to simulate

and evaluate the proposed scheme and compare it against the TWOACK and Watchdog methods. The obtained results

show that the new AACK scheme outperforms both of the TWOACK and Watchdog methods in terms of network

packet delivery ratio and routing overhead.

05 Trustworthiness among Peer Processes in Distributed Agreement Protocol

Nowadays more and more information systems are being shifted to distributed architectures because of the benefits

like scalability, autonomy, and faulty-tolerance implied from the essence of the distributed systems. Here, every

process is peer and cooperates with other peers to achieve common goal. In order to do that, peers have to efficiently

and flexibly make an agreement on one common value which satisfies an agreement condition. In this paper, we

consider a distributed group of multiple peers with no centralized coordination. We introduce a novel approach to

efficiently making an agreement where each peer sends a package of multiple possible values to the other peers at

each ongoing round. By exchanging multiple possible values at once, we can significantly reduce the total number of

messages. The time and network resources are mostly spent in the value exchange phase. If we can reduce the time

and number of messages to exchange values among peers, we can improve the efficiency of the agreement protocol.

In order to efficiently exchange value packages among peers, we take advantage of the multipoint relaying mechanism

to reduce the number of duplicate re-transmissions. Although we can significantly reduce the re-transmitted values,

we have to realize the fault-tolerancey of the system. In addition to improving the reliability of the multipoint relaying


3/17




mechanism, we newly introduce the trustworthiness among peers. By taking into account the trustworthiness of the

peer, each peer broadcasts values through the trusted neighbors to the other peers. Here, the transmission fault which

causes by untrusted, unreliable peers can be prevented.

06 Who is Based Geolocation: a strategy to geolocate Internet Hosts

There are several strategies in the literature to geolocate Internet hosts, however the accuracy of their estimates is a

common issue. Furthermore, accurate Internet host location remains a challenge due to incomplete domain registers.

In this paper, we propose a classification for geolocation strategies and present the Whois Based Geolocation (WBG)

approach, a strategy developed to geolocate Internet hosts given their IP address information. This new mechanism is

based on different strategies combination and uses a heuristic to improve the results. An analysis that considers both

accuracy and completeness is made showing the effectiveness of our tool

07 Trust Management in Opportunistic Networks

The increase of people using mobile devices to perform their daily duties has leveraged a number of innovations in

wireless network capabilities. Among these changes, there is the possibility of communication without the presence of

a provider, based on the idea that opportunistic encounters and sharing between pairs of users can increase the

availability of information and resources in an interactive system. During the opportunistic encounters, the users may

have to analyze how reliable the other users are. To deal with the risks users may face out when they are interacting

with each other, this work proposes a trust management system based on an ontology. The ontology uses a reputation

system to classify how reliable a user is. A simple prototype is presented to show the systems capabilities

08 Transmit Power Allocation for Precoded Distributed MIMO OFDM Systems

This paper deals with a new multi-user linear precoding technique for downlink of distributed MIMO OFDM systems.

We consider a distributed broadband wireless system where some base stations are transparently linked by optical

fiber to a central unit. We further assume that the user terminals are equipped with an antenna array and the

distributed base stations equipped with either single or an antenna array. This architecture provides a high speed

backhaul channel allowing an efficient joint multi-cell processing. The proposed power allocation algorithm is based

on minimization of the sum of inverse signal-to-noise ratio (SNR-1) on each user terminal over the available

subcarriers. The motivation to minimize the sum of SNR-1 instead of bit error rate (BER) is in the fact that the first

criterion achieves a closed-form solution, which is more interesting from practical point of view. The aim is to propose

a practical distributed precoding technique to remove the inter-cell interference and improve the users fairness at the

cell-edges. The performance of the proposed scheme is evaluated, considering typical pedestrian scenarios based on

LTE specifications


4/17




09Socio-Natural Thought Semantic Link Network A Method of Semantic Networking in the Cyber Physical

Society

Humans have been recognizing, establishing and making use of various relations consciously and unconsciously

since the formation of human society. Waving and maintaining various relations accompany everyones life. Humans

social behaviors create or emphasize relations. Various networks evolve with the development of society. Some

relational networks gradually become independent of individuals life during evolution so that they become a part of

knowledge and culture sharable cross generations. The study of social relations trace back to the age of Laozi (576

BC), Confucius (551479 BC), Thales (624 BC546 BC) and Socrates (469 BC399 BC). The formal definition of general

relation traces to the invention of set theory in 1874. Humans have intelligence to observe and participate in social

processes, to think, and to know the effect of establishing a relation. Humans can also actively select appropriate

relations and persons according to requirement, situation and social rules. Machines are obviously limited in these

abilities. Various graph-based models have been used to connect resources in the cyber space. Two issues are

fundamental: (1) machines know little relation in human society and the nature, data structures in machines are for

machines to process not for humans to read, so it is not realistic to expect machines to discover social and natural

laws and resolve relevant issues without human instruction; and, (2) machines are hard to know the effect of

establishing and making use of relations, and to explain computing result according to society and nature. The cause

is that machines do not have any worldview. Connecting various networks and machines with nature, society, and

even human minds can create a new world where individuals have semantic images that can enhance mutual

understanding. The semantic images can be constructed by a Semantic Link Network SLN consisting of nodes with

rich semantics, semantic links between nodes, and rules for reasoning, influencing and evolving the network. Waving

semantic link networks in the cyber physical society and exploring the laws of semantic networkingare challenge

issues.

10 Smart card based security in Locator/Identifier-Split architectures

Security is an essential business requirement towards communication networks and will play a major role in future

internet concepts. Many researchers see security functionality as an integral part of a new architecture, which should

be thought of as soon as the conceptional phase of any proposal. In this paper we discuss suggested security

mechanisms for the so called Locator/Identifier-Split and outline problematic issues found in those concepts. Based

on these observations, we propose a security architecture using smart cards, which allows for lifelong assigned

identifiers and is able to handle key replacement and revocation. Furthermore, we discuss the aspect of initial

bootstrap and how to integrate devices with very low computational power like sensors.


5/17




11 Security Analysis of the Simple Lightweight Authentication Protocol

Radio frequency identification technology is becoming ubiquitous and, as an unfortunate side effect, more and more

authentication solutions come to light that have plenty of security issues to deal with. In our former contribution, we

introduced a solely hash-based secure authentication algorithm that is capable of providing protection against most of

the well-known attacks and performs exceptionally well even in very large systems. We gave a theoretical analysis of

the SLAP protocol from the point of view of security and performance. In this paper, we define the attacker model and

we summarize the major security aspects in case of small computational capacity systems; furthermore we give a

comparative table about some lightweight protocols security features. Finally, we fully prove the correctness of the

SLAP protocol with GNY logics.

12 A Scalable Peer-to-Peer Group Communication Protocol

In peer-to-peer (P2P) applications, a group of multiple peer processes (peers) are required to cooperate with each other

in a distributed manner. Messages sent by peers have to be causally delivered to every peer in a group. Due to the

message overhead O(n) for the number n of peers, the vector clock cannot be used to causally deliver messages in a

scalable group. On the other hand, the linear clock implies the message length O(1), but some pair of messages are

unnecessarily ordered. Recently, more accurate physical clocks can be used in cooperation with the GPS time server.

In this paper, we reduce the number of messages unnecessarily ordered by taking advantage of the linear time and

physical time. Even if each physical clock is synchronized with a time server, every physical clock does not show the

between pi and pj . In this paper, we consi

peers pi and pj and each message is sent to every peer. In the evaluation, we show the number of messagesunnecessarily ordered can be reduced in the protocol compared with the li

13 Recommender Systems for Human Resources T ask Assignment

In Portugal, the organisations responsible for the internal control of the States financial administration need to

progressively optimise their human resources in order to maximize their effectiveness. Part of this important

responsibility relates to competence management and the assignment of their most suitable human resources to the

tasks that insure their mission accomplishment. Such endeavour can benefit from a central concept of the Computer

Supported Collaborative Work (CSCW) field: the application of computer technology to support group work. This paper

outlines a recommender system, the 2HRT that aims to facilitate a more proficient human resources task assignment,

helping the human resources department to respond more efficiently to the demands for personnel of other

departments. This research uses a Delphi study, with semi structured interviews to collect the views of inspection

agents in Portugal. The proposed recommender system incorporates the collaborative filtering and content-based

recommendation techniques and the case-based reasoning approach.


6/17




14Provably Secure Nested One-Time Secret Mechanisms for Fast Mutual Authentication and Key Exchange in

Mobile Communications

Many security mechanisms for mobile communications have been introduced in the literature. Among these

mechanisms, authentication plays a quite important role in the entire mobile network system and acts as the first

defense against attackers since it ensures the correctness of the identities of distributed communication entities

before they engage in any other communication activity. Therefore, in order to guarantee the quality of this advanced

service, an efficient (especially user-efficient) and secure authentication scheme is urgently desired. In this paper, we

come up with a novel authentication mechanism, called the nested one-time secret mechanism, tailored for mobile

communication environments. Through maintaining inner and outer synchronously changeable common secrets,

respectively, every mobile user can be rapidly authenticated by visited location register (VLR) and home location

register (HLR), respectively, in the proposed scheme. Not only does the proposed solution achieve mutual

authentication, but it also greatly reduces the computation and communication cost of the mobile users as compared

to the existing authentication schemes. Finally, the security of the proposed scheme will be demonstrated by formal

proofs

15A Proposal of an Associating Image-Based Password Creating Method and a Development of a Password

Creating Support System

In recent years, one of the most widely used authentication methods is a password-based authentication method. In

this method, users are required to create a secure (i.e. difficult to crack) and memorable (i.e. easy to remember)

password when they create one. Taking account of these two important requirements, a mnemonic phrase-based

password has been proposed. However, it is easy to crack a password if the users adopt famous phrases (e.g. music

lyrics, movie quotes) to create a mnemonic phrase-based password. In this paper, we propose an associating image-

based password creating method to create a password which is difficult to crack and easy to remember. Furthermore,

we propose and develop a password creating support system for our method

16 Performance Analysis of Parallel Signal Processing Algorithms in Audio Mixing Systems

Algorithms for real-time parallel processing of an audio signal in large-scale digital audio distribution networks,

implemented on personal computer platform, are compared in this paper from the performance point of view. In such

systems, the summing and multiplication of audio signal take up a significant portion of the processing power of the

system. Therefore, there is a tendency to decrease its computing demands and thus reserve the computing power of

the processor for other signal processing modules in the audio network. Various approaches can therefore be used to

distribute computing among several threads. Seven approaches are analyzed in the paper and fastest one is found

with regard to the size of audio sample buffers


7/17




17 New Approach to Quantification of Privacy on Social Network Sites

Users may unintentionally reveal private information to the world on their blogs on social network sites (SNSs).

Information hunters can exploit such disclosed sensitive information for the purpose of advertising, marketing,

spamming, etc. We present a new metric to quantify privacy, based on probability and entropy theory. Simply by

relying on the total leaked privacy value calculated with our metric, users can adjust the amount of information they

reveal on SNSs. Previous studies focused on quantifying privacy for purposes of data mining and location finding. The

privacy metric in this paper deals with unintentional leaks of information from SNSs. Our metric helps users of SNSs

find how much privacy can be preserved after they have published sentences on their SNSs. It is simple, yet precise,

which is proved through an experimental evaluation

18 Multipath Forwarding in WiMAX Mesh Networks with Dynamic Metrics

One of the most promising emerging wireless technologies, IEEE 802.16, supports broadband access to the Internet

and Quality of Service (QoS) for multimedia applications. A WiMAX network can be deployed and operated in point-to-

multipoint (PMP) mode or mesh (i.e., multihop relay) mode. In a WiMAX mesh network, there are two fundamental

problems: routing and scheduling. Based on a given routing policy, a subscriber station selectively connects to a

sequence of relay stations to establish a data forwarding path to a base stat ion. Then, a scheduling policy is enforced

by all relay stations and the base station along the selected path to provide the requested QoS. With the support of

advanced air interface and the enhanced functional blocks (e.g., routing, self organization) proposed by the IEEE

802.16m, a WiMAX mesh network can flexibly form a partial mesh structure, in which a subscribe station can connect

to multiple relay stations and a relay station can also connect to multiple neighbor relay stations to construct multiple

data forwarding paths to the base station. In this paper, we present a protocol that allows a subscriber station to find

multiple least-cost paths collectively providing the required services. The selection of the paths is based on statistical

measurements of relay stations past linkquality- experience (LQE) in providing the requested QoS


8/17




19 Minimizing Execution Costs when using Globally Distributed Cloud Services

Cloud computing is an emerging technology that allows users to utilize on-demand computation, storage, data and

services from around the world. However, Cloud service providers charge users for these services. Specifically, to

access data from their globally distributed storage edge servers, providers charge users depending on the users

location and the amount of data transferred. When deploying data-intensive applications in a Cloud computing

environment, optimizing the cost of transferring data to and from these edge servers is a priority, as data play the

dominant role in the applications execution. In this paper, we formulate a non-linear programming model to minimize

the data retrieval and execution cost of data-intensive workflows in Clouds. Our model retrieves data from Cloud

storage resources such that the amount of data transferred is inversely proportional to the communication cost. We

take an example of an intrusion detection application workflow, where the data logs are made available from globally

distributed Cloud storage servers. We construct the application as a workflow and experiment with Cloud based

storage and compute resources. We compare the cost of multiple executions of the workflow given by a solution of our

non-linear program against that given by Amazon CloudFronts nearest single data source selection. Our results

show a savings of three-quarters of total cost using our model.

20 Mapping the Blogosphere with RSS-Feeds

The massive adoption of social media has provided new ways for individuals to express their opinions online. The

blogosphere, an inherent part of this trend, contains a vast array of information about a variety of topics. It is thus a

huge think tank that creates an enormous and ever-changing archive of open source intelligence. Modeling and mining

this vast pool of data to extract, exploit and describe meaningful knowledge in order to leverage (content-related)

structures and dynamics of emerging networks within the blogosphere is the higher-level aim of the research

presented here. This paper focuses on this projects initial phase, in which the abovementioned data of interest needs

to be collected and made available offline for further analyses. Our proprietary development of a tailor-made feed-

crawler meets exactly this need. The main concept, the techniques and the implementation details of the crawler thus

form the main interest of this paper and furthermore provide the basis for future project phases.

21 Multicast QoS Routing using Collaborative Path Exploration

Quality of Service (QoS) is one of the most active research areas in networking. The most fundamental requirement for QoS

routing is the ability to find and maintain a network path that provides the required network resources between two or more

nodes. In this paper, we present a distributed collaborative multicast QoS routing architecture that uses a semi-greedy

probing heuristic to quickly find a QoS path between a joining node and the multicast tree. The proposed architecture will

enable the routers along the path to intelligently and dynamically discover a QoS path. Any router that receives a probe will

only know its neighbours and it will create a link to the previous router from where the probe comes from. The proposed

architecture is a tree-initiated QoS search and the first QoS packet to reach the joining node will be used as the QoS path.

Analysis of this method shows that the path search time and message overhead is lower than other similar schemes.


9/17




22 Location-based Service Discovery and Delivery in Opportunistic Networks

Opportunistic networks are usually formed spontaneously by mobile devices equipped with short range wireless

communication interfaces. Designing and implementing a routing protocol to support both service discovery and

delivery in such kinds of networks is a challenging problem on account of frequent disconnections and topology

changes. In these networks one of the most important issues relies on the selection of the best intermediate node(s) to

forward the messages towards their destination(s). In this paper, we propose a new location-based opportunistic

routing protocol enabling a bandwidth-efficient service discovery and delivery in a wide area network composed of

numerous mobile devices. This protocol implements self-pruning heuristics allowing mobile devices to decide whether

they efficiently contribute in the delivery of the messages they receive from their neighbors. This protocol was

validated through simulations, which proved its efficiency and cost-effectiveness. /td>

23 Internet Host Geolocation Using Maximum Likelihood Estimation Technique

Accurately locating the geographical position of Internet hosts has many useful applications. Existing approaches for

host geolocation use Internet latency measurements, IPto- location mapping and also geographical and demographical

hints. In this paper, we investigate the applicability of the Maximum Likelihood Estimation (MLE) technique for Internet

host geolocation. Our approach is based on a probability model for latency measurements that we developed by

analyzing a large set of data collected on the PlanetLab network test bed. This approach uses latency measurements

from multiple hosts of known location to the host to be geolocated, to estimate the target location. Using both

simulated and real data, we analyze the accuracy of our approach. Our results for geolocating Internet hosts in North

America confirms the validity of using MLE with certainty as its accuracy is found to be better in comparison to

existing techniques that are based on Internet latency

24 Integrating Load Balancing into Channelization Strategy in Publish/Subscribe

In Pub/Sub systems, channel-based approaches to routing the subscriptions and events have many advantages such

as fewer routing messages, lower costs for subscription management, etc. But a potential issue embedded in this kind

of approach, i.e. loadings on different event brokers are apt to unbalancing, is ignored more or less. In this paper, we

design a load balancing mechanism and integrate it into a channel-based approach in a Pub/Sub system. In particular,

we define a balancing state in a Pub/Sub system, and then propose the balancing control initiation algorithm which

decides not only whether to perform load balancing among event brokers but also whether to adjust the number of

event brokers. Also we present the load scheduling algorithm which can achieve load balancing by channel splitting,

merging and migration. We conduct the experiments by taking loads with different distributions as input to reveal the

capability of dealing with changing loads. The experimental data prove that our mechanism can help balance the

system loads efficiently and dynamically start or shut down event brokers when facing overloads or insufficient loads


10/17




25 Gradient Based Routing support for Cooperative Multi-Channel MAC in Ad Hoc Wireless Networks

Growing popularity of wireless ad hoc networks leads to higher demands on performance of all TCP/IP stack layers.

Usually ad hoc networks operate according to IEEE 802.11 standard which provides a MAC layer protocol that uses a

single channel for data transmissions. However, increasing the number of data channels on MAC layer improves

performance of ad hoc wireless networks by letting nodes simultaneously transmit data through different channels.

Nevertheless network performance improvement will be diminished if routing mechanisms are not efficient and

reactive to load changes within the network. In this paper we introduce a multi-channel MAC layer cooperative

technique that integrates gradient based routing to support multi-hop wireless transmission. We show that using the

gradient based routing to support multi-channel MAC protocols can enhance overall throughput of the network, and

improve network load balancing. Simulations have also been conducted to validate the proposed solution

26 Enhancing Performance of Networking Applications by IP Tunneling through Active Networks

In 1995, DARPA initiated a work on a programmable concept of computer networking that would overcome

shortcomings of the Internet Protocol. In this concept, each packet is associated with a program code that defines

packets behavior. The code defines available network services and protocols. The concept has been called Active

Networks. The research of Active Networks nearly stopped as DARPA ceased funding of research projects. Because

we are interested in research of possible successors to the Internet Protocol, we continued the research. In this paper,

we present an active network node called Smart Active Node (SAN). Particularly, this paper focuses on SANs ability to

translate data flow transparently between IP network and active network to further improve performance of IP

applications.

27 Enhanced DR-tree for low latency filtering In publish/subscribe systems

Distributed R-tree overlays emerged as an alternative for efficiently implementing DHT-free publish/subscribe

communication primitives. Overlays using R-tree index structures offer logarithmic delivery garantis, guarantee zero

false negatives and considerably reduce the number of false positives. In this paper we extend the distributed R-trees

(DR-trees) in order to reduce event delivery latency. Our optimizations target both the structural organization of the

DR-Trees and the publication policies. The contribution of the current work steams in an extensive evaluation of the

novel structure along four parameters: latency, load, scalability and the rate of false positives. The enhanced structure

performs better than the traditional distributed R-tree in terms of delivery latency. Additionally, it does not alter the

performances related to the scalability, nor the load balancing of the tree, and neither the rate of false positives and

negatives filtered by a node


11/17




28DACS Systems Implementation Method to Realize the Next Generation Policy-based Network Management

Scheme

As the work for managing a whole network effectively without a limited purpose, there is the work of a PBNM (Policy-

based network management). The PBNM has two structural problems such as communication concentration from

many clients to a communication control mechanism called PEP (Policy Enhancement Point) and the necessity of the

network system updating at the time of introducing the PBNM into LAN. Moreover, user support problems in campus-

like computer networks such as trouble user support at updating a clients setups and coping with annoying

communication cannot be improved by the PBNM. To improve these problems, we have been shown a next generation

PBNM which overcomes theses problems and has the function which does not exist in the existing PBNM, and called it

a DACS (Destination Addressing Control System) Scheme. By the DACS Scheme, communication concentration from

many clients to the PEP is solved, and system updating becomes unnecessary. Moreover, user support at updating the

clients setups and coping with annoying communication by the DACS Scheme becomes very effective. In this study,

we implement a DACS system to realize a concept of the DACS Scheme.

29 Cross-layered Synchronization Protocol for Wireless Sensor Networks

The aircraft industry has a conception cycle based on a massive use of Computer Assisted Design in order to allow

more complex plane designs, and cheaper development costs compared to multiple prototyping steps. Among the

many processes necessary to validate calculated aerodynamic models, real time pressure measurements are made on

the wings during test flights. Such measurements are currently performed using wired sensors, with all the cost and

weight problems it causes. Advances in wireless sensor network performances and improvement of attainable bit rates

allow research on such measurement systems using Wireless Sensor Networks (WSNs). However, current WSN

synchronization protocols do not reach performances required for a reliable correlation of data collected by all the

sensors. In this paper, we present a solution to overcome this difficulty to reach sub-microsecond synchronization

based on cross-layered design . Specific algorithms are implanted into the MAC and physical layers and form a cross-

layered synchronization protocol for deterministic Wireless Sensor Networks named WiDeCS (Wireless Deterministic

Clock Synchronization). This protocol propagates master time reference to nodes of a cluster tree network. WiDeCS

Cross layered scheme is possible thanks to flag signals in the physical layer. These signals capture precise dates of

transmission and reception. Hardware level simulations show a synchronization precision of 100 ns. In this paper, the

sources of variable delays in WSN network interfaces are detailed, and the effect of cross-layered WiDeCS scheme on

the knowledge of different delays is explained.

30 Correlation-Based Traffic Analysis on Encrypted VoIP Traffic

: In this paper, we focus on traffic analysis on encrypted Voice over IP (VoIP) calls at the network level and the

application level. The network-level traffic analysis aims to correlate VoIP traffic flows with features in time domain and

frequency domain. The application-level traffic analysis at identify speeches in encrypt VoIP calls. We verified our

analysis approaches with experiments over existing anonymity networks and experiments results show that the

successful rate for flow correlation and speech identification can approach 0.9 and 0.98 respectively.


12/17




31Cloud Analyst: A Cloud Sim-based Visual Modeller for Analysing Cloud Computing Environments and

Applications

Advances in Cloud computing opens up many new possibilities for Internet applications developers. Previously, a

main concern of Internet applications developers was deployment and hosting of applications, because it required

acquisition of a server with a fixed capacity able to handle the expected application peak demand and the installation

and maintenance of the whole software infrastructure of the platform supporting the application. Furthermore, server

was underutilized because peak traffic happens only at specific times. With the advent of the Cloud, deployment and

hosting became cheaper and easier with the use of pay-peruse flexible elastic infrastructure services offered by Cloud

providers. Because several Cloud providers are available, each one offering different pricing models and located in

different geographic regions, a new concern of application developers is selecting providers and data center locations

for applications. However, there is a lack of tools that enable developers to evaluate requirements of large-scale Cloudapplications in terms of geographic distribution of both computing servers and user workloads. To fill this gap in tools

for evaluation and modeling of Cloud environments and applications, we propose Cloud Analyst. It was developed to

simulate large-scale Cloud applications with the purpose of studying the behavior of such applications under various

deployment configurations. Cloud Analyst helps developers with insights in how to distribute applications among

Cloud infrastructures and value added services such as optimization of applications performance and providers

incoming with the use of Service Brokers

32 Analysis of Critical Points for IP address Auto- Configuration in Ad-Hoc Networks

The IETF working groups aim is to speed up development of the standard for the IP address auto-configuration in Ad-

Hoc networks. Many studies have been investigated to complete an automatic configuration, but IP address auto

configuration remains an unresolved issue in Ad-Hoc networks. The approaches taken in these studies differ. We

provide a framework to compare factors of Ad-Hoc networks. This paper arranges existing solutions in two categories

and analyzes the critical points of these schemes. /td>

33 An Energy Efficient Clustering Algorithm in Large- Scale Mobile Sensor Networks

Clustering offers a kind of hierarchical organization to provide scalability and basic performance guarantee by

partitioning the network into disjoint groups of nodes. In this paper an energy efficient clustering algorithm is

proposed under large-scale mobile sensor networks scenario. In the initial cluster formation phase, our proposed

scheme features a simple execution process, which has a time and message complexity of O(n), and eliminates the

frozen time requirement by introducing some GPS-capable mobile nodes. In the following cluster maintenance stage,

the maintenance of clusters is asynchronously and event driven so as to thoroughly avoid the ripple effect, thus

being well suitable for the high mobility environment. Extensive simulations have been conducted and the simulation

results reveal that our proposed algorithm successfully achieves its target at incurring much less clustering overheads

as well as maintaining much more stable cluster structure, as compared to HCC(High Connectivity Clustering)

algorithm.


13/17




34 An Efficient Telematics Service Discovery Scheme over the Centralized Vehicular Peer-to-Peer (C-VP2P)Telematics Service Platform

With the maturation of wireless networks technologies, Telematics service is becoming a new rising and popular

network service and application. In this paper, a centralized vehicular Peer-to-Peer Telematics (C-VP2P) service

discovery platform is proposed to provide efficient and feasible service discovery. This paper focuses on the issues of

developing a Telematics service platform over the vehicular network environment. When a user needs a service on the

road, two issues need to be considered: (1) how to have the candidate list of service providers? (2) how to select

suitable service providers from the candidate list? In order to tackle these two issues, we propose a C-VP2P-based

system service discovery mechanism using the vehicular P2P messaging protocol. In this paper, the vehicular P2P

messaging protocol is designed to communicate among Telematics central server, clients and service providers. In

addition, a service discovery mechanism in the C-VP2P system is proposed to achieve high precision discovery for

service providers. We also exhibit the performance merits of the proposed C-VP2P Telematics service discovery

platform in this paper

35 An Approach for Automated Network-Wide Security Analysis

This paper deals with an approach to security analysis of TCP/IP-based computer networks. The method developed

stems from a formal model of network topology with changing link states, and deploys bounded model checking of

network security properties supported by SAT-based decision procedure. Its implementation should consist of a set of

tools that can provide automatic analysis of router configurations, network topologies, and states with respect to

checked properties. While this project aims at supporting a real practice, it stems from the previous, more theoretical

research designing the method in detail including its formal background

36 An Anomaly Intrusion Detection System Employing Associative String Processor

The genetic material that encodes the unique characteristics of each individual, such as gender, eye color, and other

human features is the well-known Deoxyribonucleic acid (DNA). In this work, we introduce an anomaly intrusion

detection system, built on the notion of a DNA sequence or gene, which is responsible for the normal network traffic

patterns. Subsequently, the system detects suspicious activities by searching the normal behavior DNA sequence

through string matching. Conversely, string matching is a computationally intensive. As a result, we adopt a

monitoring phase that is hardware implemented with the intention that DNA pattern matching is performed at wire-

speed. Finally, we provide the details of our Field Programmable Gate Array (FPGA) implementation of the

bioinformatics-based string matching technique. We show that the proposed micro architecture can handle fixed-length patterns at a rate of more than one character per cycle


14/17




37 Algorithms for Reducing the Total Power Consumption in Data Communication-based Applications

It is now critical to reduce the consumption of natural resources, especially petroleum. Even in information systems,

we have to reduce the total electrical power consumption. We classify network applications to two types of

applications, transaction and communication based ones. In this paper, we consider communication based

applications like the file transfer protocol (FTP). A computer named server consumes the electric power to transfer a

file to a client depending on the transmission rate. We discuss a model for power consumption of a data transfer

application which depends on the total transmission rate and number of clients to which the server concurrently

transmits files. A client has to find a server in a set of servers, each of which holds a file so that the power

consumption of the server is reduced. We discuss a pair of algorithms PCB (power consumption-based) and TRB

(transmission rate-based) to find a server which transmits a file to a client. In the evaluation, we show the total powerconsumption can be reduced by the algorithms compared with the traditional round-robin algorithm

38 PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Networks

We propose PRoPHET+, a routing scheme for opportunistic networks designed to maximize successful data delivery

rate and minimize transmission delay. PRoPHET+ computes a deliverability value to determine the routing path for

packets. Deliverability is calculated using a weighted function consisting of evaluations of nodes buffer size, power,

location, popularity, and the predictability value from PRoPHET. Even though the proposed PRoPHET+s weights are

chosen based on qualitative considerations, it is possible for PRoPHET+ to perform even more efficiently in various

environments by shifting the weights accordingly. Our simulation illustrates that PRoPHET+ can perform better or

equal to the routing protocol PRoPHET if logical choices for weights are used.

39 Adaptive Clustering Protocol for Wireless Networks

We present a new protocol to cluster nodes of wireless networks. Our protocol ensures reliable message transmission

in spite of collisions and transmission losses. We first present a geometric-probabilistic model to predict the optimal

range for maximizing one-hop broadcast coverage in wireless networks as a function of range, sending rate and

density. We use the above model to design a scalable clustering protocol, which functionality is independent of

network topology. Then, we incorporate our analytical model to this protocol to adapts to network conditions. Through

extensive analytical and experimental results, we show multifold advantages of adapting the protocol to network

conditions.


15/17




40 Accountability Computing for e-Society

In the business context, accountability has become a major concern for businesses around the world in aftermath of

corporate scandals and fallouts. However, accountability has not been rigorously considered in IT system

technologies and solutions. The goal of this study is to provide a clear understanding of accountability concept in

service-oriented computing and, more generally, e-society. We first outline the general concept of accountability and

presents a review on accountability from both management and IT perspective. We also clarify the ambiguity between

the accountability concern and other architectural concerns such as security, QoS, trust and reputation. We present an

SOA research project, the Llama accountability framework, which is an accountable service delivery infrastructure to

support the monitoring, analysis, and reconfiguration of service processes. We believe such a framework will be useful

for ensuring better e-services in an e-society.

41 A Visual Semantic Service Browser Supporting User-Centric Service Composition

Follow the promising Web 2.0 paradigm, the telecommunications world also wants to implement the Telco 2.0 vision by

inviting its users to actively participate in the creating and sharing of services accessible using handheld devices. The

EU-IST research project OPUCE (Open Platform for User- Centric Service Creation and Execution) aims at providing

end users with an innovative platform which allows an easy creation and delivery of personalized communication and

information services. This paper introduces a novel visual semantic service browser built on top of the OPUCE service

repository which enables intuitive visualized service exploring and discovery while requires no technical semantic

Web knowledge from the user.

42 A Secure Key Management Model for Wireless M esh Networks

As Wireless Mesh Networks (WMNs) are newly emerging wireless technologies, they are designed to have huge

potential for strengthening Internet deployment and access. However, they are far from muture for large-scale

deployment in some applications due to the lack of the satisfactory guarantees on security. The main challenges

exposed to the security of WMNs come from the facts of the shared nature of the wireless architecture and the lack of

globally trusted central authorities. A well-performed security framework for WMNs will contribute to network

survivability and strongly support the network growth. A low-computational and scalable key management model for

WMNs is proposed in this paper which aims to guarantee well-performed key management services and protection

from potential attacks.


16/17




43 A QoS Routing Protocol for Mobile Ad hoc Networked Control Systems

Due to the dynamic topology, limited and shared bandwidth of the mobile ad hoc network (MANET), providing Quality

of Service (QoS) for MANET-based Networked Control Systems (NCS) is a challenging task. This paper integrates the

concept of choosing stable route according to Received Signal Strength Indication (RSSI) into AQOR. Considering the

data packet transmission characters of NCS, we let the intermediate node repair routes for all the affected data flows

and the destination node recover routes using a route update packet. The simulation results show that the improved

protocol can reduce average end-to-end delay and loss rate, and enhance the stability of NCS.

44A PCA analysis of daily unwanted traffic

This paper investigates the macroscopic behavior of unwanted traffic (e.g., virus, worm, backscatter of (D)DoS or

misconfiguration) passing through the Internet. The data set we used are unwanted packets measured at /18 darknet in

Japan from Oct. 2006 to Apr. 2009 that included the recent Conficker outbreak. The traffic behavior is quantified by the

entropy of ten packet features (e.g., 5-tuple). Then, we apply PCA (principal component analysis) to a ten dimensional

entropy time series matrix to obtain a suitable representation of unwanted traffic. PCA is a well-known and studied

method for finding out normal and anomalous behaviors in Internet backbone traffic, however, few studies applied it to

darknet traffic. We first demonstrate the high variability nature of the entropy time series for ten packet features. Next,

we show that the top four principal components are sufficiently enough to describe the original traffic behavior. In

particular, the first component can be interpreted as the type of unwanted traffic (i.e., worm/virus or scanning), and the

second one as the difference in communication patterns (e.g., one-to many or many-to-one). Those two components

account for 63.8% of the original data set in terms of the total variance. On the other hand, the outliers in the higher

components indicate the presence of specific anomalies although most of mapped data to the components have less

variability. Furthermore, we show that the scatter plot of the first and second principal component scores provides us

with a better view of the macroscopic unwanted traffic behavior

45 A Novel Cross Layer Intrusion Detection System in MANET

Intrusion detection System forms a vital component of internet security. To keep pace with the growing trends, there is

a critical need to replace single layer detection technology with multi layer detection. Different types of Denial of

Service (DoS) attacks thwart authorized users from gaining access to the networks and we tried to detect as well as

alleviate some of those attacks. In this paper, we have proposed a novel cross layer intrusion detection architecture to

discover the malicious nodes and different types of DoS attacks by exploiting the information available across

different layers of protocol stack in order to improve the accuracy of detection. We have used cooperative anomaly

intrusion detection with data mining technique to enhance the proposed architecture. We have implemented fixed


17/17




width clustering algorithm for efficient detection of the anomalies in the MANET traffic and also generated different

types of attacks in the network. The simulation of the proposed architecture is performed in OPNET simulator and we

got the result as we expected

46 A Novel Cache Management Using Geographically Partial Matching for Location-based Services

In this paper, we propose a new cache management scheme in the proxy server for location based services. The proxy

server is able to cache query results of location-based services (LBS). One of the major LBS is mobile advertising.

Mobile advertising is to distribute advertising messages to the target users with mobile devices. Nowadays, users are

willing to receive mobile advertising messages. Users can issue queries to search advertisements within specific area.

The searching area of the user query is seen as a rectangle in this paper. In traditional cache management, even

though the searing areas of different users queries are similar geographically, users queries are still viewed as two

different queries. The cache performance is low. In this paper, we propose the concept of the geographically partial

matching for LBS. In geographically partial matching, two different queries are viewed as the same query if their

searching areas are similar. As a result, the hit rate in the cache of the proxy server for LBS can be improved. Thesimulation results show that the partial matching can increase the re-utilization ratio of the cached content

dramatically

47 A Comparison of Wireless Node Topologies for Network Coding using Practical Path-loss Models

In this paper, we discuss the physical arrangement of wireless nodes to form topologies suitable for the

implementation of Network Coding. Boundaries for the most favorable placement of the nodes to form Bow-Tie and

Butterfly network coding suitable topologies, are mathematically calculated with a log-distance model. Simulations in

OPNET Modeler were conducted with these node positions in mind, in order to verify the practicality of implementing

network coding in these two network topologies. We provide results indicating the trade-off between reduced networkload and higher end-to-end delay for the Bow-Tie topology, while the Butterfly topology only experience gains with no

trade-off. These positive results indicate that implementation of the simulated topologies will be valuable for future

research

elysium network 2010

Documents