Keyword: communication

Found 444 papers in total
On mutually interfering parallel servers subject to external disturbances
2001,
This paper considers a continuous-time non-Markovian parallel queueing system subject...
Internet commerce security: Issues and models for control checking
2001,
When a corporation begins exchanging business transactions over the Internet, the...
Operations research at Bell Laboratories through the 1970s: Part III
2000,
This historical account of operations research at Bell Laboratories was drafted in the...
Statistical validation of a communications network simulation
1997,
Battlefield communications networks must deliver critical information when and where...
DIRECTV: Forecasting diffusion of a new technology prior to product launch
2001,
We conducted research for planning the launch of a satellite television product,...
Fault-tolerant virtual path layout in asynchronous transfer mode networks
2001,
Asynchronous Transfer Mode (ATM) is a communications architecture for the provision of...
The wide-diameter of the n-dimensional toroidal mesh
1996,
In graph theory and a study of transmission delay and fault tolerance of networks, the...
Algorithms for computing message delay for wireless networks
1997,
In this paper, we consider the problem of computing the expected message delay in a...
The superposition of discrete-time Markov renewal processes with an application to statistical multiplexing of bursty traffic sources
2000,
The main contribution in this paper is the introduction of a methodology for...
Fault-tolerant minimum broadcast networks
1996,
Broadcasting is the task of transmitting a message originated at one processor of a...
Broadcasting in synchronous networks with dynamic faults
1996,
The problem of broadcasting in a network is to disseminate information from one node...
Routing algorithms for switching networks with probabilistic traffic
1996,
Switching networks with probabilistic traffic are positioned prominently in...
Vulnerability of scheduled networks and a generalization of Menger's theorem
1996,
An edge-scheduled network N is a multigraph G = ( V, E ), where each edge e ∈ E...
Fault-tolerant broadcasting and gossiping in communication networks
1996,
Broadcasting and gossiping are fundamental tasks in network communication. In...
Optimal packet fragmentation and routing in computer networks
1997,
The packet fragmentation problem in computer networks is that of breaking a packet...
A lower bound for interval routing in general networks
1997,
Interval routing is a space-efficient routing method for point-to-point communication...
A method for obtaining the maximum multiroute flows in a network
1996,
In a communication network, a multiroute channel is more reliable than is an ordinary...
Optimizing the system of virtual paths by tabu search
2001,
In an asynchronous transfer mode (ATM) network, given the network topology and traffic...
Statistical multiplexing of correlated variable-length packet trains: An analytic performance study
2001,
We consider a statistical multiplexer which is modeled as a discrete-time...
Minimizing message complexity of partially replicated data on hypercubes
1996,
Within the framework of distributed and parallel computing, we consider partially...
Multicolor routing in the undirected hypercube
2000,
An undirected routing problem is a pair ( G,R ) where G is an undirected graph and R...
Open source movements as a model for organising
2000,
Open source software such as the operating system Linux has in a few years created...
A theory of industry-level activity for understanding the adoption of interorganizational systems
2000,
Increasingly we wish to ask and research questions about the adoption of...
DEMO: Towards a discipline of organisation engineering
2001,
Dynamic Essential Modelling of Organisation (DEMO) is a theory about the...
Papers per page: