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.
Traditional routing algorithms have many drawbacks such as worse resource utilization and stability. Present investigations focus on how to mitigate them in traditional algorithms rather than design a new algorithm to terminate them. In this paper, a novel distributed routing algorithm based on available multi-nexthop is proposed. This is different from traditional single-nexthop schemes. The nodes...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one ldquonearestrdquo member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant...
With the fast growth of the routing table sizes in backbone routers, reducing the size of routing tables on network becomes to be a basic problem in networking. After optimizing the content of a routing table, further reduction can be achieved by renumbering the address assigned to networks. In this paper, we propose a heuristic address assignment algorithm based on probability in order to reduce...
Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm that embeds combinatorial unit disk graphs (CUDGs - a CUDG is a UDG without any geometric information) into O(log2n)- dimensional space, permitting greedy routing with constant stretch. To the best of our knowledge, this is...
In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constructing a directed acyclic graph (DAG) which includes all edges in the network. We define new DAG construction problems with the objectives of 1) maximizing the minimum connectivity, 2) maximizing the minimum max-flow, and 3)...
As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms to fail. In this paper, we propose a novel geographic routing algorithm called ldquoGreedy Forwarding with VIrtual Position (ViP)rdquo. We introduce virtual position as the middle position of all direct neighbors of a node....
This paper presents a new approach for solving network routing optimization problems. In particular, the goal is to optimize the traffic in the network structured event-driven systems as well as to provide means for efficient adaptation of the system to changes in the environment-i.e. when some nodes and/or links fail. Many network routing optimization problems belong to the class of NP hard problems,...
Sometimes the backbone network of Internet experiences congestion because traffic is not distributed rationally. This fact may lead network resources utilized inefficiently. The main idea for load balancing is to alter the route for some traffic. But current approaches with this idea often get such a long route that decrease the quality of service. This paper presents a new flow routing adjustment...
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The consequent problem to assign channels to radios has been recently investigated and its relation to the routing problem has been revealed. The joint channel assignment and routing problem has been shown to be NP-complete and hence mainly heuristics have been proposed. However, such...
Routing problems which include a QoS based path control play a key role in broadband communication networks. We analyze here an algorithmic procedure based on branch and price algorithm and on the flow deviation method to solve a nonlinear k-splittable flow problem. The model can support end-to-end delay bounds on each path and we compare the behavior of the algorithm with and without these constraints...
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.