A network version of the Pump
Published 19 November 2002
M.H. Kang, Ira S. Moskowitz, D.C. Lee
Citations43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work shows how to extend the NRL data Pump to a certain MLS network architecture in order to balance the requirements of congestion control, fairness, good performance, and reliability against those of minimal threats from covert channels and denial of service attacks.
Abstract
A designer of reliable MLS networks must consider covert channels and denial of service attacks in addition to traditional network performance measures such as throughput, fairness, and reliability. We show how to extend the NRL data Pump to a certain MLS network architecture in order to balance the requirements of congestion control, fairness, good performance, and reliability against those of minimal threats from covert channels and denial of service attacks. We back up our claims with simulation results.>
Keywords
Computer Science
ACM Transactions on Modeling and Computer SimulationSimulation modeling for analysis
899 Citations2010Lee W. Schruben
It is shown that a tight coupling of the modeling and analysis phases in a simulation project can lead to dramatic improvements in the study results, and suggestions are made for how simulation analysis, considered in the explicit context of discrete-event simulation models, can create new opportunities for meaningful research and more efficient modeling.
IRE Transactions on Communications SystemsFlow Control: A Comparative Survey
410 Citations1980Mário Gerla, Leonard Kleinrock
This paper describes how flow control can be exercised at various levels in a packet network: hop level, entry-to-exit level, network access level, and transport level, and the interaction between the different levels is discussed.
IEEE Journal on Selected Areas in CommunicationsRound-robin scheduling for max-min fairness in data networks
353 Citations1991E.L. Hahne
The results suggest that the transmission capacity not used by the small window session will be approximately fairly divided among the large window sessions, and the worst-case performance of round-robin scheduling with windows is shown to approach limits that are perfectly fair in the max-min sense.
A general theory of composition for trace sets closed under selective interleaving functions
328 Citations2002John McLean
A general theory of system composition for "possibilistic" security properties is presented and it is seen that these properties fall outside of the Alpern-Schneider safety/liveness domain and hence, are not subject to the Abadi-Lamport composition principle.
Communications of the ACMDenial of service
155 Citations1994Roger M. Needham
The &jectiw of the pre sent article is to consider a particular instance of a denial of service problem and to look at engineering considerations relevant to an appropriate defensr.
A pump for rapid, reliable, secure communication
145 Citations1993Myong Kang, Ira S. Moskowitz
By adding random delays to the acknowledgment stream, it is shown how to further reduce the covert channel capacity even in the presence of cooperating Trojan horses in both the high and low systems.
Covert channels-here to stay?
132 Citations2002Ira S. Moskowitz, M.H. Kang
It is shown how trade-offs can be made to reduce the threat of covert channels and why a capacity analysis alone is not sufficient to evaluate the vulnerability and a new metric is introduced referred to as the "small message criterion".
Simple timing channels
75 Citations2002Ira S. Moskowitz, Allen R. Miller
The thrust of the paper is the analysis of timing channels that are discrete, memoryless, and noiseless, and called a simple timing channel (STC).
Alternative strategies for improving the fairness in an analytical model of DQDB networks
48 Citations1991B. Mukherjee, Soumitro Banerjee
The unfairness problem of DQDB is addressed, and several alternative solutions that can improve the network's fairness are proposed, and an analytical model of the DQ DB network is formulated.
Computers & Mathematics with ApplicationsReduction of a class of Fox-Wright psi functions for certain rational parameters
33 Citations1995Allen R. Miller, Ira S. Moskowitz
It is shown that the Fox-Wright Psi function reduces to a single generalizedhypergeometric function when certain of its parameters are integers and to a finite sum of generalized hypergeometric functions when these parameters are rational numbers.
A Data Pump for Communication,
18 Citations1995Myong Kang, Ira S. Moskowitz
The purpose of the covert channel analysis is to provide guidelines for the designer of the Pump to choose appropriate design parameters dependent upon the analysis presented in this paper and system requirements.
Discussion of a statistical channel
9 Citations1994Ira S. Moskowitz, M.H. Kang
This paper deals with a new type of covert channel problem that arose when a multilevel secure computer (MLS) system was designed, using a quasi-secure, asynchronous, communication device called the Pump, which is a statistical channel.