物件導向軟體之架構(Object-Oriented Software Construction)探討

The term ‘‘Internet-of-Things’’ is used as an umbrella keyword for covering various aspects related to the extension of the Internet and the Web into the physical realm, by means of the widespread deployment of spatially distributed devices with embedded identification, sensing and/or actuation capabilities. Internet-of-Things envisions a future in which digital and physical entities can be linked, by means of appropriate information and communication technologies, to enable a whole new class of applications and services. In this article, we present a survey of technologies, applications and research challenges for Internetof-Things.

/pdf/internet-of-things-vision-applications-and-research-4xfstaiv80.pdf

Internet of things: Vision, applications and research challenges

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This report suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks.

/pdf/location-aided-routing-lar-in-mobile-ad-hoc-networks-4ijy8yjn7d.pdf

Location-aided routing (LAR) in mobile ad hoc networks

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

Parallel discrete event simulation (PDES), sometimes called distributed simulation, refers to the execution of a single discrete event simulation program on a parallel computer. PDES has attracted a considerable amount of interest in recent years. From a pragmatic standpoint, this interest arises from the fact that large simulations in engineering, computer science, economics, and military applications, to mention a few, consume enormous amounts of time on sequential machines. From an academic point of view, parallel simulation is interesting because it represents a problem domain that often contains substantial amounts of parallelism (e.g., see [59]), yet paradoxically, is surprisingly difficult to parallelize in practice. A sufficiently general solution to the PDES problem may lead to new insights in parallel computation as a whole. Historically, the irregular, data-dependent nature of PDES programs has identified it as an application where vectorization techniques using supercomputer hardware provide little benefit [14].A discrete event simulation model assumes the system being simulated only changes state at discrete points in simulated time. The simulation model jumps from one state to another upon the occurrence of an event. For example, a simulator of a store-and-forward communication network might include state variables to indicate the length of message queues, the status of communication links (busy or idle), etc. Typical events might include arrival of a message at some node in the network, forwarding a message to another network node, component failures, etc.We are especially concerned with the simulation of asynchronous systems where events are not synchronized by a global clock, but rather, occur at irregular time intervals. For these systems, few simulator events occur at any single point in simulated time; therefore parallelization techniques based on lock-step execution using a global simulation clock perform poorly or require assumptions in the timing model that may compromise the fidelity of the simulation. Concurrent execution of events at different points in simulated time is required, but as we shall soon see, this introduces interesting synchronization problems that are at the heart of the PDES problem.This article deals with the execution of a simulation program on a parallel computer by decomposing the simulation application into a set of concurrently executing processes. For completeness, we conclude this section by mentioning other approaches to exploiting parallelism in simulation problems.Comfort and Shepard et al. have proposed using dedicated functional units to implement specific sequential simulation functions, (e.g., event list manipulation and random number generation [20, 23, 47]). This method can provide only a limited amount of speedup, however. Zhang, Zeigler, and Concepcion use the hierarchical decomposition of the simulation model to allow an event consisting of several subevents to be processed concurrently [21, 98]. A third alternative is to execute independent, sequential simulation programs on different processors [11, 39]. This replicated trials approach is useful if the simulation is largely stochastic and one is performing long simulation runs to reduce variance, or if one is attempting to simulate a specific simulation problem across a large number of different parameter settings. However, one drawback with this approach is that each processor must contain sufficient memory to hold the entire simulation. Furthermore, this approach is less suitable in a design environment where results of one experiment are used to determine the experiment that should be performed next because one must wait for a sequential execution to be completed before results are obtained.

/pdf/parallel-discrete-event-simulation-m759whzicd.pdf

Parallel discrete event simulation

This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme. Movement-based location update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A location update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. We propose a selective paging scheme which significantly decreases the location tracking cost under a small increase in the allowable paging delay. We introduce an analytical model for the proposed location tracking mechanism which captures the mobility and the incoming call arrival patterns of each mobile terminal. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters.

https://ir.nctu.edu.tw:443/bitstream/11536/1122/1/A1996VE43600013.pdf

Movement-based location update and selective paging for PCS networks

From the Publisher:
This book gives network engineers and managers a window on the world of wireless and mobile networks, from the enabling technologies and protocols to creating and managing mobile services." "Lin and Chlamtac use a unique sustained example approach to teach you how PCS concepts apply to real network operation. For example, they use location update to illustrate concepts in chapters on network signaling, mobility, security/handoff, and mobile prepaid services.

Wireless and Mobile Network Architectures

The forced termination probability (the probability that a hand-off call is blocked) is an important criterion in the performance evaluation of personal communication service (PCS) networks. The forced termination of an ongoing call is considered less desirable than blocking the initial access of a new call. The paper proposes analytic and simulation models to study the performance of different channel assignment strategies for hand-off and initial access. The authors observe that giving priority to hand-off attempts over initial access attempts would dramatically improve the forced termination probability of the system without seriously degrading the number of failed initial access attempts. Some of the results are different from previously published results because the present models capture features not considered in those studies. >

Queueing priority channel assignment strategies for PCS hand-off and initial access

Location tracking operations in a personal communications services (PCSs) network are expensive. Several strategies have been proposed to reduce the location update cost. This paper studies a special case of a location tracking algorithm called the alternative location algorithm. This special case is referred to as the two location algorithm (TLA). An analytical model is proposed to compare the performance of the TLA and the IS-41 protocol. Our study indicates that the performance of the TLA is significantly affected by the user moving patterns and the call traffic. If the user mobility is higher than the call frequency or the user tends to move back to the previously visited registration areas, then the TLA may significantly outperform IS-41. We also observe that the variance of the portable residence times in registration areas has an impact on the performance of the TLA (i.e., better performance is expected for larger variance).

https://ir.nctu.edu.tw:443/bitstream/11536/732/1/A1997WM61100003.pdf

Reducing location update cost in a PCS network

We propose an auxiliary strategy, called per-user caching, for locating users who move from place to place while using Personal Communications Services (PCS). The caching strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signaling and database loads in exchange for increased CPU processing and memory costs. Since technology trends are driving the latter costs down, the auxiliary strategy will become increasingly attractive. The idea behind caching is to reuse the information about a called user's location for subsequent calls to that user, and is useful for those users who receive calls frequently relative to the rate at which they change registration areas. This idea attempts to exploit the spatial and temporal locality in calls received by users, similar to the idea of exploiting locality of file access in computer systems. We use a reference PCS architecture and the notion of a user's local call-to-mobility ratio (LCMR) to quantify the costs and benefits of using caching and classes of users for whom it would be beneficial. We also present two simple algorithms for estimating users' LCMR and the situation in which each is preferable. We show that under a variety of assumptions caching is likely to yield significant net benefits in terms of reduced signaling network traffic and database loads. >

http://delab.csd.auth.gr/~dimitris/courses/mpc_fall05/papers/location_management/00329333.pdf

Yi-Bing Lin

Papers

Movement-based location update and selective paging for PCS networks

Wireless and Mobile Network Architectures

Queueing priority channel assignment strategies for PCS hand-off and initial access

Reducing location update cost in a PCS network

A caching strategy to reduce network impacts of PCS