نتایج جستجو برای: multi constrained routing
تعداد نتایج: 580326 فیلتر نتایج به سال:
With the increasing density of VLSI circuits, interconnection wires are getting packed even closer. This has increased the effect of interaction between wires on circuit performance and hence, the importance of controlling crosstalk. Maze routing is a robust and general approach which can be used in many situations including multi-layer interconnections. In this paper, we consider crosstalk avo...
Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in ...
Qos routing protocol design for mobile ad-hoc networks is more challenging than wire lane network. Mainly due to node mobility, multi hop communications, contention for channel access and lack of central ordination.QoS guarantees are required by the most of the applications. Most optimal route has to be selected from source to destination by using QoS routing protocol. Many routing protocols ar...
in recent years, routing has been the most focused area in ad hoc networks research. on-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. most proposed on-demand routing protocols are built and relied on single route for each data session. whenever there is a link disconnection on the active ro...
MANET is a collection of wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary adhoc network topologies. The different features of Mobile Adhoc Network are Distributed operations, Multi-hop routing, Dynamic topology, Energy constrained operations etc. Routing protocols help nodes in MANET to communicate with each other. In Unipath routing protocols sin...
We prove the existence of an oblivious routing scheme that is -competitive in terms , thus resolving a well-known question routing. Concretely, consider undirected network and set packets each with its own source destination. The objective to choose path for packet, from destination, so as minimize defined follows: dilation maximum hop length, congestion number paths include any single edge. ob...
With the recognition of ad-hoc networks, several routing protocols are designed for route discovery and also the route maintenance. Because mobile ad-hoc networks differs from the traditional wired networks. They have certain unique characteristics which can cause difficulties for providing QoS in such networks. The unique characteristics are dynamically varying network topology, lack of precis...
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید