A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
 proposed a distributed algorithm for the integer (w, r) adversary. It will be interesting to design a distributed algorithm for the problem considered here. ... Gamarnik  considered this model and showed that stable policies exist for this system if and only if the associated fractional multicommodity flow problem has value at most 1. ...doi:10.1007/978-3-540-45198-3_14 fatcat:7ku4lxb4h5catorqlm32hgn4jy
 proposed a distributed algorithm for the integer (w, r) adversary. It will be interesting to design a distributed algorithm for the problem considered here. ... Gamarnik  considered this model and showed that stable policies exist for this system if and only if the associated fractional multicommodity flow problem has value at most 1. ...doi:10.1007/s00453-005-1162-1 fatcat:xboe46eievg37b2qhmilz5z3km
It is typical for video streaming service providers (such as NetFlix) to rely on services from cloud providers (such as Amazon), in order to build a scalable video streaming platform with high availability ... We present Jetway, a new set of algorithms designed to minimize cloud providers' operational costs on interdatacenter video traffic, by optimally routing video flows in an online fashion. ... For this reason, we have implemented a daemon process that is able to send, receive, and relay video traffic, referred to as a Jet. ...doi:10.1145/2393347.2393388 dblp:conf/mm/FengLL12 fatcat:zo3txo7v2ngynkipvrlis3ytne
for joint optimization of link capacity assignment, transmission scheduling, and routing in fair multicommodity flow networks. " Wlodzimierz Ogryczak Hanan Luss Dritan Nace Michał Pióro ... Acknowledgments The editors would like to thank all the authors and reviewers for their valuable contribution to this special issue. ... In "Fair optimization of video streaming quality of experience in LTE networks using distributed antenna systems and radio resource management, " E. Yaacoub and Z. ...doi:10.1155/2014/340913 fatcat:rn4bxlqwejf77diwav7ctccg4u
This paper develops di- agnostics for the special case of a min-cost network flow problem, which is a richly structured subset of linear programming models. ... The paper deals with the k paths problem in graphs for k = 3 and with the multicommodity flow problem in networks with capacities on arcs, also for three commodities. ...
We show that the conditions result in high flow acceptance rates when used in multi-hop wireless networking problems such as QoS routing and multicommodity flow problems. ... Because multiple antennas offer wireless networks a potential capacity increase, they are expected to be a key part of next-generation wireless networks to support the rapidly emerging multimedia applications ... (c) Two-stream flow f . Fig. 1 . 1 Antenna array processing. ...doi:10.1109/jsac.2007.070504 fatcat:zoygk64wfrdsdnjelknc6v326y
We formulate the problem into a common terminal multicommodity problem and develop an optimal algorithm to solve this problem in polynomial time. ... Given a set of hybrid LAS and HAS requests, we maximize the total revenue of LAS + HAS by selectively provisioning a portion of the service requests in the FSO access network. ... Figure 4 illustrates a basic common terminal-sink multicommodity flow formulation for our problem. ...doi:10.1364/jon.4.000391 fatcat:ttlfl5xlo5hapmzxln2ig756gy
Summary: “We propose a new method based on minimum mean cycle cancelling for multicommodity flow problems with separa- ble convex cost ruling out saturated capacities. ... (F-CLEF2-LIO; Aubiére A minimum mean cycle cancelling method for nonlinear multicommodity flow problems. (English summary) European J. Oper. Res. 121 (2000), no. 3, 532-548. ...
The mathematical model of functioning of a telecommunication network is developed. ... Comparing of results of mathematical simulation by several criteria was allowed to range heuristic algorithms on a level of fitness to dynamic filling of telecommunication networks. ... If the elementary requirement flow is equiprobable for all pole pairs, then (9) is simplified and becomes: for requests equiprobable distribution. ...doi:10.1016/j.procs.2015.11.020 fatcat:iu7gljizqnccnpshkac2sshena
The multicommodity (m.c.) flow problem consists of finding the routes for all such commodities, which minimize (or maximize) a well-defined performance function (e.g., cost or delay), such that a set of ... A "Flow Deviation" (FD) method for the solution of these non-linear, unconstrained flow problems is described which is quite similar to the gradient method for functions of continuous variables. ... A typical vehicle is equipped with a communication module for sensed data distribution using DSRC or other radio transceivers, a sensing module, a processing module and a database module for traffic information ...doi:10.1016/j.comnet.2014.04.001 fatcat:5ngpqj3ywzayvbgcd3mgmmi4xa
Hence, a fine-grain decomposition scheme is developed that is suitable for massively parallel computer architectures of the SIMD (i.e., single instruction stream, multiple data stream) class. ... We develop algorithms for nonlinear problems with multicommodity transportation constraints. ... Acknowledgements: Professor Yair Censor deserves honorary co-authorship on this paper for numerous illuminating discussions on row-action algorithms and his constant encouragement. ...doi:10.1137/0801038 fatcat:in4zj3rmj5ci5o3253olljf6ha
We present an optimization framework for traffic engineering with migration and develop algorithms that determine which edge links should migrate, where they should go, and how often they should move. ... We propose a new approach that also adaptively changes where traffic enters and leaves the network-changing the "traffic matrix", and not just the intradomain routing configuration. ... TLU minimization can be formulated as minimum-cost multicommodity flow and is thus computable using existing algorithms for computing multicommodity flows. ...doi:10.1145/2185376.2185385 fatcat:lb6qasphlnhulclt3y2d6tennq
The Eulerian-Lagrangian model is based on a multicommodity network flow model constructed from historical air traffic data. ... A new paradigm for building an Eulerian-Lagrangian cell transmission model for air traffic flow is developed. ... The authors are grateful to Gano Chatterji for his suggestions regarding the models of the National Airspace System. ...doi:10.2514/1.31717 fatcat:mng2xkrufzd33lmwy4gqubqhxi
An integer linear programming (ILP) formulation based on network flow model is provided to determine the optimal SS-Tree structures for achieving such design goals. ... communication strategies for WSNs. ... Acknowledgments The authors sincerely thank the anonymous reviewers for their constructive comments and suggestions. ...doi:10.1016/j.comcom.2006.02.009 fatcat:3uspyudtlfgs7h5e265bxja4wi
From the summary: “The purpose of this paper is to propose a multicommodity dynamic flow model for predicting traffic con- gestion on a multidestination network. ... Summary: “In this note we study multiclass queueing networks with fluid arrival streams and service processes. ...
« Previous Showing results 1 — 15 out of 482 results