DNS ANY Request Cannon Activity in DNS Query Packet Traffic

2013 6th International Conference on Intelligent Networks and Intelligent Systems ◽

10.1109/icinis.2013.53 ◽

2013 ◽

Cited By ~ 1

Author(s):

Yuto Takeda ◽

Yasuo Musashi ◽

Kenichi Sugitani ◽

Toshiyuki Moriyama

Keyword(s):

Query Packet

Download Full-text

Power saving technique for controlled broadcast of query packet in MANETs

International Journal of Mobile Network Design and Innovation ◽

10.1504/ijmndi.2017.10010145 ◽

2017 ◽

Vol 7 (3/4) ◽

pp. 158

Author(s):

Naeem Ahmad ◽

S. Zeeshan Hussain

Keyword(s):

Power Saving ◽

Query Packet

Download Full-text

ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS

Advances in Complex Systems ◽

10.1142/s0219525911003141 ◽

2011 ◽

Vol 14 (04) ◽

pp. 611-633 ◽

Cited By ~ 1

Author(s):

JOYDEEP CHANDRA ◽

NILOY GANGULY

Keyword(s):

Peer Networks ◽

P2p Network ◽

Network Coverage ◽

P2p Networks ◽

Extensive Simulation ◽

Back Cross ◽

Peer To Peer Networks ◽

Unstructured P2p Network ◽

Unstructured P2p ◽

Query Packet

In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross and back edges, reduces the coverage of the peers in p2p networks and also generate a large number of redundant messages, thus wasting precious bandwidth. We therefore develop models to estimate the back/cross edge probabilities and the network coverage of the peers in the presence of these back and cross edges. Extensive simulation is done on random, power-law and Gnutella networks to verify the correctness of the model. The results highlight the fact that for real p2p networks, which are large but finite, the percentage of back/cross edges can increase enormously with increasing distance from a source node, thus leading to huge traffic redundancy.

Download Full-text