Networking and Communication Engineering

D. Satish Kumar ¹, N. Nagarajan ²

Affiliations
1 Kalaignar Karunanidhi Institute of Technology, Coimbatore-641402, Tamil Nadu, IN
2 Coimbatore Institute of Engineering and Technology, Coimbatore-641109, Tamilnadu, IN

Abstract

An Adaptive Network Topology Acquisition (A-NTA) Algorithm for IEEE 802.16j non transparent mode relay networks is presented in this paper. We have implemented this algorithm in NCTUns open source network simulator. In this algorithm the process of setting channel ID for mobile stations, and time taken to accept a new mobile station are mainly focused. The mobile stations which are in the coverage area of base station are given first preference, and those outside coverage area are assigned channel ID through relay stations. Two ID’s are set for each mobile station: Basic channel ID [1, 2, 3….] and Primary Channel ID [256, 257, 258…]. Mobile stations are first accepted by base stations, to allocate band width. We have studied the time taken to accept mobile stations. The results show that, base station takes 0.0096613 sec to accept one mobile station (inside coverage area) and it takes 0.065001 sec to accept one mobile station (outside coverage area)- through a relay station . Here 0.085308 sec is spend to accept one relay station.

Keywords

A-NTA Algorithm, IEEE 802.16j, Non-Transparent Mode, Relay Station, Channel ID, NCTUns etc.

Full Text

     

M. Sadish Sendil ¹, M. Kavitha ¹, U. Kaleelurrahaman ², S. Karthik ¹, N. Nagarajan ³

Affiliations
1 SNS College of Technology in Department of Computer Science and Engineering, Coimbatore, IN
2 SNS College of Technology in Department of Information Technology, Coimbatore, IN
3 Coimbatore Institute of Engineering and Technology, Coimbatore, IN

Abstract

Problem statement: In the last years, we have seen that the use of P2P applications has increased significantly and currently they represent a significant portion of the Internet traffic. In consequence of this growth, P2P traffic characterization and identification are becoming increasingly important for network administrators and designers. Also increasing amount of P2P services not only consuming a lot of bandwidth but also influencing the performance of other business. Another difficulty in identification of traffic in P2P is that P2P applications have the ability to disguise their existence through the use of arbitrary ports and explicitly try to camouflage the original traffic in an attempt to go undetected. In this paper we have analyzed different type of identification methods and compared the efficiency in each method. Approaches: 1. P2P traffic identification using Cluster analysis which seek five traffic discriminators and applies cluster analysis to identify P2P traffic. 2. P2P traffic identification based on double layer characteristics which identify traffic based on flow characteristics and payload characteristics. 3. Transport layer heuristic identification in which P2P traffic flows are identified by analyzing the statistical properties of the flows and their behavior characteristics. 4. Payload-based IP traffic identification packet payloads are analyzed to determine whether they contain specific signatures of known applications. Results: After analyzing each model we find out that there are both advantages and limitation in it. We have simulated those models and compared with each other. Conclusion and Future work: With the widely adoption of the P2P, the method for the control and the management to the P2P applications has become a research hotspot. In this paper we analyse different methods to identify the traffic in P2P application. In future we try to build a new algorithm which combines the best capabilities of the analyzed approaches.

Keywords

Cluster Analysis, Flow Characteristics, Payload Characteristics, Traffic Identification.

Full Text

     

M. Sadish Sendil ¹, N. Nagarajan ²

Affiliations
1 Department of Computer Science and Engineering, SNS College of Technology, Sathy NH, Coimbatore, Tamilnadu, IN
2 Coimbatore Institute of Information and Engineering Technology, Coimbatore, Tamilnadu, IN

Abstract

Peer-to-Peer (P2P) system has become one of the hottest research topics, its excellent characteristics of fully decentralized control and self-organizing make it attractive for some particular applications. Routing algorithm has great influence in P2P applications. Current routing algorithm concentrates on creating well organized network architecture to improve the routing performance. However, for each routing procedure, system returns location information of the requested file only and the characteristics of system workload are considered. Routing performance is critical for P2P networks to achieve high performance. Using sandwich method, the HDHTR and SDHTR are combined based on the following criteria: 1. creating a P2P ring where routing tasks are first executed in lower level ring before they go to higher level thus reducing routing overhead. 2. A super node based routing algorithm which reduce the average routing latency and cost. Hence it reduces the routing overhead and average routing latency, which thereby reduce the traffic.

Keywords

Peer to Peer, Dynamic Hash Table, Hierarchical DHT Routing, Super Node DHT Routing.

Full Text