SIMULATION AND EVALUATION OF NETWORK MAXIMUM FLOW UNDER CORRELATED COMPONENT FAILURES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum reliable path under multiple failures

In this work, we study the problem of maximizing path reliability in mesh networks against simultaneous failures of multiple network links. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard and we propose a heuristic algorithm for networks with large numbers of SRLGs as well as optimal solutions for networks with smaller numbe...

متن کامل

Robust Validation of Network Designs under Uncertain Demands and Failures

A key challenge confronting wide-area network architects is validating that their network designs provide assurable performance in the face of variable traffic demands and failures. Validation is hard because of the exponential, and possibly non-enumerable, set of scenarios that must be considered. Current theoretical tools provide overly conservative bounds on network performance since to rema...

متن کامل

Maximum Network Flow of Multiple Description Codes

Multiple description coding (MDC) is a powerful technique for robust real-time communications over packet switched lossy networks, such as the Internet, peer-to-peer, ad hoc, wireless, and sensor networks. This paper is concerned with optimal network flows of MDC packets from multiple sources to multiple receivers to maximize a weighted sum of fidelities achieved by all receivers. For general n...

متن کامل

The maximum flow problem of uncertain network

The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. T...

متن کامل

Maximum flow under proportional delay constraint

Given a network and a set of source destination pairs (connections), we consider the problem of maximizing the sum of the flow under proportional delay constraints. In this paper, the delay for crossing a link is proportional to the total flow crossing this link. If a connection supports non-zero flow, then the sum of the delay along any path corresponding to that connection must be lower than ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Japan Society of Civil Engineers, Ser. A1 (Structural Engineering & Earthquake Engineering (SE/EE))

سال: 2009

ISSN: 2185-4653

DOI: 10.2208/jscejseee.65.776