نتایج جستجو برای: routing and resource allocation

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

2006
Lijun Chen Steven H. Low Mung Chiang John C. Doyle

This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constraint and scheduling constraint using multicommodity flow variables, and formulate resource allocation in networks with fixed wireless channels (or single-rate wireless devices that can mask channel variations) as a utility maximizat...

1999
Sangwook Park Leroy B. Schwarz James E. Ward

This paper examines “distribution policies” — that is, combined system inventoryreplenishment, vehicle routing and inventory-allocation policies — designed to minimize total expected purchasing and inventory-management (i.e., inventory-holding and backordering) costs/period for a one-warehouse N-retailer “symmetric” distribution system managed under a periodic-review policy. With respect to dyn...

We develop a bicriteria model for the resource allocation problem in PERT networks, in which the total direct costs of the project as the first objective, and the mean of project completion time as the second objective are minimized. The activity durations are assumed to be independent random variables with either exponential or Erlang distributions, in which the mean of each activity duration ...

Mohammad Mahdavi Mazdeh, Saeed Yaghoubi Siamak Noori

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

Journal: :International Journal of Advanced Research in Computer Science and Software Engineering 2018

Journal: :Computers & Chemical Engineering 2005
W. Huang P. W. H. Chung

Pipeless batch plants are built to provide the ability to adapt to fast market changes. The scheduling of pipeless plants adds new challenges to the scheduling of conventional batch plants. This is because of the requirement to consider the allocation of resources and also the plant layout so that vessels can move from one processing station to another without conflict. This research investigat...

Journal: :JNW 2014
Zhijun Hu Hongbin Wang Huibin Zhang

In order to reasonable and effective distribute bandwidth to giving full play to the advantages of network resources and improve the efficiency of network data flow in heterogeneous network, this paper puts forward a heterogeneous network bandwidth allocation algorithm. The algorithm is adopted connection bandwidth constraint mechanism in the flow model, starting from the data transmission in t...

Journal: :IEEE Access 2023

Cellular vehicle-to-everything (C-V2X) communications have gained traction as they can improve safe driving, efficiency, and convenience. However, mobility the rising number of vehicles make efficiency resource allocation (RA) schemes more difficult. Different RA been proposed to share C-V2X resources effectively. Nevertheless, routing-aware has not attracted enough attention in literature. Thi...

1996
Kunyan Liu Hongbo Zhu David W. Petr Victor S. Frost Cameron Braun William L. Edwards

When designing and configuring an ATM-based B-ISDN, it remains difficult to guarantee the Quality of Service (QoS) for different service classes, while still allowing enough statistical sharing of bandwidth so that the network is efficiently utilized. These two goals are often conflicting. Guaranteeing QoS requires traffic isolation, as well as allocation of enough network resource (e.g. buffer...

Journal: :Perform. Eval. 2005
Wenjie Jiang Dah-Ming Chiu John C. S. Lui

In the past few years, overlay networks have received much attention but there has been little study on the “interaction” of multiple, co-existing overlays on top of a physical network. In addition to previously introduced concept of overlay routing strategy such as selfish routing, we introduce a new strategy called “overlay optimal routing”. Under this routing policy, the overlay seeks to min...

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

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