As a vast amount of data with respect to the moon and Mars is collected, exploration missions are shifting to the next step, the aim of which is a precise landing on a predetermined target. A promising technology for precision landing is terrain relative navigation (TRN), which collates landmarks detected from images and maps of landmarks. Crater detection is one of the essential technologies for TRN. A problem in detecting craters is the apparent change in craters due to illumination conditions. Another problem is the change in shape due to crater degradation. We propose a novel crater detection method based on combining a support vector machine (SVM) and a convolutional neural network (CNN) to make detection performance robust against apparent change. In the linear SVM, gradient images of a crater image dataset are learned. The learned classi fi er is then used to calculate the objectness score for region proposal. Next, the CNN identi fi es the image of the proposed region as to whether or not it is a crater. Our results show that the proposed method can detect craters in a wide range of illumination and shape conditions, and has better average precision than traditional crater de-tectors.
{"title":"Crater Detection Robust to Illumination and Shape Changes using Convolutional Neural Network","authors":"T. Ishida, Masaki Takahashi, S. Fukuda","doi":"10.2322/tjsass.64.197","DOIUrl":"https://doi.org/10.2322/tjsass.64.197","url":null,"abstract":"As a vast amount of data with respect to the moon and Mars is collected, exploration missions are shifting to the next step, the aim of which is a precise landing on a predetermined target. A promising technology for precision landing is terrain relative navigation (TRN), which collates landmarks detected from images and maps of landmarks. Crater detection is one of the essential technologies for TRN. A problem in detecting craters is the apparent change in craters due to illumination conditions. Another problem is the change in shape due to crater degradation. We propose a novel crater detection method based on combining a support vector machine (SVM) and a convolutional neural network (CNN) to make detection performance robust against apparent change. In the linear SVM, gradient images of a crater image dataset are learned. The learned classi fi er is then used to calculate the objectness score for region proposal. Next, the CNN identi fi es the image of the proposed region as to whether or not it is a crater. Our results show that the proposed method can detect craters in a wide range of illumination and shape conditions, and has better average precision than traditional crater de-tectors.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Abstracts of the Papers Published in Journal of the Japan Society for Aeronautical and Space Sciences (Vol. 69, No. 3, Jun. 2021)","authors":"","doi":"10.2322/tjsass.64.246","DOIUrl":"https://doi.org/10.2322/tjsass.64.246","url":null,"abstract":"","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A whirling arm is an effective device to measure propeller characteristics at low advance ratios. In the authors’ preceding research, an apparent advance ratio was adopted to determine propeller characteristics. The apparent advance ratio is determined only by the relative airspeed of the rotating arm and propeller in still air, and is used in wind tunnel measurements. However, in the case of whirling arm measurements, the advance ratio should be determined appropriately considering the additional airspeed induced by propeller wakes and swirling flow generated by the rotating arm. To address the above issue, we propose an airspeed model of blades considering velocity fields induced by the surrounding vortices. We also propose a procedure to calculate an appropriate advance ratio and the steady characteristics based on the proposed model. The validity of the proposed airspeed model is evaluated by making a comparison with the results of wind tunnel experiments. The corrected propeller characteristics using our airspeed model shows good consistency with the data referred from an existing propeller characteristics database.
{"title":"Modeling and Numerical Investigation of Aerodynamic Characteristics of a Propeller Circling on a Whirling Arm","authors":"Yuto Itoh, A. Satoh","doi":"10.2322/tjsass.64.335","DOIUrl":"https://doi.org/10.2322/tjsass.64.335","url":null,"abstract":"A whirling arm is an effective device to measure propeller characteristics at low advance ratios. In the authors’ preceding research, an apparent advance ratio was adopted to determine propeller characteristics. The apparent advance ratio is determined only by the relative airspeed of the rotating arm and propeller in still air, and is used in wind tunnel measurements. However, in the case of whirling arm measurements, the advance ratio should be determined appropriately considering the additional airspeed induced by propeller wakes and swirling flow generated by the rotating arm. To address the above issue, we propose an airspeed model of blades considering velocity fields induced by the surrounding vortices. We also propose a procedure to calculate an appropriate advance ratio and the steady characteristics based on the proposed model. The validity of the proposed airspeed model is evaluated by making a comparison with the results of wind tunnel experiments. The corrected propeller characteristics using our airspeed model shows good consistency with the data referred from an existing propeller characteristics database.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68664033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The objective of this study is to determine the two-dimensional unsteady aerodynamic forces and moment acting on a heaving wing in a uniform flow using a wind tunnel. However, it is difficult to measure the aerodynamic forces acting on the heaving wing due to measuring device oscillation and the large inertial force of the wing model. In this study, a new type of wind tunnel test, named ‘‘heaving wind tunnel,’’ was developed. Here, the wing model remains stationary as the wind tunnel oscillates with a heaving motion. The advantage of this experimental method is that the measurement results are unaffected by the large inertial force acting on the oscillating wing model. Therefore, the wing model can be used in the same way as in steady state experiments. The normal force, thrust and pitching moment coefficients of a heaving airfoil were measured using the heaving wind tunnel test developed in this study. Through flow visualizations and pressure measurements, we found that the rapid drop in normal force coefficient after it reached its maximum value was due to a large growing leading-edge vortex.
{"title":"Measurement of Unsteady Aerodynamic Characteristics of a Heaving Wing in a Low Reynolds Number Flow","authors":"M. Okamoto, Shota Fukatsu, D. Sasaki","doi":"10.2322/TJSASS.64.147","DOIUrl":"https://doi.org/10.2322/TJSASS.64.147","url":null,"abstract":"The objective of this study is to determine the two-dimensional unsteady aerodynamic forces and moment acting on a heaving wing in a uniform flow using a wind tunnel. However, it is difficult to measure the aerodynamic forces acting on the heaving wing due to measuring device oscillation and the large inertial force of the wing model. In this study, a new type of wind tunnel test, named ‘‘heaving wind tunnel,’’ was developed. Here, the wing model remains stationary as the wind tunnel oscillates with a heaving motion. The advantage of this experimental method is that the measurement results are unaffected by the large inertial force acting on the oscillating wing model. Therefore, the wing model can be used in the same way as in steady state experiments. The normal force, thrust and pitching moment coefficients of a heaving airfoil were measured using the heaving wind tunnel test developed in this study. Through flow visualizations and pressure measurements, we found that the rapid drop in normal force coefficient after it reached its maximum value was due to a large growing leading-edge vortex.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68662625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents an effective maximal-length sequence design for system identification of a continuous-time linear aircraft model. The maximum-length sequence is used as the exciting signal because it is a realistic signal for identifying the aircraft model. This paper proposes two design parameters for the maximum-length sequence, which are related to the dynamical modes of aircraft. According to the identification procedures using the proposed design parameters and the subspace identification method, a continuous-time linear aircraft model in longitudinal motion is well identified in a numerical simulation.
{"title":"An Effective Maximal-Length Sequence Design for System Identification of a Continuous-Time Linear Aircraft Model","authors":"A. Fujimori, S. Oh-hara","doi":"10.2322/tjsass.64.215","DOIUrl":"https://doi.org/10.2322/tjsass.64.215","url":null,"abstract":"This paper presents an effective maximal-length sequence design for system identification of a continuous-time linear aircraft model. The maximum-length sequence is used as the exciting signal because it is a realistic signal for identifying the aircraft model. This paper proposes two design parameters for the maximum-length sequence, which are related to the dynamical modes of aircraft. According to the identification procedures using the proposed design parameters and the subspace identification method, a continuous-time linear aircraft model in longitudinal motion is well identified in a numerical simulation.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many works have reported on various sensor network position estimation methods based on the relative distance measurement that can be used when the global navigation satellite system is environmentally denied or degraded.1–3) Among others, trilateration algorithms are widely adopted because of their simple principle.4–6) However, the algorithms possibly fail if the sensors have a low range of communication or the environment includes obstacles.7) Typically, such distance-based localization algorithms are used to construct a globally rigid network.8,9) In other words, albeit each sensor, called node herein, has a limited transmission range, unmanned agents, like unmanned aerial vehicles (UAVs), should be inside the coverage space to receive the sensors’ information.10) Therefore, the typical algorithm requires a network that can adequately cover a certain area and must be capable of communicating with at least three sensors at any point in the area. However, such a network is not always guaranteed. This study proposes a strategy to maximize UAV’s navigation in a sparse wireless sensor network (SWSN) in the manner of the shortest distance travel. The overlapping (or localizable) area, which is calculated using the positions of three disks constructed by the sensor’s transmission range, is used to characterize the possibility of localizing UAVs through trilateration. To ensure that a UAV travels from a starting point to a destination point via the localizable area, it must pass the points that are defined by a sensor set, called vertices. The keys are to find such vertices to define a graph that is flexible to various network complexities that are determined by the combination of sensors and reduce the number of search nodes or the total distance. To determine the shortest path, the Dijkstra algorithm,11,12) one of the most widely used algorithms, is applied with proper modifications. The feasibility of the proposed method is verified through twodimensional (2D) and 3D examples.
{"title":"Efficient Navigation for Unmanned Agents in Sparse Wireless Sensor Networks","authors":"Donghoon Kim","doi":"10.2322/tjsass.64.283","DOIUrl":"https://doi.org/10.2322/tjsass.64.283","url":null,"abstract":"Many works have reported on various sensor network position estimation methods based on the relative distance measurement that can be used when the global navigation satellite system is environmentally denied or degraded.1–3) Among others, trilateration algorithms are widely adopted because of their simple principle.4–6) However, the algorithms possibly fail if the sensors have a low range of communication or the environment includes obstacles.7) Typically, such distance-based localization algorithms are used to construct a globally rigid network.8,9) In other words, albeit each sensor, called node herein, has a limited transmission range, unmanned agents, like unmanned aerial vehicles (UAVs), should be inside the coverage space to receive the sensors’ information.10) Therefore, the typical algorithm requires a network that can adequately cover a certain area and must be capable of communicating with at least three sensors at any point in the area. However, such a network is not always guaranteed. This study proposes a strategy to maximize UAV’s navigation in a sparse wireless sensor network (SWSN) in the manner of the shortest distance travel. The overlapping (or localizable) area, which is calculated using the positions of three disks constructed by the sensor’s transmission range, is used to characterize the possibility of localizing UAVs through trilateration. To ensure that a UAV travels from a starting point to a destination point via the localizable area, it must pass the points that are defined by a sensor set, called vertices. The keys are to find such vertices to define a graph that is flexible to various network complexities that are determined by the combination of sensors and reduce the number of search nodes or the total distance. To determine the shortest path, the Dijkstra algorithm,11,12) one of the most widely used algorithms, is applied with proper modifications. The feasibility of the proposed method is verified through twodimensional (2D) and 3D examples.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, the application of a deep-learning technique to fl uid analysis has been suggested. Additionally, a deep-learning-based method called the Deep Galerkin Method (DGM) has been suggested for solving a partial di ff erential equation. In DGM, a loss function for training a deep neural network is formulated so that di ff erential operators, boundary conditions, and initial conditions of the targeted partial di ff erential equation are satis fi ed. This study aims to extend and apply DGM to solving compressible Navier-Stokes equations and examine the feasibility of using DGM for fl uid analysis. In this paper, DGM is applied to two-dimensional Burgers equations with periodic boundary conditions, one-dimen-sional Navier-Stokes equations for a shock tube problem, and two-dimensional Navier-Stokes equations for the supersonic fl ow around a blunt body. The approximate solutions obtained using DGM show generally good agreement with that obtained using a fi nite di ff erence method.
{"title":"Application of Deep Galerkin Method to Solve Compressible Navier-Stokes Equations","authors":"M. Matsumoto","doi":"10.2322/tjsass.64.348","DOIUrl":"https://doi.org/10.2322/tjsass.64.348","url":null,"abstract":"Recently, the application of a deep-learning technique to fl uid analysis has been suggested. Additionally, a deep-learning-based method called the Deep Galerkin Method (DGM) has been suggested for solving a partial di ff erential equation. In DGM, a loss function for training a deep neural network is formulated so that di ff erential operators, boundary conditions, and initial conditions of the targeted partial di ff erential equation are satis fi ed. This study aims to extend and apply DGM to solving compressible Navier-Stokes equations and examine the feasibility of using DGM for fl uid analysis. In this paper, DGM is applied to two-dimensional Burgers equations with periodic boundary conditions, one-dimen-sional Navier-Stokes equations for a shock tube problem, and two-dimensional Navier-Stokes equations for the supersonic fl ow around a blunt body. The approximate solutions obtained using DGM show generally good agreement with that obtained using a fi nite di ff erence method.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68664111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An improved algorithm is proposed to manage with the huge computation burden of the quaternion particle filter in aircraft attitude estimation. Based on the particle filtering frame, the new filter provides robust performance for nonlinear and non-Gaussian stochastic systems. And the posterior distribution of the new estimator is approximated as a new quaternion distribution to realize parallel computation. In addition, similar to the extended Kalman filter, this new method implements time update by replacing particles update with linear transformation to reduce computational complexity. Numerical simulations are carried out to compare the new algorithm to the extended Kalman filter and to quaternion particle filter in simulation results. The simulation results indicate that this estimation technique has faster convergence rate than the extended Kalman filter and takes less computation times than quaternion particle filter under the same accuracy as quaternion particle filter.
{"title":"Attitude Estimation Using Parallel Quaternion Particle Filter Based on New Quaternion Distribution","authors":"Zhaihe Zhou, Zhong Yulu, Chuanwei Zeng, Xiangrui Tian","doi":"10.2322/tjsass.64.249","DOIUrl":"https://doi.org/10.2322/tjsass.64.249","url":null,"abstract":"An improved algorithm is proposed to manage with the huge computation burden of the quaternion particle filter in aircraft attitude estimation. Based on the particle filtering frame, the new filter provides robust performance for nonlinear and non-Gaussian stochastic systems. And the posterior distribution of the new estimator is approximated as a new quaternion distribution to realize parallel computation. In addition, similar to the extended Kalman filter, this new method implements time update by replacing particles update with linear transformation to reduce computational complexity. Numerical simulations are carried out to compare the new algorithm to the extended Kalman filter and to quaternion particle filter in simulation results. The simulation results indicate that this estimation technique has faster convergence rate than the extended Kalman filter and takes less computation times than quaternion particle filter under the same accuracy as quaternion particle filter.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Efficient operation is important to make full use of the capabilities of China’s space station. Determining the stochastic impacts of emergencies on the operational scenario of the space station is critical for successful implementation. However, few studies have assessed the uncertainties in the operational processes of the space station. To fill this gap, discrete event simulation (DES) is used to develop an evaluation method for the contingent operational plan of a space station. First, DES is used to develop a model framework of the space station operations, and the launch delay of cargo vehicles is introduced into the integrated simulation procedure. Second, the precision of the results and the computational efficiency are improved using the variance reduction technique. The corresponding effect on the number of simulation trials is confirmed using four constraints and three measurable metrics. Finally, the proposed method is applied to a two-year space station operational plan. The results show that maintaining a short interval between the launch date of the cargo vehicles and the start of the launch windows can decrease prolonged duration after a launch delay. A statistical analysis can be used to determine a safe interval between the dates of the events and vehicle launch.
{"title":"Simulation and Evaluation of a Space Station Operational Plan Considering Launch Delay of Cargo Vehicles","authors":"Shuai Guo, Jin Zhang, Ya-zhong Luo","doi":"10.2322/tjsass.64.50","DOIUrl":"https://doi.org/10.2322/tjsass.64.50","url":null,"abstract":"Efficient operation is important to make full use of the capabilities of China’s space station. Determining the stochastic impacts of emergencies on the operational scenario of the space station is critical for successful implementation. However, few studies have assessed the uncertainties in the operational processes of the space station. To fill this gap, discrete event simulation (DES) is used to develop an evaluation method for the contingent operational plan of a space station. First, DES is used to develop a model framework of the space station operations, and the launch delay of cargo vehicles is introduced into the integrated simulation procedure. Second, the precision of the results and the computational efficiency are improved using the variance reduction technique. The corresponding effect on the number of simulation trials is confirmed using four constraints and three measurable metrics. Finally, the proposed method is applied to a two-year space station operational plan. The results show that maintaining a short interval between the launch date of the cargo vehicles and the start of the launch windows can decrease prolonged duration after a launch delay. A statistical analysis can be used to determine a safe interval between the dates of the events and vehicle launch.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68663794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With growing avionics applications, the transmission of avionics data fl ows has been increasing in real-time avionics networks of aircraft. An Avionics Full DupleX switched Ethernet (AFDX), standardized as ARINC 664, is chosen as the backbone network for distributed real-time avionics systems as it o ff ers high throughput and does not require global clock synchronization. Estimating the end-to-end transmission delay to validate the network performance is essential for both certi fi cation and industrial research. Because of the various waiting times caused by the backlog (i.e., the pending packets in the output port of the visited switch), it is necessary and reasonable to compute the worst-case end-to-end transmission delay to validate network performance. Several approaches have been designed to compute the upper boundaries of end-to-end transmission delays, such as the Network Calculus approach and the Trajectory approach. In this paper, we focus on a new approach, Forward end-to-end delay Analysis (FA). This approach iteratively estimates the maximum backlog (i.e., number of pending packets) in each switch visited along the transmission path, so that the worst-case end-to-end transmission delay can be computed and the network performance evaluated. We also present the termination condition for this iterative estimation. The experiments demonstrate that this approach achieves a more accurate evaluation of transmission performance than the Network Calculus approach. A comparison with the exact upper boundaries obtained using the Model Checking approach shows the pessimism (i.e., overestimation) in FA. This paper analyses the reasons for that pessimism, and proposes future research.
{"title":"Performance Evaluation on Packet Transmission for Distributed Real-time Avionics Networks Using Forward End-to-End Delay Analysis","authors":"Qingfei Xu, Xinyu Yang","doi":"10.2322/tjsass.64.1","DOIUrl":"https://doi.org/10.2322/tjsass.64.1","url":null,"abstract":"With growing avionics applications, the transmission of avionics data fl ows has been increasing in real-time avionics networks of aircraft. An Avionics Full DupleX switched Ethernet (AFDX), standardized as ARINC 664, is chosen as the backbone network for distributed real-time avionics systems as it o ff ers high throughput and does not require global clock synchronization. Estimating the end-to-end transmission delay to validate the network performance is essential for both certi fi cation and industrial research. Because of the various waiting times caused by the backlog (i.e., the pending packets in the output port of the visited switch), it is necessary and reasonable to compute the worst-case end-to-end transmission delay to validate network performance. Several approaches have been designed to compute the upper boundaries of end-to-end transmission delays, such as the Network Calculus approach and the Trajectory approach. In this paper, we focus on a new approach, Forward end-to-end delay Analysis (FA). This approach iteratively estimates the maximum backlog (i.e., number of pending packets) in each switch visited along the transmission path, so that the worst-case end-to-end transmission delay can be computed and the network performance evaluated. We also present the termination condition for this iterative estimation. The experiments demonstrate that this approach achieves a more accurate evaluation of transmission performance than the Network Calculus approach. A comparison with the exact upper boundaries obtained using the Model Checking approach shows the pessimism (i.e., overestimation) in FA. This paper analyses the reasons for that pessimism, and proposes future research.","PeriodicalId":54419,"journal":{"name":"Transactions of the Japan Society for Aeronautical and Space Sciences","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68662478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：