Erol Gelenbe
Skip Abstract Section
Abstract
Network software adapts to user needs and load variations and failures to provide reliable communications in largely unknown networks.
- Bennett, J.C.R., Partridge, C., and Shectman, N. Packet reordering is not pathological network behavior. IEEE/ACM Transactions on Networks 7, 6 (1999), 789--798. Google Scholar
Digital Library
- Boyan, J.A. and Littman, M.L. Packet routing in dynamically changing networks: A reinforcement learning approach. In Proceedings of the Advances in Neural Information Processing Systems Conference (Denver). Morgan Kaufmann, San Francisco, 1994.Google Scholar
- Chen, G., Branch, J., and Szymanski, B.K. A self-selection technique for flooding and routing in wireless ad-hoc networks. Journal of Network and Systems Management 14, 3 (2006), 359--380. Google ScholarDigital Library
- Di Caro, G. and Dorigo, M. Antnet: Distributed stigmergetic control for communication networks. Journal of AI Research 9 (1998), 317--365. Google ScholarDigital Library
- Dobson, S. Denazis, S., Fernández, A., Gaïti, D., Gelenbe, E., Massacci, F., Nixon, P., Saffre, F., Schmidt, N., and Zambonelli, F. A survey of autonomic communications. ACM Transactions on Autonomous and Adaptive Systems 1, 2 (2006), 223--259. Google ScholarDigital Library
- Gao, R., Dovrolis, C. and Zegura, E. Avoiding oscillations due to intelligent route control systems. In Proceedings of the 25th IEEE International Conference on Computer Communications (Barcelona, Catalunya, Apr. 23--29). IEEE Press, New York, 2006.Google ScholarCross Ref
- Gelenbe, E., Sakellari, G., and D'Arienzo, M. Admission of QoS-aware users in a smart network. ACM Transactions on Autonomous and Adaptive Systems 3, 1 (Mar. 2008), 1--28. Google ScholarDigital Library
- Gelenbe, E. A diffusion model for packet travel time in a random multihop medium. ACM Transactions on Sensor Networks 3, 2 (June 2007). Google ScholarDigital Library
- Gelenbe, E. and Loukas, G. A self-aware approach to denial-of-service defence. Computer Networks: The International Journal of Computer and Telecommunications Networking 51, 5 (Apr. 2007), 1299--1314. Google ScholarDigital Library
- Gelenbe, E., Liu, P., and Lainé, J. Genetic algorithms for route discovery. IEEE Transactions on Systems, Man, and Cybernetics B 36, 6 (Dec. 2006), 1247--1254. Google ScholarDigital Library
- Gelenbe, E., Lent, R., and Nunez, A. Self-aware networks and QoS. Proceedings of the IEEE 92, 9 (Sept. 2004), 1478--1489.Google ScholarCross Ref
- Gelenbe, E. and Lent, R. Power-aware ad hoc cognitive packet networks. Ad Hoc Networks 2, 3 (July 2004), 205--216.Google ScholarCross Ref
- Gelenbe, E., Gellman, M., Lent, R., Liu, P., and Su, P. Autonomous smart routing for network QoS. In Proceedings of the First International Conference on Autonomous Computing (May 17--19). IEEE Computer Society Press, New York, 2004, 232--239. Google ScholarDigital Library
- Gelenbe, E., Lent, R., and Xu, Z. Measurement and performance of a cognitive packet network. International Journal of Computer and Telecommunications Networking 37 (2001), 691--791. Google ScholarDigital Library
- Gelenbe, E. Learning in the recurrent random neural network. Neural Computation 5, 1 (1993), 154--164. Google ScholarDigital Library
- Gellman, M. Oscillations in self-aware networks. Proceedings of the Royal Society A 464, 2096 (2008), 2169--2186.Google ScholarCross Ref
- Keralapura, R., Chuah, C.N., Taft, N., and Iannaccone, G. Can coexisting overlays inadvertently step on each other? In Proceedings of the 13th IEEE International Conference on Network Protocols (Boston, Nov. 6--9). IEEE Computer Society, New York, 2005, 201--214. Google ScholarDigital Library
- Khanna, A. and Zinky, J. The revised Arpanet routing metric. SIGCOMM Review 19, 4 (1989), 45--56. Google ScholarDigital Library
- Koenig, S., Szymanski, B.K., and Liu, Y. Efficient and inefficient ant coverage methods. Annals of Mathematics and Artificial Intelligence 31, 1--4 (2001) 41--76. Google ScholarDigital Library
- Labovitz, C., Malan, G.R., and Jahanian, F. Internet routing instability. IEEE/ACM Transactions on Networks 6, 5 (1998), 515--528. Google ScholarDigital Library
- Liu, P. and Gelenbe, E. Recursive routing in the cognitive packet network. In Proceedings of the Third International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (May 21--23, 2007, Trento, Italy), 21--23.Google ScholarCross Ref
- Malkin, G. RIP Version 2. RFC 2453, 1998; http://www.faqs.org/rfcs/rfc2453.html.Google Scholar
- Moy, J. OSPF Version 2. RFC 2328, 1998; http://www.ietf.org/rfc/rfc2328.txt.Google Scholar
- Öke, G.G., Loukas, G., and Gelenbe, E. Detecting denial-of-service attacks with Bayesian classifiers and the random neural network. In Proceedings of the IEEE International Conference on Fuzzy Systems (London, 2007), 964--1969.Google ScholarCross Ref
- Papadimitriou, C.H. and Yannakakis, M. Shortest paths without a map. Theoretical Computer Science 84, 1 (1991), 127--150. Google ScholarDigital Library
- Ranadive, U. and Medhi, D. Some observations on the effect of route fluctuation and network link failure on TCP. In Proceedings of the 10th International Conference on Computer Communications and Networks (Oct. 15--17, 2001), 460--467.Google ScholarCross Ref
- Sakellari, G. and Gelenbe, E. Adaptive resilience of the cognitive packet network in the presence of network worms. In Proceedings of the NATO Symposium on C3I for Crisis, Emergency and Consequence Management (May 11--12, 2009, Bucharest, Romania).Google Scholar
- Shaikh, A., Varma, A., Kalampoukas, L., and Dube, R. Routing stability in congested networks: Experimentation and analysis. In Proceedings of SIGCOMM 2000, (Stockholm, Aug. 29-Sept. 2). ACM Press, New York, 2000, 163--174. Google ScholarDigital Library
- Thorup, M. and Zwick, U. Compact routing schemes. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Heraklion, Crete Island, Greece, July 4--6). ACM Press, New York, 2001, 1--10. Google ScholarDigital Library
Index Terms
- Steps toward self-aware networks
Recommendations
Self-Aware Networks
SASO '11: Proceedings of the 2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing SystemsAs packet networks become extremely large, as their applications and end users become more diverse and extremely numerous, a design based on a single view of how a network should operate becomes harder to justify. Thus each part of the network should be ...
Analyzing Latency-Aware Self-Adaptation Using Stochastic Games and Simulations
Special Section on Best Papers from SEAMS 2014 and Regular ArticlesSelf-adaptive systems must decide which adaptations to apply and when. In reactive approaches, adaptations are chosen and executed after some issue in the system has been detected (e.g., unforeseen attacks or failures). In proactive approaches, ...
New Self-Routing Permutation Networks
This contribution is focused on self-routing permutation networks capable of routing all n! permutations of its n inputs to its n outputs without internal conflict. First, a self-routing permutation network named BNB SRPN is described. The network ...
Comments