The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The improvement of the scalability of routing decisions is quite relevant in modern telecommunication networks. In this regard, effective approach is associated with the implementation of hierarchical routing. This involves carrying out a structural and functional decomposition of the network, based on the introduction and supporting of multi-level routing decisions. However, the existing protocol...
Algebra has made the tasks of defining routing algorithms and proving their correct operation very clear. However, current results in the modelling of multipath policy routing protocols only prove correct behaviour for models that exhibit a strict decrease in the preference of a path with every added link. This is very rigid for multipath routing. For instance it does not allow a link attribute to...
In wireless ad hoc networks, multiple descriptions (MD) coding of video can effectively improve the quality of transmission, but there is a problem that how to choose the optimal path. In order to solve the problem, particle swarm optimization algorithm with adaptive mutation (AMPSO) is presented in this paper, which is used to choose transport path of MD video. This method can find the optimal solution...
There are several situations in which it would be advantageous to allow route preferences to be dependent on which neighbor is to receive the route. This idea could be realised in many possible ways and could interact differently with other elements of route choice, such as filtering: not all of these will have the property that a unique routing solution can always be found. We develop an algebraic...
Traffic engineering is essential for the performance optimization of operational networks, which render the indispensable platform for web applications like web search and multimedia communication. We will review recent progress in intra-domain routing, which is a critical ingredient of traffic engineering. Our focus will be on techniques handling traffic uncertainty in networks. We review three classes...
Multi-path routing is a valuable on-line technique to deal with unpredictable and variable traffic patters, mostly for intra-domain TE, multi-homing, wireless mesh networks, metropolitan access networks, and has been shown efficient for a large spectrum of future traffic scenarios. In this paper we analyze the performance of MIRTO, TEXCP and TRUMP, three recently proposed multi-path routing algorithms...
In this paper, we present a fully decentralized algorithm for fair resource sharing between multiple bag-of-tasks applications in a grid environment. This algorithm is inspired from related work on multi-path routing in communication network. An interesting feature of this algorithm is that it allows the choice of wide variety of fairness criteria and achieves both optimal path selection and flow...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.