The Active Side Principle Approach to the Design of Client Server Protocol
The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...
The complexity of short schedules for uet bipartite graphs
The complexity of short schedules for uet bipartite graphs
We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].
The complexity of systolic dissemination of information in interconnection networks
The control agglomerations of an internet network with delay feedback.
The energy dissipation, the error probability and the time of duration a logical operation
The Maslov dequantization, idempotent and tropical mathematics: a brief introduction.
The MX/M/1 queue with working breakdown
In this paper, we consider a batch arrival MX/M/1 queue model with working breakdown. The server may be subject to a service breakdown when it is busy, rather than completely stoping service, it will decrease its service rate. For this model, we analyze a two-dimensional Markov chain and give its quasi upper triangle transition probability matrix. Under the system stability condition, we derive the probability generating function (PGF) of the stationary queue length, and then obtain its stochastic...
The quantum size and waiting time for time-shared systems
The rupture degree and gear graphs.
The Value of Knowing that You Do Not Know
The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone...
Theory as basis for advances in hypermedia
Tight bounds for quasirandom rumor spreading.
Token transfer in a faulty network
Transfert de charge dans un réseau de processeurs totalement connectés
Transfert de Charge dans un Réseau de Processeurs Totalement Connectés
In this paper, a model of the load transfer on a fully connected net is presented. Each processor can accept at most K tasks. A load difference of two tasks between two processors is a prohibited situation and when it may appear, an immediat and instantaneous transfer is decided. The performances of the system are evaluated by the following indices: the reject probability, the throughput, the mean response time, the stationary probability distribution for a processor to host i tasks. The aim of...
Transient analysis of a queue with queue-length dependent map and its application to SS7 network.
Transparent Scheduling of Composite Web Services
Composite Web Services (CWS) aggregate multiple Web Services in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic and other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time performance under...
Two open problems in communication in edge-disjoint paths modes