Sciweavers

1724 search results - page 160 / 345
» Models for Concurrency
Sort
View
TELSYS
2002
100views more  TELSYS 2002»
14 years 10 months ago
An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation
The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and prot...
Gaeil Ahn, Jongsoo Jang, Woojik Chun
AINA
2003
IEEE
15 years 3 months ago
Validation-Based Reprocessing Scheme for Updating Spatial Data in Mobile Computing Environments
This paper introduces a novel reprocessingtransaction model that handles the update conflicts between mobile transactions without abortion. The proposed model executes a new subtr...
Donghyun Kim, Bonghee Hong, Byunggu Yu, Eun Suk Ho...
WSC
1997
14 years 11 months ago
Cloning: A Novel Method for Interactive Parallel Simulation
A new scheme for interactively testing what-if and alternative scenarios in parallel simulations is presented. Potential branches or choices can be specified interactively and in...
Maria Hybinette, Richard Fujimoto
IPL
2010
95views more  IPL 2010»
14 years 8 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
TOMCCAP
2008
112views more  TOMCCAP 2008»
14 years 10 months ago
Scalable on-demand media streaming for heterogeneous clients
Periodic broadcast protocols enable the efficient streaming of highly popular media files to large numbers of concurrent clients. Most previous periodic broadcast protocols, howeve...
Phillipa Gill, Liqi Shi, Anirban Mahanti, Zongpeng...