Filters








193,287 Hits in 6.5 sec

CONTRACT: Incorporating Coordination into the IP Network Control Plane

Zheng Cai, Florin Dinu, Jie Zheng, Alan L. Cox, T.S. Eugene Ng
2010 2010 IEEE 30th International Conference on Distributed Computing Systems  
This is because an IGP blindly routes traffic along the shortest paths based on link weights, and it is completely oblivious to the interactions between SLA compliance, load balancing and traffic policing  ...  Under this framework, routers continue to operate autonomously, but they also coordinate their actions with a centralized network controller, which evaluates the impact of routing changes, decides whether  ...  As a result, a router not only needs to compute the local routing table rt(x n (t i )), but also needs to compute all-pair shortest path routing state of the entire network, based on its current link state  ... 
doi:10.1109/icdcs.2010.77 dblp:conf/icdcs/CaiDZCN10 fatcat:mcwdpaa7abhgbkeuf2dhbitlzi

Is Machine Learning Ready for Traffic Engineering Optimization?

Guillermo Bernardez, Jose Suarez-Varela, Albert Lopez, Bo Wu, Shihan Xiao, Xiangle Cheng, Pere Barlet-Ros, Albert Cabellos-Aparicio
2021 2021 IEEE 29th International Conference on Network Protocols (ICNP)  
In our evaluation, we compare our MARL+GNN system with DEFO, a network optimizer based on Constraint Programming that represents the state of the art in TE.  ...  We address this open question through a comparative analysis between the state of the art in ML and the state of the art in TE.  ...  As a result, there exists a rich body of proposals based on different technologies (e.g., flow-based routing, link-state protocols, overlay networking) that target various optimization goals and network  ... 
doi:10.1109/icnp52444.2021.9651930 fatcat:afr2tnqzuzgonmp3zsge6lkaii

A localized adaptive proportioning approach to QoS routing

S. Nelakuditi, Zhi-Li Zhang
2002 IEEE Communications Magazine  
We have shown that it is possible to compute near-optimal proportions using only locally collected information.  ...  In QoS routing, paths for flows are selected based on knowledge of resource availability at network nodes and the QoS requirements of flows.  ...  Thus, wdp selects widest paths that are mutually disjoint with regard to bottleneck links. PERFORMANCE EVALUATION We now evaluate the performance of the proposed schemes.  ... 
doi:10.1109/mcom.2002.1007410 fatcat:bybpa7ima5dx5ptqulxto4neqq

Could Proactive Link-State Routed Wireless Networks Benefit from Local Fast Reroute?

Audun Fosselie Hansen, Geir Egeland, Paal Engelstad
2008 6th Annual Communication Networks and Services Research Conference (cnsr 2008)  
Support for fast and local reroute should therefore be added as a feature to proactive link-state based routing protocols.  ...  To our best knowledge, no published work presents a similar study on fast recovery in proactive link-state routed wireless networks.  ...  Strict local rerouting can be an advantage of proactive link-state routed schemes over reactive multipath schemes where strictly local rerouting cannot always be supported.  ... 
doi:10.1109/cnsr.2008.26 dblp:conf/cnsr/HansenEE08 fatcat:4hwl7ldskbcdxavmo5v56hws7y

On localized control in QoS routing

S. Nelakuditi, S. Varadarajan, Zhi-Li Zhang
2002 IEEE Transactions on Automatic Control  
We compare the performance of these localized proportional routing models with that of a global optimal proportional model that has knowledge of the global network QoS state.  ...  In this note, we study several issues in the design of localized quality-of-service (QoS) routing schemes that make routing decisions based on locally collected QoS state information (i.e., there is no  ...  Before we proceed to evaluate the performance of these schemes, it is interesting to contrast the link based and path based localized proportional routing models with the global optimal proportional routing  ... 
doi:10.1109/tac.2002.1008368 fatcat:6zanhno7yvas3ca5qf7bxjxcmy

Circuit-Elimination based Link-State Routing in Mobile Ad-hoc Networks

Yaoda Liu, Hans-Peter Schwefel, Frank Y. Li, Anders Nickelsen
2007 2007 4th International Symposium on Wireless Communication Systems  
In this paper, we propose a new message dissemination algorithm which utilizes such techniques to reduce the number of nodes that generate or forward link state advertisements in link state routing protocols  ...  Simulation results with both static and dynamic network topologies demonstrate the potential of the proposed algorithm to reduce routing overhead, compared with a benchmark link state routing protocol,  ...  The proposed circuit elimination based link state routing protocol is introduced in Sec. III, followed by the detailed simulation-based performance evaluation in Sec. IV.  ... 
doi:10.1109/iswcs.2007.4392327 fatcat:uw562cozfvdvziwbhifwryyr3q

CEDAR: a core-extraction distributed ad hoc routing algorithm

R. Sivakumar, P. Sinha, V. Bharghavan
1999 IEEE Journal on Selected Areas in Communications  
CEDAR has three key components: a) the establishment and maintenance of a selforganizing routing infrastructure called the core for performing route computations; b) the propagation of the link state of  ...  link-state routing for stable networks.  ...  state-based routing in the domain of QoS routing.  ... 
doi:10.1109/49.779926 fatcat:pe5rmsjthvdgtfkpwn2fvs7qf4

CEDAR: a core-extraction distributed ad hoc routing algorithm

P. Sinha, R. Sivakumar, V. Bharghavan
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
CEDAR has three key components: a) the establishment and maintenance of a selforganizing routing infrastructure called the core for performing route computations; b) the propagation of the link state of  ...  link-state routing for stable networks.  ...  state-based routing in the domain of QoS routing.  ... 
doi:10.1109/infcom.1999.749269 dblp:conf/infocom/SinhaSB99 fatcat:awrvsqkoybhnfc5rnn64adbog4

OLSR Parameter Tunning

Rupa Kamboj, Mohinder Singh
2017 International Journal of Advanced Research in Computer Science and Software Engineering  
In this paper our focus on Optimized Link State Routing Protocol (OLSR) [29] .  ...  Sugendha, Bandana Sharma may 2015: This paper presents a class of routing protocols for vehicular ad hoc networks (VANETs) called the Optimized link state routing protocol (OLSR).  ...  In this paper, we offer an integrated protocol for the optimized link state routing (OLSR) and OLSR based localization (ROULA). Our protocol enables simultaneous localization and routing.  ... 
doi:10.23956/ijarcsse/v7i5/0165 fatcat:23xkyx54ozhfxmxhgydkoueqbq

Using Feedback in Collaborative Reinforcement Learning to Adaptively Optimize MANET Routing

J. Dowling, E. Curran, R. Cunningham, V. Cahill
2005 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
Simulation results show how feedback in the selection of links by routing agents enables SAMPLE to adapt and optimize its routing behavior to varying network conditions and properties, resulting in optimization  ...  We evaluate an implementation of CRL in a routing protocol for mobile ad hoc networks, called SAMPLE.  ...  Firstly, a MDP termination cost, , provides agents with evaluative feedback on either the performance of a local solution to the DOP or the performance of a neighbor solving the delegated DOP.  ... 
doi:10.1109/tsmca.2005.846390 fatcat:6ogbtbtmkfcjvakixrgyb43yni

Emergent Consensus in Decentralised Systems Using Collaborative Reinforcement Learning [chapter]

Jim Dowling, Raymond Cunningham, Anthony Harrington, Eoin Curran, Vinny Cahill
2005 Lecture Notes in Computer Science  
We evaluate CRL experimentally in SAMPLE by comparing its system routing performance in the presence of changing environmental conditions, such as congestion and link unreliability, with existing ad-hoc  ...  update their local, partial view of the system.  ...  will be sub-optimal to route vehicles along this link.  ... 
doi:10.1007/11428589_5 fatcat:ohc3zuxqb5e6vegujb6u2bt5sm

Implementation of a Locator-Based Route Switching Scheme for Improved Routing in Proxy Mobile IPv6

M. Okwori, E. N. Onwuka, A. M. Aibinu, O. C. Ugweje
2014 International Journal of Wireless and Microwave Technologies  
This however has a non-optimal packet route as a result of the triangular routing problem. This creates a bottle neck at the Local Mobility Anchor (LMA) thereby increasing packet delays.  ...  This paper presents the implementation of a locator-based route switching scheme on OPNET Modeler. The Mobility Access Gateway (MAG) and the LMA were enhanced by making them intelligent.  ...  Section four presents the performance evaluation of the network models developed and the route switching scheme.  ... 
doi:10.5815/ijwmt.2014.04.01 fatcat:w3qllnhlszgbdjebtvvafhcaua

A Survey on Multicast Routing Protocols for Mobile Ad-Hoc Networks

Prabhu Kichadi, Yashavanth T R
2015 International Journal of Engineering Research and  
like bandwidth, time and link costs.  ...  To provide reliable multicasting suitable for mobile ad hoc networks, many researchers have continued trying to optimize existing multicast routing protocols.  ...  In future a more critical performance evaluation of these protocols shall be done on the basis of simulations and varying performance metrics.  ... 
doi:10.17577/ijertv4is041397 fatcat:uhtft52s5fc53l7vto5bal6dza

An evaluation of scalable application-level multicast built using peer-to-peer overlays

M. Castro, M.B. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, A. Wolman
2003 IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)  
This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays  ...  Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for treebased multicast, we show that Pastry provides better performance than CAN.  ...  In particular, we evaluated tradeoffs between the amount of state maintained by each overlay node and routing efficiency, and between different ways of taking advantage of network locality to improve routing  ... 
doi:10.1109/infcom.2003.1208986 dblp:conf/infocom/CastroJKRTWW03 fatcat:dnmj2lsmgvclfpnkougbm27f64

OLSR Parameter Tunning

Rupa Kamboj
2017 International Journal of Advanced Research in Computer Science and Software Engineering  
OLSR) Optimized link state routing is a popular protocol used for optimize the networks. OLSR perform under various scenarios (varying node density and node speed).  ...  Keywords-Optimize link state routing protocols (OLSR),Vehicular ad-hoc network (VANET), Intelligent water drop(IWD) algorithm, Wireless multi hop network ,Genetic algorithm(GA).  ...  In this paper, we propose an integrated protocol for the optimized link state routing (OLSR) and OLSR base localization (ROULA). Our protocol enables simultaneous localization and routing.  ... 
doi:10.23956/ijarcsse/v7i3/0179 fatcat:fmiwzb7hq5cpdk7275jfa7722y
« Previous Showing results 1 — 15 out of 193,287 results