Abstract
In this paper a modification of the TCP protocol is proposed that improves its robustness to packet reordering in networks controlled by ant routing algorithms. In our approach the TCP sender builds models of packet end-to-end delay and every time a DUPACK is received it utilizes these models to calculate the probability that the packet will still arrive at the receiver. Based on this probability the decision is made whether or not to retransmit the packet. The advantages of our approach are proved in a set of simulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almhana, J., Liu, Z., Choulakian, V., McGorman, R.: A Recursive algorithm for Gamma Mixture Model. In: Proceedings of IEEE ICC 2006, pp. 197–202 (2006)
Blanton, E., Allman, M.: On making TCP more robust to packet reordering. ACM Computer Communications Review, 20–30 (2002)
Bohacek, S., Hespanha, J.P., Lee, J., Lim, C., Obraczka, K.: TCP-PR: TCP for Persistent Packet Reordering, Tech. Rep., Univ. of California Santa Barbara (2003)
Boyan, J.A., Littman, M.L.: Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach. Advances in Neural Information Processing Systems 6, 671–678 (1994)
Choi, P., Yeung, D.: Predictive q-routing: a memory-based reinforcement learning approach to adaptive traffic control. Advances in Neural Information Processing Systems 8, 945–951 (1996)
Di Caro, G., Dorigo, M.: Two ant colony algorithms for best-effort routing in datagram networks. In: Proceedings of the Tenth IASTED International Conference PDCS 1998, pp. 541–546. IASTED/ACTA Press (1998)
Dijkstra, M., Roelofsen, H., Vonk, R.J., Jansen, R.C.: Peak quantification in surface-enhanced laser desorption/ionization by using mixture models. Proteomics 6, 5106–5116 (2006)
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy, Tech. Rep. 91-016, Politecnico di Milano, Dipartimento di Elettronica (1991)
Doyle, J.: Routing TCP/IP, Vol. I and II, CCIE Professional Development (1998)
Gadomska, M., Pacut, A.: Performance of Ant Routing Algorithms When Using TCP. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 1–10. Springer, Heidelberg (2007)
Gadomska, M., Pacut, A.: Recent Progress in Ant Algorithms for Fixed Telecommunication Networks: A Review. In: Evolutionary Computation and Global Optimization 2007, Prace Naukowe Politechniki Warszawskiej, Elektronika z, vol. 160, pp. 79–89 (2007)
Pacut, A., Gadomska, M., Igielski, A.: Ant-Routing vs. Q-Routing in Telecommunication Networks. In: Proceedings of the 20th ECMS Conference, pp. 67–72 (2006)
Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based load balancing in telecommunications networks. Adaptive Behavior 5(2), 169–207 (1996)
Stevens, W.R.: TCP/IP Illustrated, vol. I, II. Addison-Wesley, Reading (1994)
Yong, L., Guang-zhou, Z., Fan-jun, S.: Adaptive swarm-based routing in communication networks. Journal of Zhejiang Univ. Science 5(7), 867–872 (2004)
Zhang, N., Karp, B., Floyd, S., Peterson, L.: RR-TCP: A reordering-robust TCP with DSACK, Tech. Rep. TR-02-006, ICSI, Berkeley, CA (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gadomska-Kudelska, M., Pacut, A. (2010). TCP Modification Robust to Packet Reordering in Ant Routing Networks. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12242-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-12242-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12241-5
Online ISBN: 978-3-642-12242-2
eBook Packages: Computer ScienceComputer Science (R0)