Aggregate Flows – for Efficient Management of Large Flows in the Internet
نویسندگان
چکیده
Considerable advantages for performance will accrue if large flows can be identified and treated differently in the Internet. DiffServ provides a way to treat flows distinctly in the internet, however configuring DiffServ requires a high level of skill and attention to detail. We seek an approach which is inherently autoconfiguring. In this paper flows are not defined uniquely by information in their packet headers, but instead by their route through the local routing domain. This approach imposes a topological structure on the collection of flow by means of which we can judge how close two flows are together and, where appropriate, judge two or more flows to be part of a single larger flow. The aim is to get closer to the collection of packets generated by a single human request for service. For example, if a user chooses to subdivide a request as a large number of TCP connections, the entire aggregate would still be identified and treated as a single flow. To reduce the complexity of the task of flow management, we identify only flows larger than a certain threshold, without having to deal with the much larger number of small flows. Simulations are used to determine how many large flows need to be found in order to achieve significant improvements in the performance of the Internet as a whole.
منابع مشابه
Knowledge Flows Automation and Designing a Knowledge Management Framework for Educational Organizations
One of an important factor in the success of organizations is the efficiency of knowledge flow. The knowledge flow is a comprehensive concept and in recent studies of organizational analysis broadly considered in the areas of strategic management, organizational analysis and economics. In this paper, we consider knowledge flows from an Information Technology (IT) viewpoint. We usually have tw...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملStochastic Fair Aggregate Rate Control: Practical Traffic Management for Efficient and Robust IP Networking
The robustness of the Internet today depends upon the end-to-end congestion control mechanisms of TCP. As use of non-TCP applications such as streaming media and network games grows, the potential for unfair network resource allocation and the threat of congestion collapse increase. The Internet needs a practical solution to protect well-behaving flows from misbehaving flows and avoid collapse....
متن کاملOverview of Direct Numerical Simulation of Particle Entrainment in Turbulent Flows
An overview of removal and re-entrainment of particles in turbulent flows is presented. The procedure for the direct numerical simulation (DNS) of the Navier-Stokes equation via a pseudospectral method for simulating the instantaneous fluid velocity field is described. Particle removal mechanisms in turbulent flows in a duct are examined and effects of the near-wall coherent eddies on the parti...
متن کامل