{"title":"An Enhanced Media-Independent Pre-authentication Framework for Preventing Packet Loss","authors":"Lun-Huo Yeh, Shun-Neng Yang, Wei-Kuo Chiang","doi":"10.1109/ICCSN.2010.52","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.52","url":null,"abstract":"Media-Independent Pre-Authentication (MPA) is used as a secure handover optimization scheme working over any link layer. With MPA, a mobile node (the MN) can establish a security association with a candidate target network (CTN), obtain an IP address and other parameters from the CTN, and complete the binding update of any mobility management protocol with the new care-of address (nCoA) before performing a handover at the link layer. This can significantly reduce handover delay. However, the packets transmitted to the MN may be lost if a link layer handover occurs due to the link going down before the MN completes the binding update. The possible simultaneous mobility problem also gives rise to undesirable handover delay. In this paper, we design a framework called enhanced MPA (eMPA) by improving handover execution procedures of MPA. When a MN decides to perform handover at the link layer, it will request to create an IPSec tunnel between its nCoA and old access router (oAR) before deleting the proactive handover tunnel (PHT) that created between the MN and new access router (nAR). Then data packets sent to the oAR will be forwarded to the MN with the nCoA via nAR. Then the nAR will start to buffer those packets until the MN sends an explicit signal to stop buffering and flushes the packets after completing handover at the link layer. In addition, we present a binding update retransmission mechanism in the eMPA to resolve control plane packet timeout problem. With this mechanism, we can prevent packet loss during the handover.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem","authors":"A. Hoang, V. Le, Nhu Gia Nguyen","doi":"10.1109/ICCSN.2010.111","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.111","url":null,"abstract":"In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem instances.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fusion Based Approach for Distributed Alarm Correlation in Computer Networks","authors":"A. Mohamed, O. Basir","doi":"10.1109/ICCSN.2010.65","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.65","url":null,"abstract":"We propose a new distributed alarm correlation and fault identification in computer networks. The managed network is divided into a disjoint management domains and each management domain is assigned a dedicated intelligent agent. The intelligent agent is responsible for collecting, analyzing, and correlating alarms emitted form emitted from its constituent entities in its domain. In the framework of Dempster-Shafer evidence theory, each agent perceives each alarm as a piece of evidence in the occurrence of a certain fault hypothesis and correlates the received alarms into a single alarm called local composite alarm, which encapsulates the agent’s partial view of the current status of the managed system. While the alarm correlation process is performed locally, each intelligent agent is able to correlate its alarms globally. These local composite alarms are, in turn, sent to a higher agent whose task is to fuse these alarms and form a global view of operation status of the running network. Extensive experimentations have demonstrated that the proposed approach is more alarm loss tolerant than the codebook based approaches and hence shown its effectiveness in a usually noisy network environment.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127439669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network Traffic Analysis and Intrusion Detection Using Packet Sniffer","authors":"M. Qadeer, A. Iqbal, Mohammad Zahid, M. Siddiqui","doi":"10.1109/ICCSN.2010.104","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.104","url":null,"abstract":"Computer software that can intercept and log traffic passing over a digital network or part of a network is better known as packet sniffer. The sniffer captures these packets by setting the NIC card in the promiscuous mode and eventually decodes them. The decoded information can be used in any way depending upon the intention of the person concerned who decodes the data (i.e. malicious or beneficial purpose). Depending on the network structure one can sniff all or just parts of the traffic from a single machine within the network. However, there are some methods to avoid traffic narrowing by switches to gain access to traffic from other systems on the network. This paper focuses on the basics of packet sniffer and its working, development of the tool on Linux platform and its use for Intrusion Detection. It also discusses ways to detect the presence of such software on the network and to handle them in an efficient way. Focus has also been laid to analyze the bottleneck scenario arising in the network, using this self developed packet sniffer. Before the development of this indigenous software, minute observation has been made on the working behavior of already existing sniffer software such as wireshark (formerly known as ethereal), tcpdump, and snort, which serve as the base for the development of our sniffer software. For the capture of the packets, a library known as libpcap has been used. The development of such software gives a chance to the developer to incorporate the additional features that are not in the existing one.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121472353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A BFSK Neural Network Demodulator with Fast Training Hints","authors":"M. Amini, Mohammad Moghadasi, Iman Fatehi","doi":"10.1109/ICCSN.2010.123","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.123","url":null,"abstract":"In this paper an artificial neural network demodulator to demodulate binary frequency shift keying signal is proposed. This demodulator has some important features compared with conventional method such as coherent and non-coherent demodulator and also other proposed neural network demodulators. In contrast with conventional demodulator, this demodulator (which uses a tapped delayed line in its two layers) does not need any band pass filter (to select the desired frequency band), any pulse shaping filter (to worry about its output sharpness) and any synchronous local oscillator and the other usual demodulator components. it is just a neural network implementation demodulator, that should be called soft demodulator, because once it is trained properly for a special kind of modulation, it works well for that kind of modulation and it is easy to train it for another modulation scheme without changing hardware, i.e., train it and then use it ! Compared with the other ANN demodulators proposed before it can be trained faster (or with less training data bits), it has more efficient BER curve and also has a better performance (MSE or SSE).","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Excellent Performance of DFE Based on IT2SNFS in Time-Varying Channels","authors":"Yao-Jen Chang, C. Ho","doi":"10.1109/ICCSN.2010.51","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.51","url":null,"abstract":"In this paper, we incorporate an interval type-2 self-organizing neural fuzzy system (IT2SNFS) into decision feedback equalizer (DFE) for time-varying channels. By exploiting the structure and parameter learning algorithms of the IT2SNFS, the proposed DFE is able to obtain the improved performance without the estimation of the channel order. Moreover, the IT2SNFS can set conditions on the increase demand of the fuzzy rules and hence the DFE results in little hardware complexity. We show in simulations that the IT2SNFS-based DFE performs much better than the traditional DFE methods in time-varying channels.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127643917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Evaluation of Index Poisoning in BitTorrent","authors":"Jie Kong, Wandong Cai, Lei Wang","doi":"10.1109/ICCSN.2010.39","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.39","url":null,"abstract":"In recent year, some popular P2P file-sharing systems have been identified to be polluted by the copyright Industry to control the unauthorized distribution of content. As one of the most common P2P pollution methods, the index poisoning controls the P2P file-sharing by inserting massive numbers of bogus records into the index of the P2P file-sharing system. In this paper, the index poisoning in the structured P2P file-sharing system is introduced firstly. A term “poison multiplication” is defined to describe the level of the poisoning and the probability model that a peer receives valid peer information on the condition of the index poisoning in BitTorrent is proposed. We run index poisoning in BitTorrent and evaluate the effect of it. The result of the evaluation shows that with the poison multiplication increases, the connection time and the randomness of the connection time increases. To our knowledge, this is the first study to employ BitTorrent as the platform to evaluate the effectiveness of the index poisoning.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130365115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid Framework for Behavioral Prediction of Network Attack Using Honeypot and Dynamic Rule Creation with Different Context for Dynamic Blacklisting","authors":"Renuka Prasad B, A. Abraham","doi":"10.1109/ICCSN.2010.82","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.82","url":null,"abstract":"Honeypots are decoys designed to trap, delay, and gather information about attackers. All the previous work in the field was related mainly to intrusion detection system, but in this research work, the highlight is more focused on the novel approach of creation of a Honeypot schema which is powered by intelligence along with the design of classifier. The output generated by the classifier generates a dynamic list of attacks, which are then queued in the proposed Honeypot architecture built with neural network to understand various approach of behavior and patterns of the attacker. The network administrator collects all such relevant information over the network itself allowing the inbound network connection from the attacker to do so and the system creates a hybrid framework to prevent the probability of vulnerable and hostile situation over the network even before the attack event is performed by the attacker.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127778297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"QoS-Satisfied Dynamic Routing Based on Overlay Service Network","authors":"Amir Karamoozian, Mostafa Erfani, A. Abdullah","doi":"10.1109/ICCSN.2010.99","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.99","url":null,"abstract":"In recent years, overlay networks have emerged as an approach to provide a general framework for new applications and services to be implemented without significant changes in the IP-layer network infrastructure. Overlay Service Network (OSN) is a unified framework which acts as a top layer over the IP-layer network and makes overlay routing feasible. This paper mainly focuses on designing a QoS-satisfied dynamic overlay routing protocol based on OSN framework. While satisfying the QoS requirements, being a dynamic routing protocol enhances the reliability and performance of the routing. So the proposed algorithm not only satisfies the application QoS requirements, but also improves the routing performance. The goals are: (1) to discover an overlay path which fulfills the QoS requirements, as well as (2) balancing the computational capacity of the resources and at the same time, (3) enhance the performance of the overlay network. To achieve these goals, we propose a path selection algorithm called Modified Least-Cost Path (MLCP) algorithm. Our simulation experiments have shown that the proposed algorithm performs well in achieving QoS-satisfied overlay routing while maintaining the performance.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122769517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"User-Categorized Tags to Build a Structured Folksonomy","authors":"Donghee Yoo, Yongmoo Suh","doi":"10.1109/ICCSN.2010.36","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.36","url":null,"abstract":"With the coming of Web 2.0, folksonomy has emerged to help users share web-based information created by users. The basic components of folksonomy are user-inputted tags, but a major problem is that the semantics of tags are not obvious because there is no hierarchy and no relationships among the tags. To minimize these problems, this paper suggests a user-categorized tag that freely defines the category of the tag when the user inputs it. Based on the user-categorized tags, a structured folksonomy is automatically created. This paper develops a prototype as web-based document management system to describe how a structured folksonomy can be useful.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121086218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}