| 1. |
|
|
| 2. |
- Ahlgren, Bengt, et al.
(författare)
-
Internet of Things for Smart Cities : Interoperability and Open Data
- 2016
-
Ingår i: IEEE Internet Computing. - : IEEE Computer Society. - 1089-7801 .- 1941-0131. ; 20:6, s. 52-56
-
Tidskriftsartikel (refereegranskat)abstract
- The Internet of Things (IoT) has become a promising technology for addressing societal challenges by connecting smart devices and leveraging Big Data analytics to create smart cities worldwide. As the IoT scales up, it's important to provide interoperability among different devices. Yet current simple standard protocols lack sufficient openness and interoperability. IoT for smart cities needs to guarantee the accessibility of open data and cloud services to allow industries and citizens to develop new services and applications. Here, the authors provide a case study of the GreenIoT platform in Uppsala, Sweden, to demonstrate the idea of interoperability and open data for smart cities.
|
|
| 3. |
|
|
| 4. |
- Csaszar, Andras, et al.
(författare)
-
Converging the evolution of router architectures and IP networks
- 2007
-
Ingår i: IEEE Network. - 0890-8044 .- 1558-156X. ; 21:4, s. 8-14
-
Tidskriftsartikel (refereegranskat)abstract
- Although IP is widely recognized as the platform for next-generation converged networks, unfortunately, it is heavily burdened by its heritage of almost 30 years. Nowadays, network operators must devote significant resources to perform essential tasks, such as traffic engineering, policy enforcement, and security. In this article, we argue that one of the principal reasons for this is the way control and forwarding planes are interspersed in IP networks today. We review the architectural. developments that led to the current situation, and we reason that centralization of network control functionality can constitute a solution to the pressing problems of the contemporary Internet.
|
|
| 5. |
- Hagsand, Olof, et al.
(författare)
-
Design and implementation of a distributed router
- 2005
-
Ingår i: 2005 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT), Vols 1 and 2. - 0780393139 ; , s. 227-232
-
Konferensbidrag (refereegranskat)abstract
- The requirements on 1P routers are increasing for every new generation of designs. The driving forces are growing traffic volumes and demands for new services. We argue that a decentralized modular system design would improve the scalability. flexibility, and reliability of future routers. We have designed and implemented such a distributed router. based on physical separation between different junctional modules for control and forwarding plane operations. This paper presents the design and implementation, focusing on the internal communication protocols and implementation aspects of the control plane.
|
|
| 6. |
- Hidell, Markus, et al.
(författare)
-
A Modularized Control Plane for BGP
- 2007
-
Ingår i: PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and System. - Anaheim, CA, USA : ACTA Press. - 9780889867048
-
Konferensbidrag (refereegranskat)abstract
- The number of new services and protocols required in IP routers is steadily growing. This adds to the complexity of the router control plane and increases the amount of work that has to be performed by the control processor. Accordingly, the trend of augmenting the router functionality has an important impact on control plane performance and robustness. Traditionally, router control software is intertwined into a single complex system in a centralized fashion. In this paper, we put forward a new way to design the control plane, based on modularization of control software into independent modules that can be decentralized to multiple processing elements and executed concurrently. We have applied this design approach on BGP (Border Gateway Protocol), with the main purpose to do an experimental performance evaluation of distributed control plane processing. We find that the time to process and install a large number of BGP routes, for instance during start-up of BGP, can be significantly reduced if the workload is spread over multiple processing units. We also identify several approaches for improving robustness through the use of a modular decentralized control plane. Finally, we demonstrate that such a system can be realized using unmodified open source routing software.
|
|
| 7. |
- Hidell, Markus, et al.
(författare)
-
Control and forwarding plane interaction in distributed routers
- 2005
-
Ingår i: NETWORKING 2005: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS SYSTEMS. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 3540258094 ; , s. 1339-1342
-
Konferensbidrag (refereegranskat)abstract
- The requirements on IP routers continue to increase, both from the control plane and the forwarding plane perspectives. To improve scalability, flexibility, and availability new ways to build future routers need to be investigated. This paper suggests a decentralized, modular system design for routers, based on control elements for functionalities like routing, and forwarding elements for packet processing. Further, we present measurements on the distribution of large routing tables in an experimental platform consisting of one control element and up to 16 forwarding elements.
|
|
| 8. |
- Hidell, Markus, 1967-
(författare)
-
Decentralized Modular Router Architectures
- 2006
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The Internet grows extremely fast in terms of number of users and traffic volume, as well as in the number of services that must be supported. This development results in new requirements on routers—the main building blocks of the Internet. Existing router designs suffer from architectural limitations that make it difficult to meet future requirements, and the purpose of this thesis is to explore new ways of building routers. We take the approach to investigate distributed and modular router designs, where routers are composed of multiple modules that can be mapped onto different processing elements. The modules communicate through open well-defined interfaces over an internal network. Our overall hypothesis is that such a combination of modularization and decentralization is a promising way to improve scalability, flexibility, and robustness of Internet routers—properties that will be critical for new generations of routers. Our research methodology is based on design, implementation, and experimental verification. The design work has two main results: an overall system design and a distributed router control plane. The system design consists of interfaces, protocols, and internal mechanisms for physically separation of different components of a router. The distributed control plane is a decomposition of control software into independent modules mapped onto multiple distributed processing elements. Our design is evaluated and verified through the implementation of a prototype system. The experimental part of the work deals with two key issues. First, transport mechanisms for communication of internal control information between processing elements are evaluated. In particular, we investigate the use of reliable multicast protocols in this context. Results regarding communication overhead as well as overall performance of routing table dissemination and installation are presented. The results show that even though there are certain costs associated with using reliable multicast, there are large performance gains to be made when the number of processing elements increases. Second, we present performance results of processing routing information in a distributed control plane. These results show that the processing time can be significantly reduced by distributing the workload over multiple processing elements. This indicates that considerable performance improvements can be made through the use of the distributed control plane architecture proposed in this thesis.
|
|
| 9. |
- Hidell, Markus, et al.
(författare)
-
Distributed Control for Decentralized Modular Routers
- 2004
-
Ingår i: 2nd Swedish National Computer Networking Workshop, SNCNW 2004, Karlstad, Sweden. ; , s. 9-13
-
Konferensbidrag (refereegranskat)abstract
- The requirements on IP routers continue to increase, both from the control plane and the forwarding plane perspectives. To improve scalability, flexibility, and availability we investigate new ways to build future routers. This paper presents a system model of a decentralized and modular router architecture. Design alternatives and implementation aspects are discussed, and a system implementation is presented.
|
|
| 10. |
- Hidell, Markus, et al.
(författare)
-
NACK-Oriented Reliable Multicast for Routing Table Distribution in Decentralized Routers
- 2005
-
Ingår i: 3rd Swedish National Computer Networking Workshop, SNCNW 2005, Halmstad, Sweden.
-
Konferensbidrag (refereegranskat)abstract
- The requirements on IP routers are increasing for every new generation of designs. The driving forces behind this development are growing traffic volumes and demands for new services. We believe that a modular decentralized router design is well-suited to meet future requirements. However, a distributed design may, compared to a centralized system, introduce an additional cost for internal communication between the elements. In this paper we evaluate different transaction mechanisms for the internal communication. We study the suitability of reliable multicast for the internal distribution of large amounts of routing information. In particular, we evaluate NORM (NACK-Oriented Reliable Multicast) as a candidate protocol for our purposes.
|
|
| 11. |
- Hidell, Markus, et al.
(författare)
-
Performance of NACK-Oriented Reliable Multicast in distributed routers
- 2006
-
Ingår i: HPSR. - : IEEE. - 0780395697 ; , s. 241-247
-
Konferensbidrag (refereegranskat)abstract
- We investigate a decentralized modular system design for routers, where functional modules are connected to a high-performance network. In such a distributed system internal reliable dissemination of data to multiple receivers is an important issue. We study the use of a reliable multicast protocol (NORM-NACK-Oriented Reliable Multicast) for routing table dissemination in a distributed router, which has been designed and implemented in our networking laboratory. Experimental results of using both file- and stream-oriented transport services in NORM are presented and compared. We also compare the use of reliable multicast with an ideal "hand-tuned" multicast dissemination. We find that NORM is useful for this application, but that there is a certain cost in terms of overhead.
|
|
| 12. |
- Hidell, Markus, et al.
(författare)
-
Reliable multicast for control in distributed routers
- 2005
-
Ingår i: 2005 Workshop on High Performance Switching and Routing. - NEW YORK : IEEE. - 0780389247 ; , s. 133-137
-
Konferensbidrag (refereegranskat)abstract
- Growing traffic volumes and demands for new services rapidly increase the requirements imposed on network systems, such as IP routers. We argue that a decentralized modular system design would improve the scalability, flexibility, and reliability of future routers. We have designed an implemented such a distributed router, based on physical separation between control and forwarding elements. One challenge with the design concerns the internal communication between the elements constituting the router. This paper presents performance measurements of different internal transaction mechanisms between the control and forwarding planes. In particular, an existing protocol for reliable multicast has been integrated and evaluated in our experimental prototype. The prototype consists of one control element and up to 16 forwarding elements, interconnected by an internal control network based on Ethernet switches.
|
|
| 13. |
- Manjate, Juvencio Arnaldo, et al.
(författare)
-
Can Energy-Aware Routing Improve the Energy Savings of Energy-Efficient Ethernet?
- 2018
-
Ingår i: IEEE Transactions on Green Communications and Networking. - : Institute of Electrical and Electronics Engineers (IEEE). - 2473-2400. ; 2:3, s. 787-794
-
Tidskriftsartikel (refereegranskat)abstract
- Telecommunication networks are over-provisioned with redundant resources in order to cope with traffic load during peak hours and to quickly recover from failures. However, much of the resources are underutilized during long periods of time, but still consuming full energy. With the growing concerns of energy waste and greenhouse gas emissions, the network design principles tend to shift towards allocation of resources on-demand for energy-efficiency. In this paper, we analyze and evaluate the performance of two different energy-saving techniques, namely energy saving topology control (ESTOP) and energy-efficient Ethernet (EEE). We investigate the energy-saving characteristics of ESTOP+EEE; the combination of ESTOP and EEE. The evaluation is conducted in OMNet++ with realistic and synthetic network topologies under varying traffic conditions. The results indicate that the combination has a significant potential for saving energy, compared to running ESTOP or EEE alone, but that the amount of energy savings depends on topology, traffic load, and the chosen target connectivity level for ESTOP. In particular, the results show that the target connectivity level needs to be carefully matched to the topology and the current traffic situation, suggesting that ESTOP+EEE would be suitable where the target connectivity level is dynamically adjusted according to traffic variations.
|
|
| 14. |
- Manjate, Juvencio Arnaldo, et al.
(författare)
-
Energy-efficient data center networks
- 2018
-
Ingår i: NCA 2018 - 2018 IEEE 17th International Symposium on Network Computing and Applications. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781538676592
-
Konferensbidrag (refereegranskat)abstract
- Data center networks (DCNs) are designed to be scalable, resilient, and tolerant to failures. This is achieved through redundancy of network devices and links. All devices and links are always operational, consuming full energy even when underutilized. Energy-aware routing (EAR) protocols leverage network-wide information to dynamically scale up or down network energy consumption according to utilization. However, many EARs are designed for networks of devices and links that are not energy-proportional, such as ElasticTree and VMPlanner. The advent of Energy Efficient Ethernet (EEE) brings new challenges into how EAR protocols are designed. In this paper, we propose Greener, an extension of ElasticTree to leverage the energy proportionality characteristics of EEE. We integrate the EEE energy model with the ElasticTree solution. Greener is designed for K-ary Fat-Tree multi-rooted topologies, to steer flows along the most energy-efficient paths and put into sleep mode unused switches and links. Simulation experiments of Greener in DCNs of different sizes and under varying traffic loads show that it brings significant improvements in energy savings. Moreover, Greener outperforms the benchmark ElasticTree executed on EEE-based DCNs by up to 10 percentage points of energy savings.
|
|
| 15. |
- Manjate, Juvencio Arnaldo, et al.
(författare)
-
Energy-efficient networks under coordinated and uncoordinated sleeping approaches
- 2015
-
Ingår i: 2015 23rd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2015. - : IEEE. - 9789532900569 ; , s. 1-5
-
Konferensbidrag (refereegranskat)abstract
- Wired IP networks handle the bulk of today's communication. These networks are built with over-provisioning and redundancy of devices to support critical activities. However, the activities can vary significantly, resulting in unused network online waste of power. In this study, we examine two existing power-saving approaches for wired IP networks: i) uncoordinated sleeping and (ii) coordinated sleeping. The uncoordinated and coordinated sleeping algorithms investigated are respectively Energy Efficient Ethernet (EEE) and Energy-Aware Routing (EAR) for green OSPF. In addition, we investigate the combination of coordinated and uncoordinated sleeping algorithms, EEE and EAR for green OSPF. The energy performance of the two algorithms and their combination is evaluated in two networks of different dimensions under varying traffic loads. The investigation shows that EEE, EAR for green OSPF and the combination significantly reduce the energy consumption of a network. However, the highest peak of energy conservation is achieved when EAR for green OSPF is activated in an EEE network during lower traffic load periods and deactivated during high traffic load periods.
|
|
| 16. |
- Manjate, Juvencio Arnaldo, et al.
(författare)
-
Network Energy Efficiency through Matching and Reconfiguration
- 2018
-
Ingår i: IEEE 2018 INTERNATIONAL CONGRESS ON CYBERMATICS / 2018 IEEE CONFERENCES ON INTERNET OF THINGS, GREEN COMPUTING AND COMMUNICATIONS, CYBER, PHYSICAL AND SOCIAL COMPUTING, SMART DATA, BLOCKCHAIN, COMPUTER AND INFORMATION TECHNOLOGY. - : IEEE. ; , s. 244-250
-
Konferensbidrag (refereegranskat)abstract
- Energy efficiency has become a major concern in the design and operation of fixed networks. Energy-Efficient Ethernet (EEE) came as a response to reduce the energy consumption of Ethernet technology. The performance of EEE depends on the link utilization and may degrade when the utilization increases. This is especially true when an energy-aware routing (EAR) protocol is deployed on top of EEE as it tends to aggregate traffic over a subset of links, thereby increasing their utilization. This behavior introduces a tradeoff between EEE and EAR. As network traffic patterns change frequently, it requires a significant effort to configure the EAR protocol on an EEE network in order to reduce the downside effects of the tradeoff, thus benefiting from both the EEE and EAR energy efficiency. In this work, we propose a network matching and reconfiguration algorithm (NetRec), which dynamically adapts the topology control (ESTOP) settings of an EEE network to increase energy savings. Our reasoning is that larger energy savings can be obtained if the network topology is dynamically reconfigured according to traffic demand. NetRec is designed in the context of Software-Defined Networking (SDN). We evaluate NetRec's energy performance in networks of different sizes under varying traffic conditions.
|
|
| 17. |
- Manjate, Juvencio Arnaldo, et al.
(författare)
-
Performance analysis of topology-oriented solutions on energy efficient networks
- 2017
-
Ingår i: 2017 IEEE International Conference on Communications, ICC 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467389990
-
Konferensbidrag (refereegranskat)abstract
- Telecommunication networks have been designed and deployed with over-provisioning and redundancy of resources to cope with traffic load during peak hours and quickly recover from failure. However, most of these resources are underutilized and in most of the time idle but consuming full energy. With the growing concern of energy waste and greenhouse gases (GHG), the network design principles tend to shift to allocate resources on-demand and be energy-efficient. In this paper, we analyze and evaluate the performance of two energy-saving techniques, namely Energy Saving TOPology control (ESTOP) for coordinated sleeping, and Energy Efficient Ethernet (EEE) for uncoordinated sleeping. Furthermore, we evaluate the potential of combining ESTOP and EEE considering that the reduced topologies obtained running ESTOP can substantially increase link utilization and the length of some paths and therefore degrade the performance of EEE. The evaluation was conducted in OMNet++ with realistic and synthetic networks under different traffic conditions. The results show that the energy conservation of the combination is significant when a lower value of the connectivity threshold is used during off-peak hours and a higher value is used during peak hours. ESTOP depends on the density of the topology and can save about 50% of energy.
|
|
| 18. |
- Onur, E, et al.
(författare)
-
Intelligent End-To-End Resource Virtualization Using Service Oriented Architecture
- 2009
-
Ingår i: 2009 IEEE GLOBECOM Workshops. - 9781424456260 - 9781424456246 ; , s. 345-350
-
Konferensbidrag (refereegranskat)abstract
- Service-oriented architecture can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. Virtualization provides abstraction and isolation of lower level functionalities, enabling portability of higher level functions and sharing of physical resources. However, dynamics, environmental conditions and increasing complexity / heterogeneity of underlying resources call for adaptive resource handling. In this view an intelligent distributed architecture that enables dynamic user management and control on network-wide resource sharing by using the service oriented architecture concept is presented. Additionally, the proposed architecture supports trading of resources that will enable the transformation of traditional business models.
|
|
| 19. |
- Papagianni, C., et al.
(författare)
-
Supporting end-to-end resource virtualization for web 2.0 applications using service oriented architecture
- 2008
-
Ingår i: IEEE GLOBECOM Workshops 2008. - 9781424430611
-
Konferensbidrag (refereegranskat)abstract
- In recent years, technologies have been introduced offering a large amount of computing and networking resources. New applications such as Google AdSense and BitTorrent can profit from the use of these resources. An efficient way of discovering and reserving these resources is by using the Service Oriented Architecture (SOA) concept. SOA can be considered as a philosophy or paradigm in organizing and utilizing services and capabilities that may be under the control of different ownership domains. This paper presents an architecture that can be used to support end-to-end resource virtualization for Web 2.0 applications and in particular for peer-to-peer applications by using the Service Oriented Architecture concept.
|
|
| 20. |
- Rathore, Muhammad Siraj, 1979-, et al.
(författare)
-
Data Plane Optimization in Open Virtual Routers
- 2011
-
Ingår i: IFIP Networking 2011. - Berlin, Heidelberg : Springer Verlag, Heidelberg. ; , s. 379-392
-
Konferensbidrag (refereegranskat)abstract
- A major challenge in network virtualization is to virtualize the components constituting the network, in particular the routers. In the work presented here, we focus on how to use open source Linux software in combination with commodity hardware to build open virtual routers. A general approach in open router virtualization is to run multiple virtual instances in parallel on the same PC hardware. This means that virtual components are combined in the router’s data plane, which can result in performance penalty. In this paper, we investigate the impact of the design of virtual network devices on router performance in Linux namespace environment. We identify performance bottlenecks along the packet data path. We suggest design changes to improve performance. In particular, we investigate modifications of the ―macvlan‖ device, and analyze the performance improvements in terms of packet forwarding. We also investigate how the number of virtual routers and virtual devices within a physical machine influence performance.
|
|
| 21. |
- Rathore, Muhammad Siraj, 1979-, et al.
(författare)
-
KVM vs. LXC : Comparing Performance and Isolation of Hardware-assisted Virtual Routers
- 2013
-
Ingår i: American Journal of Networks and Communications. - : Science Publishing Group. - 2326-893X. ; 2:4, s. 88-96
-
Tidskriftsartikel (refereegranskat)abstract
- Concerns have been raised about the performance of PC-based virtual routers as they do packet processing in software. Furthermore, it becomes challenging to maintain isolation among virtual routers due to resource contention in a shared environment. Hardware vendors recognize this issue and PC hardware with virtualization support (SR-IOV and Intel-VTd) has been introduced in recent years. In this paper, we investigate how such hardware features can be integrated with two different virtualization technologies (LXC and KVM) to enhance performance and isolation of virtual routers on shared environments. We compare LXC and KVM and our results indicate that KVM in combination with hardware support can provide better trade-offs between performance and isolation. We notice that KVM has slightly lower throughput, but has superior isolation properties by providing more explicit control of CPU resources. We demonstrate that KVM allows defining a CPU share for a virtual router, something that is difficult to achieve in LXC, where packet forwarding is done in a kernel shared by all virtual routers.
|
|
| 22. |
- Rathore, M. Siraj, et al.
(författare)
-
Performance Evaluation of Open Virtual Routers
- 2010
-
Ingår i: 2010 IEEE GLOBECOM WORKSHOPS. - : IEEE. - 9781424488650 ; , s. 288-293
-
Konferensbidrag (refereegranskat)abstract
- A major challenge in network virtualization is to virtualize the components constituting the network, in particular the routers. In the work presented here, we focus on how to use open source Linux software in combination with commodity hardware to build open virtual routers. A general approach in open router virtualization is to run multiple virtual operating systems in parallel on the same PC hardware. This means that overhead in terms of additional packet processing is introduced along the data path through the router. In this paper, we investigate these performance penalties and suggest how best to combine software modules to form an open virtual router.
|
|
| 23. |
- Rathore, Muhammad Siraj
(författare)
-
Performance, Isolation and Service Guarantees in Virtualized Network Functions
- 2017
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- A network is generally a collection of different hardware-based network devices carrying out various network functions, (NF). These NF implementations are special purpose and expensive. Network function virtualization (NFV) is an alternative which uses software-based implementation of NFs in inexpensive commodity servers. However, it is challenging to achieve high networking performance due to bottlenecks in software, particularly in a virtualized environment where NFs are implemented inside the virtual machines (VM). The performance isolation is yet another challenge, which means that the load on one VM should not affect the performance of other VMs. However, it is difficult to provide performance isolation due to resource contention in a commodity server. Furthermore, different NFs may require different service guarantees which are difficult to ensure due to the non-deterministic performance behavior of a commodity server.In this thesis we investigate how the challenges of performance, isolation and service guarantees can be addressed for virtual routers (VR), as an example of a virtualized NF. It is argued that the forwarding path of a VR can be modified in an efficient manner in order to improve the forwarding performance. When it comes to performance isolation, poor isolation is observed due to shared network queues and CPU sharing among VRs. We propose a design with SR-IOV, which allows reserving a network queue and CPU core for each VR. As a result, the resource contention is reduced and strong performance isolation is achieved. Finally, it is investigated how average throughput and bounded packet delay can be guaranteed to VRs. We argue that a classic rate-controlled service discipline can be adapted in a virtual environment to achieve service guarantees. We demonstrate that firm service guarantees can be achieved with little overhead of adding token bucket regulator in the forwarding path of a VR.
|
|
| 24. |
- Rathore, Muhammad Siraj, 1979-, et al.
(författare)
-
Site-to-Site VPN Technologies : A Survey
- 2009
-
Konferensbidrag (refereegranskat)abstract
- Virtual Private Network (VPN) is a popular way to build private networks using shared network infrastructure. A variety of VPN technologies exist today operating on different layers of OSI model. This paper presents a detailed survey and provides a classification of various types of VPNs. Layer 1 VPN is also included which is an emerging technology. Services offered by each VPN with implementation methods are described. Protocols, tunneling mechanisms and hardware components used for the deployment are also explored.
|
|
| 25. |
- Rathore, M. Siraj, et al.
(författare)
-
Towards Performance Guarantees for Virtualized Network Functions
- 2017
-
Tidskriftsartikel (refereegranskat)abstract
- The trend of consolidating network functions from specialized hardware to software running on virtualization servers brings significant advantages for reducing costs and simplifying service deployment. However, virtualization techniques have significant limitations when it comes to networking as there is no support for guaranteeing that network functions meet their service requirements. In this paper, we present a design for providing service guarantees to virtualized network functions based on rate control. The design is a combination of rate regulation through token bucket filters and the regular scheduling mechanisms in operating systems. It has the attractive property that traffic profiles are maintained throughout a series of network functions, which makes it well suited for service function chaining.We discuss implementation alternatives for the design, and demonstrated how it can be implemented on two virtualization platforms: LXC containers and with the KVM hypervisor. To evaluate the design, we conduct experiments where we measure throughput and latency using IP forwarders as virtual network functions. Two significant factors for performance are investigated: the design of token buckets and the packet clustering effect that comes from scheduling. We implement a token bucket filter at the network device level, which is found to give better performance than the regular token bucket in Linux traffic control. The clustering effect adds burstiness, which in turn increases latency and limits the traffic profiles that can be supported. The effect is significant with KVM, but not with LXC. Finally, we demonstrate how performance guarantees are achieved for multiple virtual routers under different scenarios.
|
|
| 26. |
- Rathore, Siraj, et al.
(författare)
-
PC-based Router Virtualization with Hardware Support
- 2012
-
Ingår i: Proceedings - International Conference on Advanced Information Networking and Applications, AINA. - : IEEE Computer Society. ; , s. 573-580
-
Konferensbidrag (refereegranskat)abstract
- In this paper we focus on how to use open source Linux software in combination with PC hardware to build high speed virtual routers. Router virtualization means that multiple virtual router instances will run in parallel on the same hardware. To enable this, virtual components are combined in the router's data plane. This can result in performance penalties. Furthermore, an overloaded virtual router can affect the performance of other virtual routers running in parallel. Achieving high performance and strong performance isolation in a virtualized environment is challenging. We investigate how hardware can help to achieve these goals in the Linux Namespaces environment. We propose a forwarding architecture for virtual routers based on multi-core hardware where virtual routers can run in parallel on different CPU cores. This reduces resource contention among virtual routers and results in improved performance and isolation. To enable this architecture, we find that hardware based I/O virtualization support is essential. We demonstrate this by making a comparison with a software based I/O virtualization approach. We also show that hardware assisted virtual routers can achieve better aggregate throughput than a non-virtualized router on a multi-core platform.
|
|
| 27. |
- Razzaq, Adil, et al.
(författare)
-
Minimizing bottleneck nodes of a substrate in virtual network embedding
- 2011
-
Konferensbidrag (refereegranskat)abstract
- Network virtualization has been proposed as a way to increase the flexibility of the Internet. This could enable the provisioning of many desired services in the current architecture and allow effective sharing and use of resources. Providing virtual networks (VNs) means that virtual nodes and links need to be embedded in the underlying shared infrastructure. This embedding process, where VNs with resource demands are mapped onto a substrate with finite resources is a challenging and NP-hard problem. In this paper the focus is on mapping the VNs in such a way that node resources in the substrate are not completely exhausted. To achieve this objective, an approach referred to as bottleneck node reduced mapping is presented. This method is evaluated and compared with an approach, where resource exhaustion is not considered.
|
|
| 28. |
- Razzaq, Adil, et al.
(författare)
-
Virtual Network Embedding : A Hybrid Vertex Mapping Solution for Dynamic Resource Allocation
- 2012
-
Ingår i: Journal of Electrical and Computer Engineering. - : Hindawi Publishing Corporation. - 2090-0147 .- 2090-0155. ; :Article ID:358647, s. 1-17
-
Tidskriftsartikel (refereegranskat)abstract
- Virtual network embedding (VNE) is a key area in network virtualization, and the overall purpose of VNE is to map virtualnetworks onto an underlying physical network referred to as a substrate. Typically, the virtual networks have certain demands,such as resource requirements, that need to be satisfied by the mapping process. A virtual network (VN) can be described in termsof vertices (nodes) and edges (links) with certain resource requirements, and, to embed a VN, substrate resources are assigned tothese vertices and edges. Substrate networks have finite resources and utilizing them efficiently is an important objective for a VNEmethod. This paper analyzes two existing vertex mapping approaches—one which only considers if enough node resources areavailable for the current VN mapping and one which considers to what degree a node already is utilized by existing VN embeddingsbefore doing the vertex mapping. The paper also proposes a new vertex mapping approach which minimizes complete exhaustionof substrate nodes while still providing good overall resource utilization. Experimental results are presented to show under whatcircumstances the proposed vertex mapping approach can provide superior VN embedding properties compared to the otherapproaches.
|
|
| 29. |
|
|
| 30. |
- Su, Gang, et al.
(författare)
-
Resource management in radio access and IP-based core networks for IMT Advanced and Beyond
- 2013
-
Ingår i: Science China Information Sciences. - : Springer Nature. - 1674-733X .- 1869-1919. ; 56:2, s. 169-184
-
Tidskriftsartikel (refereegranskat)abstract
- The increased capacity needs, primarily driven by content distribution, and the vision of Internet-of-Things with billions of connected devices pose radically new demands on future wireless and mobile systems. In general the increased diversity and scale result in complex resource management and optimization problems in both radio access networks and the wired core network infrastructure. We summarize results in this area from a collaborative Sino-Swedish project within IMT Advanced and Beyond, covering adaptive radio resource management, energy-aware routing, Open Flow-based network virtualization, data center networking, and access network caching for TV on demand.
|
|
| 31. |
- Szegedi, Peter, et al.
(författare)
-
Enabling future internet research : the FEDERICA case
- 2011
-
Ingår i: IEEE Communications Magazine. - : IEEE. - 0163-6804 .- 1558-1896. ; 49:7, s. 54-61
-
Tidskriftsartikel (refereegranskat)abstract
- The Internet, undoubtedly, is the most influential technical invention of the 20th century that affects and constantly changes all aspects of our day-to-day lives nowadays. Although it is hard to predict its long-term consequences, the potential future of the Internet definitely relies on future Internet research. Prior to every development and deployment project, an extensive and comprehensive research study must be performed in order to design, model, analyze, and evaluate all impacts of the new initiative on the existing environment. Taking the ever-growing size of the Internet and the increasing complexity of novel Internet-based applications and services into account, the evaluation and validation of new ideas cannot be effectively carried out over local test beds and small experimental networks. The gap which exists between the small-scale pilots in academic and research test beds and the realize validations and actual deployments in production networks can be bridged by using virtual infrastructures. FEDERICA is one of the facilities, based on virtualization capabilities in both network and computing resources, which creates custom-made virtual environments and makes them available for Future Internet Researchers. This article provides a comprehensive overview of the state-of-the-art research projects that have been using the virtual infrastructure slices of FEDERICA in order to validate their research concepts, even when they are disruptive to the test bed’s infrastructure, to obtain results in realistic network environments.
|
|
| 32. |
- Söderman, Pehr, 1982-, et al.
(författare)
-
A Comparative Analysis of Buffer Management Algorithms for Delay Tolerant Wireless Sensor Networks
- 2021
-
Ingår i: IEEE Sensors Journal. - : Institute of Electrical and Electronics Engineers (IEEE). - 1530-437X .- 1558-1748. ; 21:7, s. 9612-9619
-
Tidskriftsartikel (refereegranskat)abstract
- One of the challenges in Delay Tolerant Wireless Sensor Networks (DT-WSN), is to handle situations where the available buffer space is insufficient- the buffer management problem. Although several buffer management algorithms have been proposed for DT-WSNs, to the best of our knowledge, there is no comprehensive study on the effects different factors have on their performance, and which evaluates the relative performance of these algorithms in different contexts. This paper evaluates in a fixed-factor factorial experiment the performance in terms of latency and Quality of Information (QoI) of four representative buffer management algorithms for DT-WSNs; two traditional, FiFO and Random, and two QoI-based algorithms- one proposed by Humber and Ngai and the SmartGap algorithm. The evaluation suggests that the buffer management algorithm in combination with employed routing protocol and the sensor node buffer sizes have a significant impact on latency, while the obtained QoI rather depends on the characteristics of the transported data and the routing protocol, provided a single-copy routing protocol is used. Moreover, the evaluation suggests that QoI-based buffer management algorithms do offer improved QoI, with an 31% improvement in MAE for SmartGap compared to FIFO. However, they do so at the expense of higher latency, with SmartGap giving a 60% higher latency than FIFO on average.
|
|
| 33. |
- Söderman, Pehr, 1982-
(författare)
-
Aspects of Quality : Using Quality Measurements to Improve Computer Network Performance
- 2016
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- As computer networks grow in complexity, measuring the performance becomes a challenge. Intrinsic properties of the networks capability to transport data, such as bandwidth, latency, loss, and error rate are not always enough to provide a clear picture of how well the network can satisfy the users' expectations. In these situations, the relationship between the users' expectations and the quality provided by the network is of interest. Today multiple approaches to quantifying quality exists, such as Quality of Service (QoS), Quality of Experience (QoE) and Quality of Information (QoI). In this thesis, we explore how such quality measurements can be used as means to improve network performance. In the first part, we examine the Quality of Service in shared experiment networks, with a focus on the FEDERICA network. We present a method for statistical analysis of metadata, based on clustering. We show that, using this method, it is possible to improve the reliability of experiments in shared experiment networks. In the second part, we take a Quality of Experience viewpoint, while doing experimental development. The goal is to improve the mobility performance of an implementation of the Stream Control Transfer Protocol (SCTP) on mobile devices. We present optimisations of the SCTP implementation along with a mobility framework, which simplifies the introduction of mobility functionality in an existing SCTP application. We show that by using this combination, it is possible to perform seamless vertical handover between WiFi and 3G cellular networks. In the third part, we focus on Quality of Information in Delay Tolerant Wireless Sensor Networks (DT-WSN). We study how it is possible to improve the quality of the measurements obtained under conditions where bandwidth and storage capacity are limited, forcing the network to discard a significant fraction of the data. We introduce the SmartGap algorithm, a buffer management algorithm for DT-WSNs, and demonstrate that this algorithm can provide significantly improved QoI over a wide range of network configurations.
|
|
| 34. |
- Söderman, Pehr, 1982-, et al.
(författare)
-
Evaluating Buffer Management Algorithms for Delay Tolerant Wireless Sensor Networks
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- One of the challenges in Delay Tolerant Wireless Sensor Networks (DT-WSN), is to handle situations where the available buffer space is insufficient. This is the buffer management problem. In this work, we the buffer management problem, with focus on algorithms to decide what data to discard when buffers are full. We simulate a wide range of network configurations, using a full factorial experiment design. The simulations let us investigate both the relative performance of four buffer management algorithms and the effect of different factors on buffer management performance. The four algorithms we investigate are the two well-known algorithms FIFO and Random Discard, and two Quality of Information based algorithms: an exponential moving average forecasting-based algorithm and the SmartGap algorithm. Our results indicate that certain factors, including mobility model and routing algorithm, have larger influence on relative performance than factors such as link speed and lifetime of data. We also find that the SmartGap buffer management algorithm provides significantly better QoI compared to the alternative algorithms.
|
|
| 35. |
- Söderman, Pehr, et al.
(författare)
-
Handover in the Wild : The feasibility of vertical handover in commodity smartphones
- 2013
-
Ingår i: Communications (ICC), 2013 IEEE International Conference on. - : IEEE conference proceedings. - 9781467331227 ; , s. 6401-6406
-
Konferensbidrag (refereegranskat)abstract
- Today commodity mobile devices are equipped withmultiple wireless access technologies. To enable continuous connectivityit is vital that these terminals provide for vertical handover between different technologies. Particularly, they should provide a vertical handover that complies with the timeliness requirements of soft real-time applications. Considering aspects such as cost- and ease-of-deployment, application neutrality, and, not least, the emergence of transport protocols that support multi-homing such as mobile SCTP and multi-path TCP, we think it would be beneficial to handle vertical handover in thetransport layer of the mobile terminal. This paper demonstrates through several real-world experiments, the feasibility of using a lightweight vertical handover scheme in smart mobile terminals for live video streaming. The vertical handover criteria is basedon the received signal strength. Our experiments suggest that thescheme indeed provides for seamless vertical handover at walking speed – our target scenario. However, the experiments also suggest that the scheme gives significant reductions in handovertime, as compared to mobile SCTP without improvements, at higher speeds.
|
|
| 36. |
- Söderman, Pehr, et al.
(författare)
-
Mind the Gap : A Simple and Effective Buffer Management Algorithm for Delay Tolerant Wireless Sensor Networks
- 2014
-
Ingår i: Tenth Swedish National Computer Networking Workshop (SNCNW 2014), Västerås, June 2-3, 2014.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Limited memory capacity is one of the major constraints in delay tolerant wireless sensor networks. Efficient management of this limited resource is critical to the performance of the network. This paper proposes a novel buffer management algorithm, SmartGap, that contrary to most other algorithms does not consider the priority of packets in isolation. Instead, SmartGap is a so-called Quality of Information (QoI) focused buffer management algorithm. That is, in a wireless sensor network that continuously measures some parameter, the value of a single packet is governed by an estimation of its importance in the reconstruction of the sampled signal. Attractive features of SmartGap include a focus on QoI, low computational complexity and simplified reconstruction of the original signal. Simulations in which the performance of SmartGap is compared with the performance of several commonly used buffer management algorithms in wireless sensor networks are provided in the paper. The outcome of these simulations suggest that SmartGap frequently provides improved QoI compared the other simulated algorithms, and upholds fairness between competing data flows.
|
|
| 37. |
- Söderman, Pehr, 1982-, et al.
(författare)
-
Mind the SmartGap : A Buffer Management Algorithm For Delay Tolerant Wireless Sensor Networks
- 2015
-
Ingår i: Wireless Sensor Networks. - Cham : Springer. - 9783319155821 - 9783319155814 ; , s. 104-119
-
Konferensbidrag (refereegranskat)abstract
- Limited memory capacity is one of the major constraints in Delay Tolerant Wireless Sensor Networks. Efficient management of the memory is critical to the performance of the network. This paper proposes a novel buffer management algorithm, SmartGap, a Quality of Information (QoI) targeted buffer management algorithm. That is, in a wireless sensor network that continuously measures a parameter which changes over time, such as temperature, the value of a single packet is governed by an estimation of its contribution to the recreation of the original signal. Attractive features of SmartGap include a low computational complexity and a simplified reconstruction of the original signal. An analysis and simulations in which the performance of SmartGap is compared with the performance of several commonly used buffer management algorithms in wireless sensor networks are provided in the paper. The simulations suggest that SmartGap indeed provides significantly improved QoI compared the other evaluated algorithms.
|
|
| 38. |
- Söderman, Pehr, et al.
(författare)
-
SCTP : Fast Transport Layer Vertical Handover in Android Mobile Devices
- 2012
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Contemporary mobile devices such as smartphones and tablets are increasingly equipped with multiple network interfaces that enable automatic vertical handover between heterogeneous wireless networks including WiFi and cellular 3G and 4G networks. However, the employed vertical handover schemes are mostly quite simple, and incur non-negligible service disruptions to ongoing sessions, e.g., video streaming and live conferencing sessions. A number of improved mobility management frameworks for these lightweight mobile devices have been proposed in the past recent years. Although these may result in negligible service disruptions, the vast majority of them are network- or integrated network- and link-layer based, and require support in the infrastructure to be successfully deployed. In this paper, we demonstrate, through the use of an Android-based mobility framework, the feasibility of using an infrastructure-independent, transport-level vertical handover scheme on a smartphone for an application as demanding as video streaming. Particularly, we show that a standardized mobility solution based on the Stream Control Transmission Protocol (SCTP) and its extension for Dynamic Address Reconfiguration (DAR) incurs a service disruption on par with comparable proposed network- and link- layer solutions.
|
|
| 39. |
- Söderman, Pehr, et al.
(författare)
-
Sub-second transport layer vertical handover using mSCTP in Android mobile devices
- 2012
-
Ingår i: Wireless Communication Systems (ISWCS), 2012 International Symposium on. - : IEEE. - 9781467307604 - 9781467307611 ; , s. 661-665
-
Konferensbidrag (refereegranskat)abstract
- Contemporary mobile devices such as smartphones and tablets are increasingly equipped with multiple network interfaces that enable automatic vertical handover between heterogeneous wireless networks including WiFi and cellular 3G and 4G networks. However, the employed vertical handover schemes are mostly quite simple, and incur non-negligible service disruptions to ongoing sessions, e.g., video streaming and live conferencing sessions. A number of improved mobility management frameworks for these lightweight mobile devices have been proposed in the past recent years. Although these may result in negligible service disruptions, the vast majority of them are network- or integrated network- and link-layer based, and require support in the infrastructure to be successfully deployed. This paper demonstrates the feasibility of using an infrastructure-independent, transport-level vertical handover scheme on a smartphone for an application as demanding as video streaming. In our study, we used a previously developed Android-based mobility framework. The study shows that a standardized mobility solution based on the Stream Control Transmission Protocol (SCTP) and its extension for Dynamic Address Reconfiguration (DAR), incurs a service disruption on par with comparable proposed network- and link-layer solutions.
|
|
| 40. |
|
|
| 41. |
- Söderman, Pehr, et al.
(författare)
-
Using metadata to improve experiment reliability in shared environments
- 2012
-
Ingår i: Traffic monitoring and analysis. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642285332 ; , s. 129-142
-
Konferensbidrag (refereegranskat)abstract
- Experimental network research is subject to challenges since the experiment outcomes can be influenced by undesired effects from other activities in the network. In shared experiment networks, control over resources is often limited and QoS guarantees might not be available. When the network conditions vary during a series of experiment unwanted artifacts can be introduced in the experimental results, reducing the reliability of the experiments. We propose a novel, systematic, methodology where network conditions are monitored during the experiments and information about the network is collected. This information, known as metadata, is analyzed statistically to identify periods during the experiments when the network conditions have been similar. Data points collected during these periods are valid for comparison. Our hypothesis is that this methodology can make experiments more reliable. We present a proof-of-concept implementation of our method, deployed in the FEDERICA and PlanetLab networks.
|
|
| 42. |
- Söderman, Pehr, et al.
(författare)
-
Using Metadata to Improve Repeatability in Shared Environments
- 2011
-
Ingår i: 7th Swedish National Computer Networking Workshop SNCNW 2011, Linköping, June 13-14, 2011.
-
Konferensbidrag (refereegranskat)abstract
- Experimental network research is subject to challenges when it comes to undesired effects on the experiment outcomes from the platform. In shared experiment networks the control over the network is limited, and QoS guarantees might not be available. The lack of predictability means that unwanted artifacts can be introduced in the measurements, reducing repeatability of experiments. We propose a novel, systematic, approach based on statistical analysis of metadata to deal with undesired effects on the measurements. Our proposal is a methodology where analysis of background measurements are used to identify comparable periods of network behavior. This can provide improved repeatability of an experiment and also reduce the required sample sizes. We present a proof-of-concept implementation of our method, deployed in the FEDERICA network.
|
|
| 43. |
- Tanyingyong, Voravit, et al.
(författare)
-
Carenet : An Architecture for Home-based Healthcare Services
- 2013
-
Ingår i: SNCNW 2013. ; , s. 28-31
-
Konferensbidrag (refereegranskat)abstract
- Doctor shortage is a universal problem. Technologies can be used to address the issue by extending the healthcare services over the data network to virtually anywhere. In this paper, we propose Carenet architecture to extend healthcare services to the home of a patient in a robust, secure, and cost-effective manner. The prototype architecture is developed using a residential gateway (RG). The RG is built using open source software on Commodity-Off-The-Shelf (COTS) hardware. It uses low-power components with multiple power sources to provide robustness. The healthcare services are offered over a private overlay network. Linux containers are used to provide service isolation on the RG. The data is encrypted at the application level for each service to ensure confidentiality. Resilient communication is realized based on physical redundant links from two Internet connections from different ISPs. The failover time within sub-seconds time frame is achieved using our prototype RG.
|
|
| 44. |
|
|
| 45. |
- Tanyingyong, Voravit, et al.
(författare)
-
Design and Implementation of an IoT-controlled DC-DC Converter
- 2013
-
Ingår i: 2013 Sustainable Internet and ICT for Sustainability, SustainIT 2013. - : IEEE. - 9783901882562 ; , s. 6685199-
-
Konferensbidrag (refereegranskat)abstract
- In line with the shift towards renewable energy, small-scale solar panels have become commonly available. Solar panels are intermittent energy sources producing direct current, and DC-DC converters are needed to convert between different voltage levels, both for different power loads and for storing energy. DC-DC converters typically have a very limited functionality and are statically configured for specific voltage levels. In this paper, we propose a new generation of flexible DC-DC converters with software and communication support (through Contiki and CoAP) for remote power monitoring and control. We present a prototype design and implementation of a DC-DC converter including a microprocessor, a lean operating system, and networking support. With such a DC-DC converter, controlled over the Internet, we can address various types of power and energy related issues and advance the state-of-the-art of green networked applications.
|
|
| 46. |
- Tanyingyong, Voravit, et al.
(författare)
-
Energy-Efficient Fixed Network Infrastructures : A Survey
- 2012
-
Ingår i: SNCNW 2012. ; , s. 21-25
-
Konferensbidrag (refereegranskat)abstract
- Energy efficiency has gained interests in the research community over the recent years thanks to the rising concerns around the globe for the greener future.With the increasing electricity price, there is also a strong economic incentive to make the network infrastructure more energy-efficient.Traditionally, the fixed network infrastructures are built with the mindset to deliver high performance and availability resulting in power-demanding network infrastructures.This paper summarizes the work done so far in the area of energy efficiency in fixed network infrastructures. We define the taxonomy of these approaches to be node level, link level, and network-wide level and give an overview of the key techniques in each category.
|
|
| 47. |
- Tanyingyong, Voravit, et al.
(författare)
-
Implementation and Deployment of an Outdoor IoT-based Air Quality Monitoring Testbed
- 2018
-
Ingår i: 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781538647271
-
Konferensbidrag (refereegranskat)abstract
- This paper presents an outdoor IoT-based air quality monitoring testbed deployed in the city of Uppsala, Sweden. Our IoT sensing unit is designed and developed using low-cost hardware components and open source software, which makes it easy to replicate. We demonstrate that it can serve as an affordable solution for real-time measurements and has potentials to complement traditional monitoring to cover larger areas. We use low-power communication based on IEEE 802.15.4, RPL, and MQTT, and achieve high end-to-end delivery ratio (>98%) in an outdoor setting. Moreover, we carry out network analysis of our testbed and provide detailed insights into its characteristics.
|
|
| 48. |
- Tanyingyong, Voravit, et al.
(författare)
-
Improving PC-based Open Flow switching performance
- 2010
-
Ingår i: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. - New York, NY, USA : ACM. - 9781450303798 ; , s. 5623840-
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we propose an architectural design to improve lookup performance of OpenFlow switching in Linux using a standard commodity network interface card based on the Intel 82599 Gigabit Ethernet controller. We describe our design and report our preliminary results that show packet switching throughput increasing up to 25 percent compared to the throughput of regular software-based OpenFlow switching.
|
|
| 49. |
- Tanyingyong, Voravit, et al.
(författare)
-
Improving Performance in a Combined Router/Server
- 2012
-
Ingår i: 2012 IEEE 13th International Conference on High Performance Switching and Routing, HPSR 2012. - : IEEE. - 9781457708329 ; , s. 52-58
-
Konferensbidrag (refereegranskat)abstract
- A modern PC-based router can provide as competitive service as a specialized hardware router while offering more flexibility and possibility to extend beyond routing. We focus on a use case in which the PC-based router also functions as a server. In this paper, we propose a multi-core based architecture for a combined router/server that efficiently provides simultaneous packet forwarding and server processing. We improve the overall performance by creating a fast path for packet forwarding through caching flow entries in on-board classification hardware on the NIC. We propose a generic design based on multi-core processors and multi-queue network interface cards. We describe a prototype implementation and present an experimental evaluation of this design. We also devise a strategy for how to efficiently map packet forwarding and application processing tasks onto the multi-core architecture.
|
|
| 50. |
- Tanyingyong, Voravit, et al.
(författare)
-
IoT-grid : IoT Communication for Smart DC Grids
- 2016
-
Ingår i: 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509013289
-
Konferensbidrag (refereegranskat)abstract
- IoT technology is considered an essential imperative for Smart Grids (SGs). However, IoT devices have inherently limited responsiveness that may not be sufficient for a time critical SG with stringent demands on communication delay. In practice, it remains an outstanding problem to combine IoT technology with existing grids. To facilitate deployment of IoT-based grids in domestic environments, we propose IoT-grid, a programmable, small-scale, direct current (DC) grid, that can be easily implemented with low-power hardware with limited processing capacity. The proposed grid adopts relatively cheap DC-DC converters which not only provide high conversion efficiency but also accommodate existing small-scale DC power systems (e.g. solar panels). We then explore the communication aspects of IoT-grid, namely, control and monitoring functions. We observe that processing delays of IoT devices have large impact on IoT-grid, which cause a chain of control commands to take considerable longer time as the number of commands increases. To mitigate this problem, we propose a mechanism based on sending burst commands with scheduled responses. Our experimental results show that, in the presence of processing delays, this method can significantly reduce the overall response time.
|
|
