Multi Directional Geographical Traceback with n Directions Generalization
نویسندگان
چکیده
منابع مشابه
An Investigation of 2^n Direction Geographical Traceback using Direction Ratio Sampling Algorithm (DRSA) & IP Traceback Strategies
DoS / DDoS(Distributed Denial of Service) attacks deny regular, internet services accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Several traceback schemes are available to mitigate these attacks. The simulation approach also can be used to test the performing effects of different marking schemes in larg...
متن کاملAn Investigation of 2n Direction Geographical Traceback Using Direction Ratio Sampling Algorithm (DRSA) & IP Traceback Strategies
DoS / DDoS(Distributed Denial of Service) attacks deny regular, internet services accessed by legitimate users, either by blocking the services completely, or by disturbing it completely, so as to cause customer baulking. Several traceback schemes are available to mitigate these attacks. The simulation approach also can be used to test the performing effects of different marking schemes in larg...
متن کاملMulti-Directional Distributed Searches with Aggregation
Competition and cooperation can boost the performance of search. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint satisfaction which makes use of both cooperation an...
متن کاملON THE GENERALIZATION OF N-PLE MARKOV PROCESSES
The notion of N-ple Markov process is defined in a quite general framework and it is shown that N-ple Markov processes-arel inear combinationso f some martingales
متن کاملOn multi - directional
The paper studies convergence properties of numerical optimization algorithms using the natural idea of searching in several directions and where one-processor computation is assumed. Global convergence theorems (with exact arithmetic) are proved for two classes of "descent" methods in IR n and for one class of such methods in Hilbert spaces in the framework of unconstrained problems and where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2008
ISSN: 1549-3636
DOI: 10.3844/jcssp.2008.646.651