نتایج جستجو برای: constrained routing

تعداد نتایج: 129128  

Abbaspour, Rahim Ali , Heidari, Ali Asghar ,

Researchers and urban administrators have often considered the routing problem as one of the fundamental phases in developing hazard management systems. In this research, a routing problem is investigated and analyzed by proposing an enhanced metaheuristic algorithm based on biogeography. In this problem, the production planning, inventory management, and distribution planning have been conside...

1999
Shigang Chen Klara Nahrstedt

In a networking environment, Quality-of-Service (QoS) routing plays an important role in the provision of real-time services with guaranteed throughput and bounded end-to-end delay. Its task is to nd a routing path which has su cient resources to support the requirements imposed by the applications. We propose several distributed algorithms for bandwidth-constrained routing and delay-constraine...

Journal: :Computer Communications 2002
Hatem Bettahar Abdelmadjid Bouabdallah

Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We belie...

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

2015
Prosenjit Bose Rolf Fagerberg André van Renssen Sander Verdonschot

Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P , called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained θm-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture θ = 2π/m, and adding an edge ...

Journal: :DEStech Transactions on Engineering and Technology Research 2017

Journal: :IEEE/ACM Transactions on Networking 2000

Journal: :CoRR 2010
Ling Zhou Wei-xiong Ding Yu-xi Zhu

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. I...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید