Distributed star coloring of network for IP traceback

Regular Contribution
First Online:
  • 184 Downloads

Abstract

IP traceback using packet marking technique allows direct traceback of attackers. Under this strategy en route routers inject mark into packets which is later used to unambiguously identify the source of an attack. Star coloring approach allows the mark to be reused, thereby saving bit space and at the same time explicitly identify the attacker. As the Internet structure is unknown, in the present work we propose a distributed approach of assigning color (mark) to routers such that the star color template is followed without consideration of the graph structure. An algorithm is proposed to minimize the color assignment conflict. The convergence of the algorithm is also discussed. Simulation study is presented to support the convergence analysis.

Keywords

Distributed star coloring Hashing Convergence 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Shui, Y.: Distributed Denial of Service Attack and Defense. Springer, New York (2014)Google Scholar
  2. 2.
    Welzel, A., Rossow, C., Bos, H.: On measuring the impact of DDoS Botnets. In: EuroSec’14 Proceedings of the 7th European Workshop on System Security, Article no. 3, pp. 3:1–3:6. ACM (2014)Google Scholar
  3. 3.
    Snoren, A., Patridge, C., Sanchez, L., Jones, C., Tchskounito, F., Kent, S., Strayer, W.: Hash-based IP traceback. In: Proceedings of ACM SIGCOM’01, San Diego, 3–14, August (2001)Google Scholar
  4. 4.
    Bellovin, S.M.: ICMP traceback messages, Internet Draft:draft-ietf-itrace-04.txt, February, 2000Google Scholar
  5. 5.
    Savage, S., Wetherall, D., Karlin, A., Anderson, T.: Network support for IP traceback. IEEE ACM Trans. Netw. 9, 226–237 (2001)CrossRefGoogle Scholar
  6. 6.
    Belenky, A., Answari, N.: On deterministic packet marking. J. Comput. Netw. 51(10), 2677–2700 (2007)CrossRefMATHGoogle Scholar
  7. 7.
    Alenezi, Mohammed N., Reed, Martin J.: Uniform DoS traceback. Comput. Secur. 45, 17–26 (2014)CrossRefGoogle Scholar
  8. 8.
    Muthuprasanna, M., Manimaran, G., Alicherry, M., Kumar, V.: Coloring the internet: IP traceback. In: 12th International Conference on Parallel and Distributed System (ICPADS ’06), Proceedings July, 2006Google Scholar
  9. 9.
    Sairam, A.S., Roy, S., Sahay, R.: Coloring networks for attacker identification and response. Secur. Commun. Netw. 8, 751–768 (2014). doi: 10.1002/sec.1022 CrossRefGoogle Scholar
  10. 10.
    Das, S., Sajal, Finocchi, I., Petreschi, R.: Star-coloring of graphs for conflict-free access to parallel memory systems. In: Proceedings in Parallel and Distributed Processing Symposium, IEEE (2004)Google Scholar
  11. 11.
    Lloyd, E., Ramanathan, S.: On the complexity of distance-2 coloring. In proceedings IEEE ICCI, 1992Google Scholar
  12. 12.
    Leith, D.J., Clifford, P.: A self-managed distributed channel selection algorithm for WLANs. In: 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 1–9. IEEE (2006)Google Scholar
  13. 13.
    CAIDA’s Router-Level Topology Measurements: http://www.caida.org/tools/measurement/skitter/router_topology/
  14. 14.
    Hash functions: an empirical comparison. http://www.strchr.com/hash_functions
  15. 15.
    http://www.cs.bu.edu/brite/ (accessed June 2013)
  16. 16.
    Zhai, J., Wang, K.: Optimization of probabilistic packet marking traceback techniques based on graph theory. AISS 5(7), 511–521 (2013)CrossRefGoogle Scholar
  17. 17.
    Roy, S., Sairam, A.S., IP traceback in star colored networks. In: 5th International Conference on Communication Systems and Networks (COMSNETS), (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Indian Institute of Technology PatnaBiharIndia

Personalised recommendations