A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Venkatesh Sharma, K.
- Role of Probabilistic Packet Marking Mechanism in Large Scale IP Trace Backs
Authors
1 CSE Dept, Sri Indu College of Engg & Tech, Hyd, IN
2 Sri Indu College of Engg & Tech , Hyd, IN
3 Sri Indu College of Engg & Tech, Hyd, IN
Source
Wireless Communication, Vol 2, No 9 (2010), Pagination: 257-266Abstract
An approach to IP trace back based on the probabilistic packet marking paradigm has been explained in this paper. Our approach, which we call randomize and link uses large checksum cords to link messages fragments in a way that is highly scalable, for the checksums serve both as associative addresses and data integrity verifiers. The main advantage of these checksum cords is that they spread the addresses of possible router messages across a spectrum that is too large for the attacker to easily create messages that collide with legitimate messages.
Keywords
Associate Addresses, Checksum Cords, Distributed Denial of Services (DDOS), IP, IP Spoofing, Probabilistic Packet Marking, Trace Back.- Rate Allocation and Network Lifetime Problems for Wireless Sensor Networks
Authors
1 CSE dept. at Sri Indu College of Engineering & Technology, IN
2 JNTu, Hyderabad, IN
3 Sri Indu College of Engineering & Technology, JNTU Hyderabad, IN
Source
Wireless Communication, Vol 2, No 9 (2010), Pagination: 304-317Abstract
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Since the objective of maximizing the sum of rates of all the nodes in the network can lead to a severe bias in rate allocation among the nodes, we advocate the use of lexicographical max-min (LMM) rate allocation. To calculate the LMM rate allocation vector, we develop a polynomial-time algorithm by exploiting the parametric analysis (PA) technique from linear program (LP), which we call serial LP with Parametric Analysis (SLP-PA). We show that the SLP-PA can be also employed to address the LMM node lifetime problem much more efficiently than a state-of-the-art algorithm proposed in the literature. More important, we show that there exists an elegant duality relationship between the LMM rate allocation problem and the LMM node lifetime problem. Therefore, it is sufficient to solve only one of the two problems. Important insights can be obtained by inferring duality results for the other problem.