Modeling and Analysis of TCP Enhancement over Heterogeneous Links
In this paper we focus on one type of TCP enhancement commonly used to improve performance for connections over heterogeneous physical layer, namely, TCP connection splitting or split TCP, where the end-to-end TCP connection is split in segments so that each segment runs over a homogeneous environment and is optimized separately. This paper presents a simple model capturing some of the features of this scheme where split segments are essentially "coupled" TCP connections. We use simulation to validate our models and use our model to analyze situations where split TCP is preferred to the end-to-end scheme, and where the performance gain of splitting vanishes by investigating factors including initial window size, file size, number of on-going connections and loss.

title: Modeling TCP performance with proxies
abstract: This paper investigates TCP dynamics and performance over proxies that shorten the TCP feedback loop by segmenting the end-to-end connection. Such proxies are often used to improve the TCP performance, e.g. a splitting/spoofing proxy in satellite communication, and more commonly, a web cache. Through analysis, we attempt to develop a basic understanding of the properties of TCP dynamics when such proxies are used, and further obtain design principles of systems involving such proxies. We present simple models capturing some features of the proxy performance in both the lossless and lossy scenarios. Due to the complexity involved, detailed analysis is only available in the lossless scenario, and our discussion in the lossy scenario is largely limited to steady-state behavior. Nevertheless we are able to obtain useful insight. We identify conditions under which using a proxy provides significant or marginal performance gain by investigating factors including initial window size, congestion level of the proxy, and the level of asymmetry between the segments segregated by the proxy. We also discuss how these conditions affect the deployment and provisioning of such systems.

title: Data-gathering wireless sensor networks: organization and capacity
abstract: In this paper we study the transport capacity of a data-gathering wireless sensor network under different communication organizations. In particular, we consider using a flat as well as a hierarchical/clustering architecture to realize many-to-one communications. The capacity of the network under this many-to-one data-gathering scenario is reduced compared to random one-to-one communication due to the unavoidable creation of a point of traffic concentration at the data collector/receiver. We introduce the overall throughput bound of λ = W/n per node, where W is the transmission capacity, and show under what conditions it can be achieved and under what conditions it cannot. When those conditions are not met, we constructively show how λ = Θ(W/n) is achieved with high probability as the number of sensors goes to infinity. We also show how the introduction of clustering can improve the throughput. We discuss the trade-offs between achieving capacity and energy consumption, how transport capacity might be affected by considering in-network processing and the implications this study has on the design of practical protocols for large-scale data-gathering wireless sensor networks.

title: Random waypoint considered harmful
abstract: This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and therefore should not be directly used for simulation. We show how unreliable results can be obtained by using this model. In particular, certain ad hoc routing metrics can drop by as much as 40% over the course of a 900-second simulation using the random waypoint model. We give both an intuitive and a formal explanation for this phenomenon. We also propose a simple fix of the problem and discuss a few alternatives. Our modified random waypoint model is able to reach a steady state and simulation results are presented.

title: On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services
abstract: In this paper we study the optimality of an index policy for a bandwidth allocation problem, where a single server is allocated among N queues in a slotted system based on the queue backlog information. Due to the physical nature of the system this information is delayed, in that when the allocation decision is made, the server only has the backlog information from an earlier time. This results in imperfect and partial state observation. Queues have Bernoulli arrival processes with different probabilities of arrival, as well as different buffering/holding costs to differentiate heterogeneous classes of traffic/service. The objective is to minimize the expected total discounted holding cost over a finite or infinite horizon. We introduce an index policy with indices defined as functions of the state of a queue. We first show that when the state of the system is away from the boundary, i.e., no empty queues, the index policy is optimal. When there are empty queues, we show that under sufficient separation of the indices the index policy is still optimal. We show by example that if the separation does not hold, the index policy is not necessarily optimal. We then formulate the optimal bandwidth allocation as a restless bandit problem and show under what conditions the index policy calculated using Whittle's heuristics, which in general is only asymptotically optimal, is optimal for the finite case

title: Optimal controlled flooding search in a large wireless network
abstract: In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated. We derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio between the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lower bounded by 4 among all deterministic search strategies. In this paper we show that by using randomized strategies this ratio is lower bounded by e. We derive an optimal strategy that achieves this lower bound, and discuss its performance under other performance criteria.

title: An Evaluation of the Use of Problem-Based Learning Software By Middle School Students
abstract: Research has shown the potential of a problem-based approach to enhance students' learning. The interactive nature of hypermedia technology and its ability to deliver information in different media formats can provide unique capabilities for implementing problem-based learning (PBL) environments. Yet, we know little about the types of tools that are effective in supporting students' learning in a hypermedia supported PBL environment. The purpose of this study was to investigate both the use of tools and design features in a piece of PBL software and their effectiveness on middle school students' learning. The findings of this study show that students who were exposed to the PBL environment increased their achievement scores from pre to posttest more than those students who learned the same content in the traditional classroom. Students' reading ability was found to be a better predictor for their achievement in PBL than their math ability. However, the brief treatment of the study had only limited impact on students' attitude toward learning science. The findings of the study and their implications are discussed in detail.

title: Applying Design Patterns in Distributing a Genetic Algorithm Application
abstract: -This paper describes an experiment that employs an incremental approach to distribute a genetic algorithm application. The incremental approach allows the application to be initially developed for a standalone system, and then extended to run on multiple systems concurrently. For the extension, design patterns are employed wherever appropriate. The use of design patterns in the experiment is described, and the outcome of the experiment, including quantitative measurements, is presented.

title: Combinatorial constructions for optimal supersaturated designs
abstract: Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this paper, we focus on a new application of combinatorial design theory in experimental design theory. E ( f NOD ) criterion is used as a measure of non-orthogonality of U-type designs, and a lower bound of E ( f NOD ) which can serve as a benchmark of design optimality is obtained. A U-type design is E ( f NOD )-optimal if its E ( f NOD ) value achieves the lower bound. In most cases, E ( f NOD )-optimal U-type designs are supersaturated. We show that a kind of E ( f NOD )-optimal designs are equivalent to uniformly resolvable designs. Based on this equivalence, several new infinite classes for the existence of E ( f NOD )-optimal designs are then obtained.

title: A prototype mobile-agent application
abstract: Mobile agents, a relatively new paradigm for distributed software development, has become an accessible technology in recent years. The potential bene-ts of this paradigm, including the reduction of network bandwidth consumption and latency, promise to revolutionize distributed applications A number of research institutions and industrial entities have engaged in the development of elaborate supporting systems for this technology, and the deployment of its applications can be expected to proliferate. This paper describes a small-scale project under-taken to explore the feasibility of this technology, the technical issues, and its eeects on network applications .

title: The History and Status of Chinese Americans in Librarianship
abstract: This article reviews the brief history of Chinese Americans in the United States and their contributions to librarianship. Despite the hardships and challenges they faced, Chinese American librarians made great contributions to the building of East Asian libraries, to the cataloging of East Asian and Chinese collections, and to the development of library automation. They have advanced information technologies, promoted multicultural and diversity library services, and participated in library management and administration. Chinese Americans are active in library and information science education, in professional associations, in international librarianship, in national library and information services policy making and programming, and national policy making. Pioneers and key figures are identified with their accomplishments. The origin, purpose, programs, and activities of the Chinese American Librarians Association are also described.