This paper presents a study of Router based Congestion control approaches in wired network. As network is considered as a distributed system, any problem arises in such a system requires a distributed solution. Thus for good congestion control in the network we also need a solution distributed at source as well as router ends. The purpose of this study is to review the router based Congestion control research for wired network and characterize the different approaches to Congestion control design, by considering their advantages and limitations.

The problem of determination of maxima distribution laws of full differentials and linear bias of block symmetric ciphers as substitution transformations is considered. Well-known theoretical results, published in literature, are given, as well as experiment results on making the laws of maxima distribution of full differential transitions and maximum biasess of linear hulls for reduced cipher model from Belorussian standard and cipher Kalina, which practically confirm theoretical calculations, are presented. The results testify that maximum values of differential and linear probabilities are concentrated close to their average values and for evaluation of indexes of cipher provable security it’s enough to make a test of proximity of differential and linear cipher indexes, received for one arbitrarily taken cipher key corresponding to indexes of random substitutions.

Satellite networks have been widely investigated both in the business and academia for many years, with many important routing algorithms reported in the literatures. However, fewer existing routing algorithms focus on the trade-off between the routing survivability and the routing computation and storage overheads. Due to topological dynamics, it is difficult to effectively apply the conventional routing protocols such as RIP or OSPF to Low Earth Orbit (LEO) satellite networks. According to the virtual topology model based on virtual node, this paper propose a new fully distributed routing protocol for LEO satellite networks, called Distributed Traffic Balancing Routing (DTBR). The proposed protocol not only guarantees the routing survivability and provides the ability of traffic balancing, but also result in few additional computation and storage overheads only deriving from the information flooding of failed satellites. Simulation results demonstrate positive conclusions of our methods.

SQL injection attacks try to use string or text manipulations to access illegally websites and their databases. This is since using some symbols or characters in SQL statements may trick the authentication system to incorrectly allow such SQL statements to be processed or executed. In this paper, we highlighted several examples of such text manipulations that can be successfully used in SQL injection attacks. We evaluated the usage of those strings on several websites and web pages using SNORT open source.  We also conducted an extensive comparison study of some relevant papers.

In modern conditions; Steganography has become the digital strategy of hiding files in one form or other MEDIA like images, sound files or video files. Algorithms built-in digital information for color images based techniques steganography. This work presents a new method of steganography based on space domain to encode more information in the image, making small changes in their pixels. The results work obtained in this work that the new detection method of steganography based on new spatial coding additional information in the image, making small changes in their pixels based on the expansion of the range is designed for testing the proposed structure. This work study is to develop a new method to detect human faces, reflected in digital photography, with a high work rate and accuracy of detection.

Traffic grooming is being considered as a key functionality of WDM networks, in which, multiple low speed traffic requests are groomed into a single high capacity wavelength channel. In this work, multicast traffic grooming problem is addressed to maximize the bandwidth utilization for a set of sessions in an optical WDM mesh topology. We propose a heuristic approach called Prioritized Multicast Traffic Grooming (PMTG) for constructing multicast tree and a first fit algorithm for wavelength assignment. After successful grooming of multicast requests, PMTG algorithm have successfully reduced the maximum number of wavelengths required in a link at the same time bandwidth utilization has greatly improved. We have simulated the heuristic approach PMTG with different network topologies and compared the performance with Multicast Traffic Grooming with Shortest Path (MTG-SP) algorithm. The simulation results show that the proposed heuristic algorithm produces better result than MTG-SP based algorithm.

Bots usually vary from their other malicious counter parts by periodically reporting to the botmaster through regular exchange of messages. Our experiments on bot attack generation showed a continuous exchange of packets with similar content between the botmaster and the zombie machine at various time intervals. Though there were also genuine packets with similar content being sent out of the victim machine challenge was to differentiate between the two and pass only the genuine ones. In this paper, an algorithm namely Auto-Pattern Programmable Kernel Filter (Auto-PPKF), for automatic detection of patterns from packet payload for filtering out malicious packets generated by bots is proposed. The significant feature of our proposed Auto-PPKF algorithm is that, the malicious pattern is deduced at kernel level on the fly from packet payload. Traditional algorithms such as Boyer Moore, Knuth Morris Patt, and Naive Pattern search algorithms require the pattern to be identified available a priori. Currently, Longest Common Subsequence (LCS) algorithm stands as the most preferred algorithm for pattern matching. But the disadvantage is that common sequences can also exist in many genuine packets. Hence, the challenge lies in automatic detection of malicious patterns and filtering of the packets having such malicious patterns. This would not only put off the communication between the Botmaster and Zombie machine, but will also thus prevent user information from being sent to the botmaster.

Usually, the steganographic algorithms employ images, audio, video or text files as the medium to ensure hidden exchange of information between multiple contenders and to protect the data from the prying eyes. This paper presents a survey of text steganography method used for    hiding secret information inside some cover text. Here the text steganography algorithms based on modification of font format, font style et cetera, has advantages of great capacity, good imperceptibility and wide application range. The nonlinear character positions of different pages are targeted through out the cover with insignificant modification.  As compared to other methods, we believe that the approaches proposed convey superior randomness and thus support higher security.

The scarcity of free spectrum compels us to look for alternatives for ever increasing wireless applications. Cognitive Radios (CR) is one such alternative that can solve this problem. The network nodes having CR capability is termed as Cognitive Radio Network (CRN). To have communication in CRN a routing protocol is required. The primary goal of which is to provide a route from source to destination. Various routing protocols have been proposed and tested in idealistic environment using simulation software such as NS-2 and QualNet. This paper is an effort in the same direction but the efficacy is evaluated in realistic conditions by designing a simulator in MATLAB-7. To make the network scenario realistic obstacles of different shapes, type, sizes and numbers have been introduced. In addition to that the shape of the periphery is also varied to find the impact of it on routing protocols. From the results it is observed that the outcomes in the realistic and idealistic vary significantly. The reason for the same has also been discussed in this paper.

Compared with the conventional control systems, networked control systems (NCSs) are more open to the external network. As a result, they are more vulnerable to attacks from disgruntled insiders or malicious cyber-terrorist organizations. Therefore, the security issues of NCSs have been receiving a lot of attention recently. In this brief, we review the existing literature on security issues of NCSs and propose some security solutions for the DC motor networked control system. The typical Data Encryption Standard (DES) algorithm is adopted to implement data encryption and decryption. Furthermore, we design a Detection and Reaction Mechanism (DARM) on the basis of DES algorithm and the improved grey prediction model. Finally, our proposed security solutions are tested with the established models of deception and DOS attacks. According to the results of numerical experiments, it’s clear to see the great feasibility and effectiveness of the proposed solutions above.