"Sample chapter "A Peek at the Future Internet" available at
http://www.springer.com/978-94-007-... more "Sample chapter "A Peek at the Future Internet" available at
http://www.springer.com/978-94-007-1472-4
<< Beautifully written, this book takes the reader on a compelling tour of the state of affairs in today’s Internet and the challenges it faces for supporting pervasive services of tomorrow. The approach adopted by the authors looks at the big picture, discussing the evolution of the Internet from a rigidly defined layered architecture to an interactive multi-faceted system providing, beyond connectivity, a more generative next-generation network infrastructure. In this context, the authors describe a selection of some of the prominent network mechanisms that may help in shaping the architecture of the future Internet. Overall, this book is informative, enjoyable, and an excellent reference source for every student, network professional, or researcher interested in the post-Internet era. >>
Prof. Raouf Boutaba, University of Waterloo (Canada)
Since its inception in the 1970s the Internet has become larger, faster and wireless. It is the biggest machine ever built, the “generative” engine of our digital society. However, the software that runs the global network has not seen any substantial upgrade since the early 1990s. It is now evident that the existing mechanisms that transport data around the Internet are no longer adequate for the new breed of Web applications. This book explains why the time is ripe for a complete overhaul in view of the Future Internet. Through a series of simple examples, the authors present a wealth of network mechanisms, starting from those that sustain the Web today. Readers will become familiar with a range of advanced protocols that will make the Internet more ubiquitous, reactive, proactive, information-driven, distribution-efficient and searchable. This book presents a selection of remarkable research ideas, making them accessible to the non-specialist reader.
TABLE OF CONTENTS
Foreword
Preface
Acknowledgements
1. On the Way to the Pervasive Web
1.1 The Net, a Tool for Everyone 1.2 The Inexorable Transformation of Internet applications 1.3 The Application’s Mutiny 1.4 Everything on the Move 1.5 New Interaction Paradigms Emerge 1.6 The Scent of Pervasive Applications 1.7 The Billion Dollar Question.- References.
2 The Network, as We Know It
2.1 The Multiple Facets of Networks 2.2 Networks from the Eyes of an Ordinary User 2.3 Invite a Programmer to Understand What’s in the Cloud 2.4 A Network Engineer to Turn a Switch into a Router 2.5 The Computer Science of a Router 2.6 Simple Math to Stabilize the Net 2.7 Life of a Commuter 2.8 The Three Fundamental Principles.- References.
3 Six Problems for the Service Provider
3.1 The Net has Ossified 3.2 Problem 1: Not Truly Ubiquitous 3.3 Problem 2: The Unresponsive Net 3.4 Problem 3: Too Much, Too Stale Signaling 3.5 Problem 4: Lack of Parallelism 3.6 Problem 5: Data Agnosticism 3.7 Problem 6: Inadequate Net-search Engine 3.8 Concluding Remarks.- References.
4 Spontaneous Networks
4.1 The Gift of Ubiquity 4.2 Spontaneous Connectivity 4.3 The Hidden-terminal Problem 4.4 The Exposed-terminal Problem 4.5 Preventive Measures to Avoid Collision 4.6 Path Discovery in a Volatile Network 4.7 The KISS Approach.- References.
5 Reactive Networks
5.1 Why Networks on Demand? 5.2 A Traffic-free Network 5.3 Our First Path 5.4 Path Management 5.5 Our Second Path 5.6 Global Synchronization 5.7 Error Management 5.8 Remarks on Reactive Networks.- References.
6 Proactive networks
6.1 From Reactive to Responsive 6.2 Keep the Network Ready 6.3 How do I Find My Multipoint Relay? 6.4 Life of an OLSR Node 6.5 The Node’s Information Repository 6.6 Shortest Path over the MPR Sub-topology 6.7 A Complete Example 6.8 How Proactive Can You Be? 6.9 The Power of Hybrid Protocols.- References.
7 Content-aware Networks
7.1 Routers Should Read the Content 7.2 A Network on Top of the Physical Network 7.3 Centralized Assignment of Node Identifiers 7.4 Centralized Entry-point Discovery 7.5 Multiple Bootstrap Servers 7.6 Decentralized Assignment of Node Identifiers 7.7 Entry Point Discovery via Underlying Links 7.8 Content is an Asset at the Edges.- References.
8 Distribution-efficient Networks
8.1 Publishing goes beyond Bootstrapping 8.2 The Two Flavors of Virtual Networking 8.3 Creating Unstructured Neighborhoods 8.4 Making Yourself Known in Unstructured Neighborhoods 8.5 Unstructured Resource Publishing 8.6 Secure a Role in Structure Worlds 8.7 Build Strict Formations 8.8 Place Links and Resources into a Structured Ring 8.9 Data-awareness via Protocol-agnosticism.- References.
9 Discovering Virtual Resources
9.1 Four Ways to Reach a Resource 9.2 Assessment of Discovery Mechanisms 9.3 Containing the Proliferation of Discovery Messages 9.4 Blind Discovery for Unstructured Networks 9.5 Informed Discovery in Unstructured Networks 9.6 Discovery in Loosely-Structured Networks 9.7 Deterministic Discovery in Structured Networks.- References.
10 A Peek at the Future Internet
10.1 The Fourth Networking Principle: Beyond Mere Connectivity 10.2 Internet of Things: Sense and Influence your Environment 10.3 Small, Large Networks 10.4 Manage the Autonomics 10.5 Dependable Networks 10.6 The Fine Line Between Freedom, Security and Privacy 10.7 Energy-efficient Networks 10.8 No Matter What, the Network will Remain Generative.- References.
Index"
CMIS/P is the OS1 System Management service and protocol, used as the base technology for the Tel... more CMIS/P is the OS1 System Management service and protocol, used as the base technology for the Telecommunication Management Network. It IS a generic object-oriented protocol that provides multiple object access capabilities to managed object clusters administered by agent applications. Its navigation and object selection capabilities rely on traversing containment relationships. This is restrictive as information models for emerging broadband technologies (SDWSONET, ATM) exhibit various other relationships. In this paper we present extensions to the CMIS service that provide a richer access language and show how these extensions can be supported by corresponding extensions to the CMIP protocol. These extensions allow to traverse any object relationship and to filter out objects at any stage of the selection process. CMIS++ provides much greater expressive power than CMIS while CMIP++ supports the remote evaluation of the corresponding expressions, minimizing the management traffic required for complex management information retrieval. These extensions follow an incremental approach, starting from a version compatible with the current standard and adding gradually sophisticated features. The applicability and importance of the proposed concepts is demonstrated through an example from SDH management while we also discuss implementation considerations.
Project Title: Traffic Engineering for Quality of Service in the Internet, at Large Scale
This Deliverable includes the results and conclusions obtained by the integration, component perf... more This Deliverable includes the results and conclusions obtained by the integration, component performance, and system performance tests carried out in testbeds and simulators.
As networks become pervasive, the importance of efficient information gathering for purposes such... more As networks become pervasive, the importance of efficient information gathering for purposes such as monitoring, fault diagnosis, and performance evaluation increases.
Service Provisioning in the IP Multimedia Subsystem
IGI Global eBooks, 2008
The IP multimedia subsystem (IMS) specifies a service centric framework for converged, all-IP net... more The IP multimedia subsystem (IMS) specifies a service centric framework for converged, all-IP networks. This promises to provide the long awaited environment for deploying technology-neutral services over fixed, wireless, and cellular networks, known as third generation (3G) networks. Since its initial proposal in 1999, the IMS has gone through different stages of development, from its initial Release 5 up to the current Release 7.
Quality of Experience Models for Multimedia Streaming
IGI Global eBooks, 2012
Abstract Understanding how quality is perceived by viewers of multimedia streaming services is es... more Abstract Understanding how quality is perceived by viewers of multimedia streaming services is essential for efficient management of those services. Quality of Experience (QoE) is a subjective metric that quantifies the perceived quality, which is crucial in the process of optimizing tradeoff between quality and resources. However, accurate estimation of QoE often entails cumbersome studies that are long and expensive to execute. In this regard, the authors present a QoE estimation methodology for developing Machine Learning ...
Time-Scheduled Network Evaluation Based on Interference
Industrial IoT applications often require both dependability and flexibility from the underlying ... more Industrial IoT applications often require both dependability and flexibility from the underlying networks. Restructuring production lines brings topological changes that directly affect the interference levels per link. When a scheduled network, e.g. IEEE802.15.4-TSCH (Time Synchronized Channel Hopping), is used to ensure dependability in low-power networks, rescheduling of transmissions is needed to re-establish effective and reliable end-to-end communication. Typical approaches focus on either centralized or distributed schedulers with little attention drawn on how the chosen solution would perform compared to other solutions or in different topologies. In this work, we introduce the concept of online assessment of TSCH schedules and present an automated method for evaluating schedules taking into consideration the internal interference and conflicts. The network and its TSCH schedule are mapped to a common representation, the interference graph, easy to analyze. Experiment results suggest that this evaluation method reflects the performance of the network when measured by packet reception ratio, end to end delivery ratio, and latency.
Distributed TSCH scheduling: A comparative analysis
Industrial applications demand for ease of deployment, reliability and low-power in wireless netw... more Industrial applications demand for ease of deployment, reliability and low-power in wireless networks, leading to standards like IEEE802.15.4, which include time synchronized channel hopping mechanisms. Yet, scheduling of transmissions on timeslots and channels falls outside the scope of current standards. Given the application requirements above, distributed (rather than centralized) scheduling has been identified as a vehicle to keep reliability within boundaries, even when network topology changes, offering scalability and flexibility. However, assigning timeslots and channels is challenging in a distributed environment, as the scheduling device can only rely on limited knowledge about its surroundings. This paper evaluates existing slot assignation methods — additional messaging and arbitrary allocation-in distributed Time Synchronized Channel Hopping (TSCH) networks, providing an experimental comparative analysis of the different methods. We find that, through additional messaging, it is possible to reduce conflicts — and increase reliability-, compared to pseudo-random slot and channel access. However, these benefits come at extra latency in scheduling time, which is problematic in time-critical wireless sensor networks. On the other hand, arbitrary cell allocation does not impact scheduling time, but creates conflicts for small slotframe sizes (high data throughput), affecting reliability. This study pinpoints the criticalities in distributed TSCH networks, advocating arbitrary cell allocation for mobile or scheduling-time-critical wireless sensor networks.
Criminal Network: The Sicilian Mafia. "Montagna Operation
The datasets reported relate to criminal networks directly obtained from Court data: Meetings dat... more The datasets reported relate to criminal networks directly obtained from Court data: Meetings dataset, accounts for the physical meetings among suspected (police stakeout). It is composed by 101 nodes and 256 edges. Phone Calls dataset refers to phone calls among individuals (police eavesdropping). It is composed by 100 nodes and 124 edges. Roles dataset address the role of the suspected as well as their relationship with the other suspected, and the request from the judge (e.g. arrested/in jail/etc.). Meetings and Phone Calls datasets have in common 47 nodes (i.e., suspected). <em>"Our datasets were derived from the pre-trial detention order issued by the Court of Messina's preliminary investigation judge on March 14, 2007, which was towards the end of the major anti-mafia operation referred to as "Montagna Operation". This operation was concluded in 2007 by the Public Prosecutor's Office of Messina (Sicily) and was conducted by the Special Operations Unit of the Italian Police (the R.O.S. Reparto Operativo Speciale of the Carabinieri is specializing in anti-Mafia investigations). This particular investigation was a prominent operation focused on two Mafia clans, known as the "Mistretta" family and the "Batanesi clan". From 2003 to 2007, these families were found to had infiltrated several economic activities including major infrastructure works, through a cartel of entrepreneurs close to the Sicilian Mafia." (</em>From https://arxiv.org/abs/2003.05303) For more details, please refer to: Preliminary analysis in our conference paper: https://link.springer.com/chapter/10.1007/978-3-030-36683-4_36 Our pre-print on ArXiv: https://arxiv.org/abs/2003.05303 Our GitHub Repository: https://github.com/lcucav/networkdistruption
Recent developments in cloud computing and the Internet of Things have enabled smart environments... more Recent developments in cloud computing and the Internet of Things have enabled smart environments, in terms of both monitoring and actuation. Unfortunately, this often results in unsustainable cloud-based solutions, whereby, in the interest of simplicity, a wealth of raw (unprocessed) data are pushed from sensor nodes to the cloud. Herein, we advocate the use of machine learning at sensor nodes to perform essential data-cleaning operations, to avoid the transmission of corrupted (often unusable) data to the cloud. Starting from a public pollution dataset, we investigate how two machine learning techniques (kNN and missForest) may be embedded on Raspberry Pi to perform data imputation, without impacting the data collection process. Our experimental results demonstrate the accuracy and computational efficiency of edge-learning methods for filling in missing data values in corrupted data series. We find that kNN and missForest correctly impute up to 40% of randomly distributed missing values, with a density distribution of values that is indistinguishable from the benchmark. We also show a trade-off analysis for the case of bursty missing values, with recoverable blocks of up to 100 samples. Computation times are shorter than sampling periods, allowing for data imputation at the edge in a timely manner.
Quality of experience management for video streams
Abstract With the widespread adoption of mobile Internet, the process of streaming video has beco... more Abstract With the widespread adoption of mobile Internet, the process of streaming video has become varied and complex. A diversity of factors affect the way we perceive quality in video streaming (also known as&amp;amp;amp;amp;#x27; quality of experience&amp;amp;amp;amp;#x27;, or QoE), involving far more than the individual video and network characteristics. Quality is affected by the overall delivery context, terminal specifications but also human factors. It is thus very hard to control the streaming system as a whole, targeting QoE rather than the tuning of individual factors. To ...
This paper introduces a new learning algorithm for human activity recognition capable of simultan... more This paper introduces a new learning algorithm for human activity recognition capable of simultaneous regression and classification. Building upon Conditional Restricted Boltzmann Machines (CRBMs), Factored Four Way Conditional Restricted Boltzmann Machines (FFW-CRBMs) incorporate a new label layer and four-way interactions among the neurons from the different layers. The additional layer gives the classification nodes a similar strong multiplicative effect compared to the other layers, and avoids that the classification neurons are overwhelmed by the (much larger set of) other neurons. This makes FFW-CRBMs capable of performing activity recognition, prediction and self auto evaluation of classification within one unified framework. As a second contribution, Sequential Markov chain Contrastive Divergence (SMcCD) is introduced. SMcCD modifies Contrastive Divergence to compensate for the extra complexity of FFW-CRBMs during training. Two sets of experiments one on benchmark datasets and one a robotic platform for smart companions show the effectiveness of FFW-CRBMs.
Signals and communication technology, Jul 29, 2018
This chapter presents an overview of different tools used in research and engineering of 3D video... more This chapter presents an overview of different tools used in research and engineering of 3D video delivery systems. These include software tools for 3D video compression and streaming, 3D video players, and their interfaces. Other types of tools widely used in research studies and development of new networking solutions, such as network simulators, emulators, testbeds, and network analysis tools are also covered. In addition, several 3D video evaluation tools, which have been specifically designed for testing and evaluation of 3D video sequences subject to network impairments, are further described. The chapter also presents several examples of recent works that have been carried out based on one or more simulation, emulation, test, and/or evaluation tools in research studies or innovative solutions for relevant problems affecting 3D multimedia delivery.
This paper introduces a new learning algorithm for human activity recognition capable of simultan... more This paper introduces a new learning algorithm for human activity recognition capable of simultaneous regression and classification. Building upon Conditional Restricted Boltzmann Machines (CRBMs), Factored Four Way Conditional Restricted Boltzmann Machines (FFW-CRBMs) incorporate a new label layer and four-way interactions among the neurons from the different layers. The additional layer gives the classification nodes a similar strong multiplicative effect compared to the other layers, and avoids that the classification neurons are overwhelmed by the (much larger set of) other neurons. This makes FFW-CRBMs capable of performing activity recognition, prediction and self auto evaluation of classification within one unified framework. As a second contribution, Sequential Markov chain Contrastive Divergence (SMcCD) is introduced. SMcCD modifies Contrastive Divergence to compensate for the extra complexity of FFW-CRBMs during training. Two sets of experiments one on benchmark datasets and one a robotic platform for smart companions show the effectiveness of FFW-CRBMs.
An Approximation Method for Large Graph Similarity
Similarity calculation of large-scale graphs is essential in big data classification, sorting, an... more Similarity calculation of large-scale graphs is essential in big data classification, sorting, and other work. However, when there are diverse attributes and the vertices are not ordered, the time and space complexity of similarity computation is often too high. This paper presents a unified representation comprehensive tensor (CT) of large-scale graphs with different specifications and attributes to save space. Besides, before approximation, the concept of a completely satisfied comprehensive tensor (CSCT) set is utilized to ensure the attribute consistency. Then, a spatial mapping (SM) method is proposed to approximate the similarity between two large-scale graphs. In this way, the computational memory is reduced to O(e+n), where e represents the edge number, and n represents the number of vertices. Moreover, the computational efficiency is improved a lot to O(e1+e2), in which e1 and e2 respectively represent the edge numbers of the two graphs for similarity calculation.
With billions of connected devices in the near future, the major challenge is to develop networks... more With billions of connected devices in the near future, the major challenge is to develop networks to build an Industrial Internet of Things which is scalable, energy-efficient, reliable and affordable. To this end, low-power wireless personal area networks (LP-WPAN) provide a solution at minimum costs. However, to ensure continuous performance verification, LP-WPAN requires a centrally monitored and controlled service. This work proposes such an edge service, i.e. network monitoring and optimal reconfiguration of scheduled LP-WPANs. The approach is based on a transformation of the schedule into a new model, interference graphs. The interference graphs allow to design evaluation and rescheduling recommender methods to monitor and reconfigure the schedule. An experimental setup was developed to test and validate the approach. The results show that the model and methods provide an accurate representation of the behavior of the network, and that the new rescheduling recommender greatly improves the network's performance, compared to random rescheduling.
No-Reference (NR) metrics provide a mechanism to assess video quality in an ever-growing wireless... more No-Reference (NR) metrics provide a mechanism to assess video quality in an ever-growing wireless network. Their low computational complexity and functional characteristics make them the primary choice when it comes to realtime content management and mobile streaming control. Unfortunately, common NR metrics suffer from poor accuracy, particularly in network-impaired video streams. In this work, we introduce a regression-based video quality metric that is simple enough for real-time computation on thin clients, and comparably as accurate as state-of-the-art Full-Reference (FR) metrics, which are functionally and computationally inviable in real-time streaming. We benchmark our metric against the FR metric VQM (Video Quality Metric), finding a very strong correlation factor.
Uploads
Books by Antonio Liotta
http://www.springer.com/978-94-007-1472-4
<< Beautifully written, this book takes the reader on a compelling tour of the state of affairs in today’s Internet and the challenges it faces for supporting pervasive services of tomorrow. The approach adopted by the authors looks at the big picture, discussing the evolution of the Internet from a rigidly defined layered architecture to an interactive multi-faceted system providing, beyond connectivity, a more generative next-generation network infrastructure. In this context, the authors describe a selection of some of the prominent network mechanisms that may help in shaping the architecture of the future Internet. Overall, this book is informative, enjoyable, and an excellent reference source for every student, network professional, or researcher interested in the post-Internet era. >>
Prof. Raouf Boutaba, University of Waterloo (Canada)
Since its inception in the 1970s the Internet has become larger, faster and wireless. It is the biggest machine ever built, the “generative” engine of our digital society. However, the software that runs the global network has not seen any substantial upgrade since the early 1990s. It is now evident that the existing mechanisms that transport data around the Internet are no longer adequate for the new breed of Web applications. This book explains why the time is ripe for a complete overhaul in view of the Future Internet. Through a series of simple examples, the authors present a wealth of network mechanisms, starting from those that sustain the Web today. Readers will become familiar with a range of advanced protocols that will make the Internet more ubiquitous, reactive, proactive, information-driven, distribution-efficient and searchable. This book presents a selection of remarkable research ideas, making them accessible to the non-specialist reader.
TABLE OF CONTENTS
Foreword
Preface
Acknowledgements
1. On the Way to the Pervasive Web
1.1 The Net, a Tool for Everyone 1.2 The Inexorable Transformation of Internet applications 1.3 The Application’s Mutiny 1.4 Everything on the Move 1.5 New Interaction Paradigms Emerge 1.6 The Scent of Pervasive Applications 1.7 The Billion Dollar Question.- References.
2 The Network, as We Know It
2.1 The Multiple Facets of Networks 2.2 Networks from the Eyes of an Ordinary User 2.3 Invite a Programmer to Understand What’s in the Cloud 2.4 A Network Engineer to Turn a Switch into a Router 2.5 The Computer Science of a Router 2.6 Simple Math to Stabilize the Net 2.7 Life of a Commuter 2.8 The Three Fundamental Principles.- References.
3 Six Problems for the Service Provider
3.1 The Net has Ossified 3.2 Problem 1: Not Truly Ubiquitous 3.3 Problem 2: The Unresponsive Net 3.4 Problem 3: Too Much, Too Stale Signaling 3.5 Problem 4: Lack of Parallelism 3.6 Problem 5: Data Agnosticism 3.7 Problem 6: Inadequate Net-search Engine 3.8 Concluding Remarks.- References.
4 Spontaneous Networks
4.1 The Gift of Ubiquity 4.2 Spontaneous Connectivity 4.3 The Hidden-terminal Problem 4.4 The Exposed-terminal Problem 4.5 Preventive Measures to Avoid Collision 4.6 Path Discovery in a Volatile Network 4.7 The KISS Approach.- References.
5 Reactive Networks
5.1 Why Networks on Demand? 5.2 A Traffic-free Network 5.3 Our First Path 5.4 Path Management 5.5 Our Second Path 5.6 Global Synchronization 5.7 Error Management 5.8 Remarks on Reactive Networks.- References.
6 Proactive networks
6.1 From Reactive to Responsive 6.2 Keep the Network Ready 6.3 How do I Find My Multipoint Relay? 6.4 Life of an OLSR Node 6.5 The Node’s Information Repository 6.6 Shortest Path over the MPR Sub-topology 6.7 A Complete Example 6.8 How Proactive Can You Be? 6.9 The Power of Hybrid Protocols.- References.
7 Content-aware Networks
7.1 Routers Should Read the Content 7.2 A Network on Top of the Physical Network 7.3 Centralized Assignment of Node Identifiers 7.4 Centralized Entry-point Discovery 7.5 Multiple Bootstrap Servers 7.6 Decentralized Assignment of Node Identifiers 7.7 Entry Point Discovery via Underlying Links 7.8 Content is an Asset at the Edges.- References.
8 Distribution-efficient Networks
8.1 Publishing goes beyond Bootstrapping 8.2 The Two Flavors of Virtual Networking 8.3 Creating Unstructured Neighborhoods 8.4 Making Yourself Known in Unstructured Neighborhoods 8.5 Unstructured Resource Publishing 8.6 Secure a Role in Structure Worlds 8.7 Build Strict Formations 8.8 Place Links and Resources into a Structured Ring 8.9 Data-awareness via Protocol-agnosticism.- References.
9 Discovering Virtual Resources
9.1 Four Ways to Reach a Resource 9.2 Assessment of Discovery Mechanisms 9.3 Containing the Proliferation of Discovery Messages 9.4 Blind Discovery for Unstructured Networks 9.5 Informed Discovery in Unstructured Networks 9.6 Discovery in Loosely-Structured Networks 9.7 Deterministic Discovery in Structured Networks.- References.
10 A Peek at the Future Internet
10.1 The Fourth Networking Principle: Beyond Mere Connectivity 10.2 Internet of Things: Sense and Influence your Environment 10.3 Small, Large Networks 10.4 Manage the Autonomics 10.5 Dependable Networks 10.6 The Fine Line Between Freedom, Security and Privacy 10.7 Energy-efficient Networks 10.8 No Matter What, the Network will Remain Generative.- References.
Index"
Papers by Antonio Liotta