Evaluation of Anonymity Providing Techniques using Queuing Theory
نویسنده
چکیده
In our work we use queuing theory both for security (i.e. anonymity) and performance analysis. A well-known anonymity technique, the MIX method, which is the basis of most of today’s deployments, is the object of our investigation. We show shortcomings and problems in the MIX method and suggest possible workarounds. Our investigation reveals the level of security of MIX based systems and their performance characteristics on the Internet.
منابع مشابه
Hotel Location Problem Using Erlang Queuing Model under Uncertainty (RESEARCH NOTE)
Determining and selecting an appropriate location to construct a hotel is one of the most challenging concerns which hotel industry investors are facing with. In this study we attempt to find a suitable response to this research/application need by a mathematical model using the queueing theory and the fuzzy logic. Therefore hotel, the reception system and travelers accommodations are formulate...
متن کاملModeling and Performance Comparison of Privacy Approaches for Location Based Services
In pervasive computing environment, Location Based Services (LBSs) are getting popularity among users because of their usefulness in day-to-day life. LBSs are information services that use geospatial data of mobile device and smart phone users to provide information, entertainment and security in real time. A key concern in such pervasive computing environment is the need to reveal the user’s e...
متن کاملScheduling and Stochastic Capacity Estimation of an EV Charging Station with PV Rooftop Using Queuing Theory and Random Forest
Power capacity of EV charging stations could be increased by installing PV arrays on their rooftops. In these charging stations, power transmission can be two-sided when needed. In this paper a new method based on queuing theory and random forest algorithm proposed to calculate net power of charging station considering random SOC of EV’s. Due to estimation time constraints, a queuing model with...
متن کاملDesigning Stochastic Cell Formation Problem Using Queuing Theory
This paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. In this research, cells are defined as a queue system which will be optimized via queuing theory. In this queue system, each machine is assumed as a server and each part as a customer. The grouping of machines and parts...
متن کاملFormation of manufacturing cell using queuing theory and considering reliability
In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...
متن کامل