Ethernet has become one of the most researched network technologies for modern, safety-critical, distributed systems due to its maturity and low cost. Standard Ethernet, however, is unsuitable for safety-critical applications due to its lack of delivery guarantees and lack of delay bounds. The Time-Sensitive Networking (TSN) task group proposes several extensions to Standard Ethernet to address these shortcomings. One of the proposed extensions is the Time-Aware Shaper (TAS, IEEE 802.1Qbv-2015) which introduces a gate mechanism that enables scheduled transmissions and minimal jitter for high-priority messages. In order to achieve low jitter for these messages, guard bands are inserted into the schedule of the other traffic classes to ensure that the outgoing link is idle when the transmission of the high-priority message is scheduled to occur. This can result in wasted bandwidth. In this work, we propose Size-Based Queuing (SBQ) - an approach to improve bandwidth utilization in TSN networks that utilize TAS and guard bands. After a detailed description of SBQ, we provide a method to schedule an SBQ-enabled TSN network and conduct a qualitative analysis of the impact of SBQ on the transmission time of messages and the improvements on bandwidth utilization. We show that SBQ can reduce the amount of wasted bandwidth in a network, without impacting the transmission of high-priority messages or requiring extensive changes of the TSN network.
{"title":"Size-based queuing: an approach to improve bandwidth utilization in TSN networks","authors":"Florian Heilmann, G. Fohler","doi":"10.1145/3314206.3314207","DOIUrl":"https://doi.org/10.1145/3314206.3314207","url":null,"abstract":"Ethernet has become one of the most researched network technologies for modern, safety-critical, distributed systems due to its maturity and low cost. Standard Ethernet, however, is unsuitable for safety-critical applications due to its lack of delivery guarantees and lack of delay bounds. The Time-Sensitive Networking (TSN) task group proposes several extensions to Standard Ethernet to address these shortcomings. One of the proposed extensions is the Time-Aware Shaper (TAS, IEEE 802.1Qbv-2015) which introduces a gate mechanism that enables scheduled transmissions and minimal jitter for high-priority messages. In order to achieve low jitter for these messages, guard bands are inserted into the schedule of the other traffic classes to ensure that the outgoing link is idle when the transmission of the high-priority message is scheduled to occur. This can result in wasted bandwidth.\u0000 In this work, we propose Size-Based Queuing (SBQ) - an approach to improve bandwidth utilization in TSN networks that utilize TAS and guard bands. After a detailed description of SBQ, we provide a method to schedule an SBQ-enabled TSN network and conduct a qualitative analysis of the impact of SBQ on the transmission time of messages and the improvements on bandwidth utilization. We show that SBQ can reduce the amount of wasted bandwidth in a network, without impacting the transmission of high-priority messages or requiring extensive changes of the TSN network.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Time Sensitive Networks (TSN) are a novel technology that combines the larger bandwidth capabilities of Ethernet with determinism and fault tolerance for safety relevant real time systems. TSN offers bounded latency for the time triggered (TT) communication by transmitting messages according to a global schedule. Most of the scheduling algorithms in this context provide the solution only from the perspective of scheduling constraints and do not consider the impacts of routing on the scheduling problem. Therefore, these algorithms are not capable to provide effective results in the domain of many real time systems. To address interdependence of routing and scheduling constraints, we introduce a heuristic list scheduler (HLS). Our approach generates valid schedules using joint routing and scheduling constraints in one step. Due to this approach, ability to find feasible schedules is dramatically increased in comparison to the schedulers with fixed routing. In addition, HLS supports multi-cast communication, distributed real time applications and inter-flow dependencies. Experimental results shows the significant increase in the schedulability because of the task and message scheduling combined with routing.
{"title":"Heuristic list scheduler for time triggered traffic in time sensitive networks","authors":"Maryam Pahlevan, Nadra Tabassam, R. Obermaisser","doi":"10.1145/3314206.3314208","DOIUrl":"https://doi.org/10.1145/3314206.3314208","url":null,"abstract":"Time Sensitive Networks (TSN) are a novel technology that combines the larger bandwidth capabilities of Ethernet with determinism and fault tolerance for safety relevant real time systems. TSN offers bounded latency for the time triggered (TT) communication by transmitting messages according to a global schedule. Most of the scheduling algorithms in this context provide the solution only from the perspective of scheduling constraints and do not consider the impacts of routing on the scheduling problem. Therefore, these algorithms are not capable to provide effective results in the domain of many real time systems. To address interdependence of routing and scheduling constraints, we introduce a heuristic list scheduler (HLS). Our approach generates valid schedules using joint routing and scheduling constraints in one step. Due to this approach, ability to find feasible schedules is dramatically increased in comparison to the schedulers with fixed routing. In addition, HLS supports multi-cast communication, distributed real time applications and inter-flow dependencies. Experimental results shows the significant increase in the schedulability because of the task and message scheduling combined with routing.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123304390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current era can be characterized by the massive reliance on computing platforms in almost all domains, such as manufacturing, defense, healthcare, government. However, with the increased productivity, flexibility, and effectiveness that computers provide, comes the vulnerability to cyber-attacks where software, or even firmware, gets subtly modified by a hacker. The integration of a Trusted Platform Module (TPM) opts to tackle this issue by aiding in the detection of unauthorized modifications so that devices get remediation as needed. Nonetheless, the use of a TPM is impractical for resource-constrained devices due to power, space and cost limitations. With the recent proliferation of miniaturized devices along with the push towards the Internet-of Things (IoT) there is a need for a lightweight and practical alternative to the TPM. This paper proposes a cost-effective solution that incorporates modest amounts of integrated roots-of-trust logic and supports attestation of the integrity of the device's boot-up state. Our solution leverages crypto-acceleration modules found on many microprocessor and microcontroller based IoT devices nowadays, and introduces little additional overhead. The basic concepts have been validated through implementation on an SoC with an FPGA and a hard microcontroller. We report the validation results and highlight the involved tradeoffs.
{"title":"IoT boot integrity measuring and reporting","authors":"Tom Broström, John Zhu, R. Robucci, M. Younis","doi":"10.1145/3292384.3292387","DOIUrl":"https://doi.org/10.1145/3292384.3292387","url":null,"abstract":"The current era can be characterized by the massive reliance on computing platforms in almost all domains, such as manufacturing, defense, healthcare, government. However, with the increased productivity, flexibility, and effectiveness that computers provide, comes the vulnerability to cyber-attacks where software, or even firmware, gets subtly modified by a hacker. The integration of a Trusted Platform Module (TPM) opts to tackle this issue by aiding in the detection of unauthorized modifications so that devices get remediation as needed. Nonetheless, the use of a TPM is impractical for resource-constrained devices due to power, space and cost limitations. With the recent proliferation of miniaturized devices along with the push towards the Internet-of Things (IoT) there is a need for a lightweight and practical alternative to the TPM. This paper proposes a cost-effective solution that incorporates modest amounts of integrated roots-of-trust logic and supports attestation of the integrity of the device's boot-up state. Our solution leverages crypto-acceleration modules found on many microprocessor and microcontroller based IoT devices nowadays, and introduces little additional overhead. The basic concepts have been validated through implementation on an SoC with an FPGA and a hard microcontroller. We report the validation results and highlight the involved tradeoffs.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115803328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The advantages of the Internet of things (IoT) initiated the vision of Industry 4.0 in Europe and smart manufacturing in USA. Both visions aim to implement the smart factory to achieve similar objectives by utilizing new technologies. These technologies include cloud computing, fog computing, cyber-physical systems (CPS), and data analytics. Together they help automate and autonomize the manufacturing processes and controls to optimize the productivity, reliability, quality, cost-effeteness, and safety of these processes. While both visions are promising, developing and operating Industry 4.0 applications are extremely challenging. This is due to the complexity of the manufacturing processes as well as their management, controls, and integration dynamics. This paper introduces Man4Ware, a service-oriented middleware for Industry 4.0. Man4Ware can help facilitate the development and operations of cloud and fog-integrated smart manufacturing applications. Man4Ware offers many advantages through service level interfaces to enable easy utilization of new technologies and integration of different services to relax many of the challenges facing the development and operations of such applications1.
{"title":"A service-oriented middleware framework for manufacturing industry 4.0","authors":"J. Al-Jaroodi, N. Mohamed, I. Jawhar","doi":"10.1145/3292384.3292389","DOIUrl":"https://doi.org/10.1145/3292384.3292389","url":null,"abstract":"The advantages of the Internet of things (IoT) initiated the vision of Industry 4.0 in Europe and smart manufacturing in USA. Both visions aim to implement the smart factory to achieve similar objectives by utilizing new technologies. These technologies include cloud computing, fog computing, cyber-physical systems (CPS), and data analytics. Together they help automate and autonomize the manufacturing processes and controls to optimize the productivity, reliability, quality, cost-effeteness, and safety of these processes. While both visions are promising, developing and operating Industry 4.0 applications are extremely challenging. This is due to the complexity of the manufacturing processes as well as their management, controls, and integration dynamics. This paper introduces Man4Ware, a service-oriented middleware for Industry 4.0. Man4Ware can help facilitate the development and operations of cloud and fog-integrated smart manufacturing applications. Man4Ware offers many advantages through service level interfaces to enable easy utilization of new technologies and integration of different services to relax many of the challenges facing the development and operations of such applications1.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"12 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120899046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper addresses the issue of secure and trusted Internet of Things (IoT) networks by adopting the emerging blockchain technologies. This paper proposes a new hybrid blockchain technology to address the trusted IoT issues such as trustless communications and decentralized applications. Besides, we also present that the pseudonymous authentication technique can use a puzzle-solving computation to enable trustless communications for the IoT and provide the capabilities of near real-time transactions. In our previous work, we presented a decentralized software framework for the IoT by using a p2p network and the concept of the blockchain. In this paper, we outline the core components of the hybrid blockchain and delve deeper the algorithms of the hybrid consensus to provide the capabilities for our hybrid blockchain technology.
{"title":"Hybrid blockchain and pseudonymous authentication for secure and trusted IoT networks","authors":"Jollen Chen","doi":"10.1145/3292384.3292388","DOIUrl":"https://doi.org/10.1145/3292384.3292388","url":null,"abstract":"This paper addresses the issue of secure and trusted Internet of Things (IoT) networks by adopting the emerging blockchain technologies. This paper proposes a new hybrid blockchain technology to address the trusted IoT issues such as trustless communications and decentralized applications. Besides, we also present that the pseudonymous authentication technique can use a puzzle-solving computation to enable trustless communications for the IoT and provide the capabilities of near real-time transactions. In our previous work, we presented a decentralized software framework for the IoT by using a p2p network and the concept of the blockchain. In this paper, we outline the core components of the hybrid blockchain and delve deeper the algorithms of the hybrid consensus to provide the capabilities for our hybrid blockchain technology.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114705223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In designing and analyzing real-time systems, the central problem resides in finding a feasible schedule for a given task set, if one exists. A lot of research effort has been carried out in approaching the various aspects of task scheduling. While most results have been achieved for preemptive scheduling, the non-preemptive case has still room for improvement, due to its complexity. In addition, the widespread usage of cyber-physical systems (CPS) is putting real-time scheduling in the position to deal with new challenges, as additional (and sometimes particular) requirements are raised by such systems. This paper, which continues the previous work of the authors, introduces a new lower bound on the number of processing units that allows a feasible schedule of a task set for both preemptive and non-preemptive scheduling. As a specific CPS issue, the necessity of moving the processing units in space, which incurs additional time requirements, is considered. The single-instance case is first discussed, then the results are extended to the periodic case.
{"title":"Bounding execution resources for the task scheduling problem in cyber-physical systems","authors":"V. Radulescu, S. Andrei, A. Cheng","doi":"10.1145/3269482.3269486","DOIUrl":"https://doi.org/10.1145/3269482.3269486","url":null,"abstract":"In designing and analyzing real-time systems, the central problem resides in finding a feasible schedule for a given task set, if one exists. A lot of research effort has been carried out in approaching the various aspects of task scheduling. While most results have been achieved for preemptive scheduling, the non-preemptive case has still room for improvement, due to its complexity. In addition, the widespread usage of cyber-physical systems (CPS) is putting real-time scheduling in the position to deal with new challenges, as additional (and sometimes particular) requirements are raised by such systems.\u0000 This paper, which continues the previous work of the authors, introduces a new lower bound on the number of processing units that allows a feasible schedule of a task set for both preemptive and non-preemptive scheduling. As a specific CPS issue, the necessity of moving the processing units in space, which incurs additional time requirements, is considered. The single-instance case is first discussed, then the results are extended to the periodic case.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123384571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abort-and-Restart model is used in Priority-based Functional Reactive Programming in which higher priority tasks can preempt lower priority tasks and the lower priority tasks are aborted and restarted after the higher priority tasks have finished execution. This paper discusses a potential of improving schedulability in P-FRP systems by using preemption threshold that it allows a task to only disable preemption of tasks up to a specified threshold priority. Also, a sufficient schedulability test condition is studied in this paper for P-FRP tasks using preemption threshold, which is a critical problem to be solved in order to explore the potential benefit.
{"title":"P-FRP task scheduling with preemption threshold","authors":"Jian Lin, A. Cheng","doi":"10.1145/3269482.3269485","DOIUrl":"https://doi.org/10.1145/3269482.3269485","url":null,"abstract":"Abort-and-Restart model is used in Priority-based Functional Reactive Programming in which higher priority tasks can preempt lower priority tasks and the lower priority tasks are aborted and restarted after the higher priority tasks have finished execution. This paper discusses a potential of improving schedulability in P-FRP systems by using preemption threshold that it allows a task to only disable preemption of tasks up to a specified threshold priority. Also, a sufficient schedulability test condition is studied in this paper for P-FRP tasks using preemption threshold, which is a critical problem to be solved in order to explore the potential benefit.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122089425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Android is becoming used more frequently in domains that expect some real-time guarantees. To facilitate the adoption of Android for programming real-time systems, this work presents a first effort to apply real-time scheduling theories to a real-time extension on Android, RTDroid. We integrate real-time properties specified in RT-Droid's application manifest with an existing real-time scheduling framework, Cheddar. We leverage Cheddar to perform schedulability analysis and feasibility tests, based on the properties of RTDroid application components specified in the application manifest. This paper details our integration process and reports our experience of validating real-time properties in a real-time application developed on RTDroid.
{"title":"Application validation on RTDroid","authors":"Yin Yan, Lukasz Ziarek","doi":"10.1145/3269482.3269484","DOIUrl":"https://doi.org/10.1145/3269482.3269484","url":null,"abstract":"Android is becoming used more frequently in domains that expect some real-time guarantees. To facilitate the adoption of Android for programming real-time systems, this work presents a first effort to apply real-time scheduling theories to a real-time extension on Android, RTDroid. We integrate real-time properties specified in RT-Droid's application manifest with an existing real-time scheduling framework, Cheddar. We leverage Cheddar to perform schedulability analysis and feasibility tests, based on the properties of RTDroid application components specified in the application manifest. This paper details our integration process and reports our experience of validating real-time properties in a real-time application developed on RTDroid.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124983531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gautham Nayak Seetanadi, Luis Oliveira, L. Almeida, Karl-Erik Årzén, M. Maggio
Devices sharing a network compete for bandwidth, being able to transmit only a limited amount of data. This is for example the case with a network of cameras, that should record and transmit video streams to a monitor node for video surveillance. Adaptive cameras can reduce the quality of their video, thereby increasing the frame compression, to limit network congestion. In this paper, we exploit our experience with computing capacity allocation to design and implement a network bandwidth allocation strategy based on game theory, that accommodates multiple adaptive streams with convergence guarantees. We conduct some experiments with our implementation and discuss the results, together with some conclusions and future challenges.
{"title":"Game-theoretic network bandwidth distribution for self-adaptive cameras","authors":"Gautham Nayak Seetanadi, Luis Oliveira, L. Almeida, Karl-Erik Årzén, M. Maggio","doi":"10.1145/3267419.3267424","DOIUrl":"https://doi.org/10.1145/3267419.3267424","url":null,"abstract":"Devices sharing a network compete for bandwidth, being able to transmit only a limited amount of data. This is for example the case with a network of cameras, that should record and transmit video streams to a monitor node for video surveillance. Adaptive cameras can reduce the quality of their video, thereby increasing the frame compression, to limit network congestion. In this paper, we exploit our experience with computing capacity allocation to design and implement a network bandwidth allocation strategy based on game theory, that accommodates multiple adaptive streams with convergence guarantees. We conduct some experiments with our implementation and discuss the results, together with some conclusions and future challenges.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127874379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Traditional Ethernet-based IP networks do not have the capability to provide the Quality of Service (QoS) required for professional real-time multimedia applications. This is because they operate on a best-effort network service model that does not provide service guarantee. Network operators and service providers require a novel network architecture to efficiently handle the increasing demands of this changing network domain. Software-Defined Networking has emerged as an effective network architecture that decouples the control plane and data plane, which makes it capable of handling the dynamic nature of future network functions and intelligent applications while reducing cost through simplified hardware, software, and management. This paper presents an SDN architecture for real-time low latency applications that offer adaptive path provisioning based on the calculated end-to-end delay, available bandwidth, and traditional shortest path first algorithm. The SDN architecture utilises the Ryu OpenFlow application programming interface (API) to perform real-time monitoring to collect network statistics and computes the appropriate paths by using this information. The experiment to ascertain the feasibility and evaluate the effectiveness of this approach is carried out in an emulated network environment using Mininet.
{"title":"Constraint-aware software-defined network for routing real-time multimedia","authors":"Oluwaseyi Oginni, P. Bull, Yonghao Wang","doi":"10.1145/3267419.3267425","DOIUrl":"https://doi.org/10.1145/3267419.3267425","url":null,"abstract":"Traditional Ethernet-based IP networks do not have the capability to provide the Quality of Service (QoS) required for professional real-time multimedia applications. This is because they operate on a best-effort network service model that does not provide service guarantee. Network operators and service providers require a novel network architecture to efficiently handle the increasing demands of this changing network domain. Software-Defined Networking has emerged as an effective network architecture that decouples the control plane and data plane, which makes it capable of handling the dynamic nature of future network functions and intelligent applications while reducing cost through simplified hardware, software, and management.\u0000 This paper presents an SDN architecture for real-time low latency applications that offer adaptive path provisioning based on the calculated end-to-end delay, available bandwidth, and traditional shortest path first algorithm. The SDN architecture utilises the Ryu OpenFlow application programming interface (API) to perform real-time monitoring to collect network statistics and computes the appropriate paths by using this information. The experiment to ascertain the feasibility and evaluate the effectiveness of this approach is carried out in an emulated network environment using Mininet.","PeriodicalId":447904,"journal":{"name":"SIGBED Rev.","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122210495","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：