This paper analyzes a multi-round ow control algorithm that attempts to minimize the time required to multicast a message to a group of recipients and receive responses directly from each group member. Such a ow control algorithm may be necessary because the urry of responses to the multicast can overrow the buuer space of the process that issued the multicast. The condition that each recipient...

The language Java was designed to be compiled into a platform independent bytecode format. Much of the information contained in the source code remains in the bytecode, which means that decompilation is easier than with traditional native codes. As a result, software developers are taking seriously the threat of competitors using reverse-engineering to extract proprietary algorithms from compil...

Unresolved indirect branch instructions are a major obstacle for statically reconstructing a control flow graph (CFG) from machine code. If static analysis cannot compute a precise set of possible targets for a branch, the necessary conservative over-approximation introduces a large amount of spurious edges, leading to even more imprecision and a degenerate CFG. In this paper, we propose to lev...

Distributed systems make increasing use of encrypted channels to enable confidential communication. While non-interference provides suitable means to investigate the flow of information within distributed systems, it has proved to be rather difficult to capture the notion of encrypted channels in such a framework. In this paper, we extend the framework MAKS for possibilistic information flow in...

This paper presents flit-reservation flow control, in which control flits traverse the network in advance of data flits, reserving buffers and channel bandwidth. Flit-reservation flow control requires control flits to precede data flits, which can be realized through fast on-chip control wires or the pipelining of control flits one or more cycles ahead of data flits. Scheduling ahead of data ar...

In this paper, the problem of finding the decentralized flow control of a BCMP network is investigated. The packets of each of the users correspond to different classes of customers. The servers in the network are exponential and serve packets with FIFO policy. Each network user operates with either a state-dependent arrival rate (i.e. an arrival rate which depends upon the number of the user's...

The problem of optimally choosing message rates for users of a store-and-forward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an " ideal tradeoff point between high throughput and low delay. " Each user has a fixed path or virtual circuit. In this environment, a basic definition of ...

On high-speed networks, the round trip delay from source to intermediate node and back is relatively large compared with packet transmission times; thus, the window-based method of flow control does not react quickly enough to prevent congestion and large delay. An alternative method is to employ a rate-based flow control scheme, in which each node is assigned a maximum rate and an average rate...

The psychological state of flow has been linked to optimizing human performance. A key condition of flow emergence is a match between the human abilities and complexity of the task. We propose a simple computational model of flow for Artificial Intelligence (AI) agents. The model factors the standard agent-environment state into a self-reflective set of the agent’s abilities and a socially lear...

Title of dissertation: FLOW CONTROL IN WIRELESS AD-HOC NETWORKS Georgios Papageorgiou, Doctor of Philosophy, 2009 Dissertation directed by: Professor John S. Baras, Department of Electrical and Computer Engineering We are interested in maximizing the Transmission Control Protocol (TCP) throughput between two nodes in a single cell wireless ad-hoc network. For this, we follow a cross-layer appro...