The Community for Technology Leaders
Green Image
Issue No. 03 - May/June (2012 vol. 9)
ISSN: 1545-5971
pp: 401-413
Zhang Fu , Chalmers University of Technology, Gothenborg
Philippas Tsigas , Chalmers University of Technology, Gothenborg
Marina Papatriantafilou , Chalmers University of Technology, Gothenborg
Network-based applications commonly open some known communication port(s), making themselves easy targets for (distributed) Denial of Service (DoS) attacks. Earlier solutions for this problem are based on port-hopping between pairs of processes which are synchronous or exchange acknowledgments. However, acknowledgments, if lost, can cause a port to be open for longer time and thus be vulnerable, while time servers can become targets to DoS attack themselves. Here, we extend port-hopping to support multiparty applications, by proposing the BIGWHEEL algorithm, for each application server to communicate with multiple clients in a port-hopping manner without the need for group synchronization. Furthermore, we present an adaptive algorithm, HOPERAA, for enabling hopping in the presence of bounded asynchrony, namely, when the communicating parties have clocks with clock drifts. The solutions are simple, based on each client interacting with the server independently of the other clients, without the need of acknowledgments or time server(s). Further, they do not rely on the application having a fixed port open in the beginning, neither do they require the clients to get a "first-contact” port from a third party. We show analytically the properties of the algorithms and also study experimentally their success rates, confirm the relation with the analytical bounds.
Clock drift, data communication, denial of service attack, reliability, application.
Zhang Fu, Philippas Tsigas, Marina Papatriantafilou, "Mitigating Distributed Denial of Service Attacks in Multiparty Applications in the Presence of Clock Drifts", IEEE Transactions on Dependable and Secure Computing, vol. 9, no. , pp. 401-413, May/June 2012, doi:10.1109/TDSC.2012.18
195 ms
(Ver 3.1 (10032016))