Applicability of Fair Simulation
نویسندگان
چکیده
In this paper we compare four notions of fair simulation direct delay game and exists Our comparison refers to three main aspects The time complexity of constructing the fair simulation the ability to use it for minimization and the relationship between the fair simulations and universal branching time logics We developed two practical applications that are based on this com parison The rst is an e cient approximated minimization algorithm for the delay game exists simulations The second is a new implemen tation for the assume guarantee modular framework presented in The new implementation signi cantly improves the complexity of the framework
منابع مشابه
Hierarchically Aggregated Fair Queueing (HAFQ) for Per-Flow Fair Bandwidth Allocation
Because of the development of recent broadband access technologies, fair service among users is becoming more important goal. The most promising router mechanisms for providing fair service is per–flow traffic management. However, it is difficult to implement in high–speed core routers because per– flow state management is prohibitively expensive; thus, a large number of flows are aggregated in...
متن کاملSelf-Verifying CSFQ
Recently, a class of solutions including Core-Stateless Fair Queueing (CSFQ), Rainbow Fair Queueing, and Diffserv have been proposed to address the scalability concerns that have plagued stateful architectures such as Intserv and Fair Queueing. However, despite some desirable properties, these solutions still have serious scalability, robustness, and deployment problems. Their scalability, suff...
متن کاملAcross-layer Resource Scheduling with Qos Guarantees Using Adaptive Token Bank Fair Queuing Algorithm in Wireless Networks
Orthogonal Frequency Division Multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM sys...
متن کاملHierarchically aggregated fair queueing (HAFQ) for per-flow fair bandwidth allocation in high speed networks
for Per-flow Fair Bandwidth Allocation in High Speed Networks Ichinoshin Maki†, Hideyuki Shimonishi‡, Tutomu Murase‡, Masayuki Murata†, Hideo Miyahara† †Graduate School of Information Science and Technology, Osaka University ‡Networking Research Labs, NEC Corporation E-mail: [email protected] Abstract— Because of the development of recent broadband access technologies, fair service among...
متن کاملHead-Driven Simulation of Water Supply Networks
Up to now most of the existing water supply network analyses have been based on demand-driven simulation models. These models assume that nodal outflows are fixed and are always available. However, this method of simulation neglects the pressure-dependent nature of demand that is characterized by changes in actual nodal outflows particularly during critical events like major mechanical or hydra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 194 شماره
صفحات -
تاریخ انتشار 2002