B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm

The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capacity among the sessions. A popular criterion is max-min fairness that, in short, guarantees that each session i gets a rate λi such that no session s can increase λs without causing another session s' to end up with a rate λs/ <; λs. Many max-min fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control data being continuously transmitted to recompute the max-min fair rates when needed (because none of them has mechanisms to detect convergence to the max-min fair rates). In this paper we propose B-Neck, a distributed max-min fair algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the max min rates have been computed, B-Neck stops generating network traffic. Quiescence is a key design concept of B-Neck, because B-Neck routers are capable of detecting and notifying changes in the convergence conditions of max-min fair rates. As far as we know, B-Neck is the first distributed max-min fair algorithm that does not require a continuous injection of control traffic to compute the rates. The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them, it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

Pulsatile blood flow-split in aortic arch dissection

Abnormalities of the aortic arch, as the most proximal site of the cardiovascular system, are of great interest due to its major role in blood distribution to all downstream members. Wall dissection is one of the disorders that an aorta may suffer due to hypertension or degradation of aortic wall properties. A geometrical change of the aortic arch caused by the dissected wall, and consequently the blood flow path, makes the time-varying flow curves to be different in comparison to the healthy aortic arch. This phenomenon modifies wall shear stress (WSS) history during the cardiac cycle. In the current work, the pulsatile blood flow in a typical Stanford A (DeBakey II) dissected aorta is simulated by CFD technique, STAR-CCM+. The boundary conditions are calculated based on a combination of the impedance boundary condition and the auto-regulation concept in the cardiovascular system.