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.
Our goal is to maintain 1+1 path protection as much as possible after a single failure occurs for ensuring carrier-grade reliability. An obvious approach is preparing a third path that is disjoint with the primary and backup paths, but applicability to actual networks with this approach is extremely restricted. From our evaluation, the recovery ratio for reconstructing 1+1 path protection decreases...
We propose a novel path-provisioning algorithm that can cost-effectively create bandwidth-on-demand services. Its use of the `make before break' rerouting technique reduces blocking probability while preventing service disruption.
We have designed and implemented a radio access network selection algorithm for heterogeneous wireless network environment, in which mobile terminals can adaptively and seamlessly handover among different radio access technologies. We propose a radio resource usage optimization algorithm without centralized computation on the network side, which is based on the Hopfield neural network dynamics whose...
We propose novel dynamic network control algorithms that reduce the blocking probability for dynamic bandwidth service provisioning. The expected network services include on-demand broad bandwidth provisioning services and layer one VPN. The important service attribute of fairness in terms of path length is effectively achieved by introducing a simple weighting function that considers path length...
This paper proposes a network design method based on adaptive selection of "facility-adding" and "path-routing" policies under the condition that traffic keeps increasing. In a network where a path is provided as a service, when a new path demand is generated and if it is impossible to accommodate the path along the shortest route with only existing facilities (links and nodes,...
We verify that our proposed path provisioning algorithm, which makes use of dasiamake before breakpsila rerouting, reduces blocking while preventing service disruption. It is also shown that hitless rerouting can be realized without significantly increasing blocking probability.
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.