Stable non-Gaussian random processes , by G. Samorodnitsky and M. S. Taqqu. Pp. 632. £49.50. 1994. ISBN 0-412-05171-0 (Chapman and Hall).

Mathematical Handbook for Scientists and Engineers

Formally we have arrived at the middle of the book. So you may need a pause for recovering, a pause which we want to fill up by some fixed point theorems supplementing those which you already met or which you will meet in later chapters. The first group of results centres around Banach’s fixed point theorem. The latter is certainly a nice result since it contains only one simple condition on the map F, since it is so easy to prove and since it nevertheless allows a variety of applications. Therefore it is not astonishing that many mathematicians have been attracted by the question to which extent the conditions on F and the space Ω can be changed so that one still gets the existence of a unique or of at least one fixed point. The number of results produced this way is still finite, but of a statistical magnitude, suggesting at a first glance that only a random sample can be covered by a chapter or even a book of the present size. Fortunately (or unfortunately?) most of the modifications have not found applications up to now, so that there is no reason to write a cookery book about conditions but to write at least a short outline of some ideas indicating that this field can be as interesting as other chapters. A systematic account of more recent ideas and examples in fixed point theory should however be written by one of the true experts. Strange as it is, such a book does not seem to exist though so many people are puzzling out so many results.

Fixed Point Theory

Modern cyber physical systems (CPSs) has widely being used in our daily lives because of development of information and communication technologies (ICT). With the provision of CPSs, the security and privacy threats associated to these systems are also increasing. Passive attacks are being used by intruders to get access to private information of CPSs. In order to make CPSs data more secure, certain privacy preservation strategies such as encryption, and k-anonymity have been presented in the past. However, with the advances in CPSs architecture, these techniques also need certain modifications. Meanwhile, differential privacy emerged as an efficient technique to protect CPSs data privacy. In this paper, we present a comprehensive survey of differential privacy techniques for CPSs. In particular, we survey the application and implementation of differential privacy in four major applications of CPSs named as energy systems, transportation systems, healthcare and medical systems, and industrial Internet of things (IIoT). Furthermore, we present open issues, challenges, and future research direction for differential privacy techniques for CPSs. This survey can serve as basis for the development of modern differential privacy techniques to address various problems and data privacy scenarios of CPSs.

Differential Privacy Techniques for Cyber Physical Systems: A Survey

With the widespread adoption of the Internet of Things (IoT), the number of connected devices is growing at an exponential rate, which is contributing to ever-increasing, massive data volumes. Real-time analytics on the massive IoT data, referred to as the “real-time IoT analytics” in this paper, is becoming the mainstream with an aim to provide an immediate or non-immediate actionable insights and business intelligence. However, the analytics network of the existing IoT systems does not adequately consider the requirements of the real-time IoT analytics. In fact, most researchers overlooked an appropriate design of the IoT analytics network while focusing much on the sensing and delivery networks of the IoT system. Since much of the IoT analytics network has often been taken as granted, the survey, in this paper, we aim to review the state-of-the-art of the analytics network methodologies, which are suitable for real-time IoT analytics. In this vein, we first describe the basics of the real-time IoT analytics, use cases, and software platforms, and then explain the shortcomings of the network methodologies to support them. To address those shortcomings, we then discuss the relevant network methodologies which may support the real-time IoT analytics. Also, we present a number of prospective research problems and future research directions focusing on the network methodologies for the real-time IoT analytics.

A Survey on Network Methodologies for Real-Time Analytics of Massive IoT Data and Open Research Issues

We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. We address the issue of appropriate allocation of the synchronous capacities. Several synchronous bandwidth allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. We propose a scheme, called the normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization. >

/pdf/guaranteeing-synchronous-message-deadlines-with-the-timed-1spveijvrn.pdf

Guaranteeing synchronous message deadlines with the timed token medium access control protocol

The problem of guaranteeing synchronous message deadlines in token ring networks in which the timed token medium access control protocol is used is discussed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. It is shown that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. The normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization is proposed. >

Guaranteeing synchronous message deadlines with the timed token protocol

The authors study the problem of transmitting synchronous messages before their deadlines in communication networks where the timed token medium access control protocol is employed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous message every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be property allocated to individual nodes. The authors develop and analyze an optimal synchronous capacity allocation scheme. An optimal scheme can allocate the synchronous capacities in such a way that the synchronous message deadlines are guaranteed if there exists any allocation scheme that can do so. The optimality of the allocation scheme proposed here is formally proved, and the bounds for its worst case achievable utilization are derived. >

Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol

Data centers play a key role in the expansion of cloud computing. However, the efficiency of data center networks is limited by oversubscription. The typical unbalanced traffic distributions of a DCN further aggravate the problem. Wireless networking, as a complementary technology to Ethernet, has the flexibility and capability to provide feasible approaches to handle the problem. In this article, we analyze the challenges of DCNs and articulate the motivations of employing wireless in DCNs. We also propose a hybrid Ethernet/wireless DCN architecture and a mechanism to dynamically schedule wireless transmissions based on traffic demands. Our simulation study demonstrates the effectiveness of the proposed wireless DCN.

Wireless data center networking

The problem of guaranteeing synchronous message deadlines in communication networks using the timed token medium access control protocol is studied. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. A class of local synchronous capacity allocation schemes, which allocate the synchronous capacity to a node without using information about messages on the other nodes, is developed, analyzed, and evaluated in terms of the ability of the schemes to guarantee message deadlines. It is shown that one of the local allocation schemes proposed can achieve the same performance as that of the best global allocation scheme known to date. >

Biao Chen

Papers

Guaranteeing synchronous message deadlines with the timed token medium access control protocol

Guaranteeing synchronous message deadlines with the timed token protocol

Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol

Wireless data center networking

Local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol