REFEREE: trust management for Web applications
Selected papers from the sixth international conference on World Wide Web
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Stability preserving transformations: packet routing networks with edge capacities and speeds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Design of a Role-Based Trust-Management Framework
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Trust Relationships in Secure Systems-A Distributed Authentication Perspective
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
The Impact of Failure Management on the Stability of Communication Networks
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
The Impact of Network Structure on the Stability of Greedy Protocols
Theory of Computing Systems
The Impact of Dynamic Link Slowdowns on Network Stability
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Inferring Internet denial-of-service activity
ACM Transactions on Computer Systems (TOCS)
The increase of the instability of networks due to Quasi-Static link capacities
Theoretical Computer Science
Adversarial queueing model for continuous network dynamics
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.24 |
Modern large-scale multimedia networks, such as the Internet, are characterised by heterogeneity due to the versatile nature of their communication subsystems. We focus on heterogeneous multimedia networks where individual greedy, contention-resolution protocols are simultaneously running (composed) over different network queues. A question that arises in such multimedia systems concerns the possibility of developing design criteria in order to evaluate stability degradation under adversarial attacks that change dynamically network link capacities/slowdowns. A packet-switched network is stable if the number of packets in the network remains bounded at all times against any adversary. We consider the Adversarial Queueing Theory framework, where an adversary controls rates of packet injections and determines packet paths. The adversary is enhanced to include manipulation of link capacities/slowdowns. Within this framework, we show the impact of dynamic adversarial attacks in network stability under various protocol compositions and dynamic adversarial attacks trying to characterise stability in terms of network topologies for simple-path trajectories. The examined network topologies have been proved forbidden for stability when network link capacities/slowdowns are fixed. Our results indicate that the composition of protocols under dynamic adversarial attacks leads a network to worst instability behaviour than using a single protocol or a composition of protocols with fixed network link capacities/slowdowns.