Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 102 for “"Network flow"”.
-
Network flow optimization for distributed clouds
Internet applications, which rely on large-scale networked environments such as data centers for their back-end support, are often geo-distributed and typically have stringent performance constraints. The interconnecting networks, within and across data centers, are critical in determining these …
-
Fundamental limit of network flow attacks
A network flow-based attack refers to a cyber-attack where the adversary seeks to block user traffic from transmission by sending adversarial traffic that reduces the available user capacity. In this thesis, we explore the fundamental limits of network flow attacks by investigating its feasibility …
-
Faster algorithms for some network flow problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1996.
-
An effective network flow prioritization approach in DDoS scenarios
… have a policy that can discriminate legitimate network flows from the malicious ones. Such a fairness policy will help prioritizing the legitimate flows and prevent the system from DDoS attacks. In this thesis, we present and compare the effectiveness of four different fairness policies using …
-
Network flow model of short-run domestic phosphate supply, A
Includes bibliographical references.
-
Design, analysis, and implementation of effective network flow watermarking schemes
Linking network flows is an important problem in several security-related applications including intrusion detection and anonymity. The flows of interest in these applications are commonly relayed by several low-latency nodes, and each node adds an extra/different layer of encryption to the traffic …
-
Timing channel codes for covert communication and network flow tracing
… a medium for covert communication in a computer network. It offers the means to communicate a message by relaying information encrypted within the timings formed between consecutive packets. This thesis covers two schemes that utilize the timing channel for covert communication -- to send a …
-
Network flow problems and congestion games : complexity and approximation results
… solution to a congestion game. We consider both network and general congestion games, and we examine several variants of the problem concerning the structure of the game and its associated cost functions. Many of the problem variants are NP-hard, though we do identify several versions of the …
-
[Episilon]-relaxation and auction algorithms for the convex cost network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Multi-period optimal network flow and pricing strategy for commodity online retailer
This thesis aims to study the network of a nationwide distributor of a commodity product. As we cannot disclose the actual product for competitive reasons, we will present the research in terms of a similar, representative product, namely salt for ice prevention across United States. The …
-
Scaling algorithms for multicommodity flow problems and network flow problems with side constraits
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1991.
-
A network-based primal-dual solution methodology for the multi-commodity network flow problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil Engineering, 1988.
-
Tactical Network Flow and Discrete Optimization Models and Algorithms for the Empty Railcar Transportation Problem
… problem except for blocking, and results in a network formulation of the problem. This model examines various practical issues such as time and demand location-based priorities as well as uncertainty in data within a multiple objective framework. In the second model (TDSS2: Tactical Decision …
-
Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; and, Massachusetts Institute of Technology, Sloan School of Management, 1999.
-
Applying tree knapsack approaches to general network design : a case study
… decision problems that fall into the category of network flow problems: numerous examples of applications can be found in areas such as telecommunications, logistics, distributions, engineering, computer science and so on. One of the most popular and valuable tools to solve network flow problems …
-
Resilient and Risk-Averse Network Systems
… vertex and/or edge weights. First, we consider a network flow problem and propose an approach for developing resilience metrics, where resilience refers to the network’s capability to restore optimal or near-optimal operations following unforeseen (stochastic) disruptions in topology or …
-
A Graph Approach to Measuring Text Distance
… we propose a novel distance measure within a network-flow formalism that combines these two distinct components in a way that they are not treated as separate and orthogonal pieces of information. First, we represent each text as a collection of frequency-weighted concepts within a relational …
-
A scalable architecture for the interconnection of microgrids
… and congestion constraints, while maximizing network-wide reliability. The model is first formulated as a centralized optimization problem, and the value of interconnection is assessed using supply and demand data gathered in India. The model is then formulated as a layered decomposition, in …
-
Modern VLSI Placement Observing Technology Constraints
… steps, such as routing, in the physical design flow. The placement problem has become ever more complex and challenging due to a wide variety of intricate constraints and design rules imposed by modern technology processes on the Very Large Scale Integration (VLSI) design process. Any constraint …
-
MULTIPLE CRITERIA DECISION MAKING : NETWORK FLOWS AND ITS FRAMEWORKS FOR APPLICATION IN HIGHER EDUCATION ADMINISTRATION
… techniques and tools. The Multiple Objective Network Flow (MONF) problem has been chosen as the methodological area, and higher education administration as the functional/ application area. Two separate literature reviews were first done on the indicated methodological and functional areas. …
Page 1 of 6