Volume 8, Issue 4, August 2019, Page: 65-76
Modeling and Simulation on Securing of Software Defined Network Overlays
Tomonobu Sato, Services Division, Hitachi ICT Business Services, Ltd., Tokyo, Japan
Received: Jul. 15, 2019;       Accepted: Sep. 17, 2019;       Published: Oct. 30, 2019
DOI: 10.11648/j.ijiis.20190804.11      View  53      Downloads  6
Abstract
Security is one of the key technologies with which DX (Digital Transformation) supported. A sent data was sometimes noise for this nonlinear programming technique to have the restrictions which won't be more than 1 for the value of the amplified bit, without the most suitable functions can be found. It wasn't possible to build the large-scale network of which high security including authentication is requested. The same problem generated the algorithm which does a weighting of each antenna it became stable, and to secure high-speed transmission of a time zone cord at a multiple-input multiple-out (MIMO) channel by the Wireless environment equally. The purpose of this system is here to achieve to develop the technology for which security is secured by also utilizing the algorithm which will improve the algorithm which selects the filtering technique and the filtering which are the multiplex technology when a network transmits at high speed, and select the filtering later for a weighting of each antenna by time zone coding at the MIMO channel which is high-speed transmission technology by the wireless society and build the large-scale network environment that advantage convenience guaranteed high security highly freely and easily.
Keywords
Securing Network, Software Defined Network Overlays, MIMO
To cite this article
Tomonobu Sato, Modeling and Simulation on Securing of Software Defined Network Overlays, International Journal of Intelligent Information Systems. Special Issue: Securing of Software Defined Network Overlays. Vol. 8, No. 4, 2019, pp. 65-76. doi: 10.11648/j.ijiis.20190804.11
Copyright
Copyright © 2019 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Reference
[1]
Han, S. P. Superlinearly convergent variable metric algorithms for general nonlinear programming problems. M.
[2]
Powell, M. J. D. Algorithms for nonlinear constraints that use Lagrangian functions. Math, Program. 14 (Mar, 1978), 224-248.
[3]
Powell, M. J. D. The performance of two subroutines for constrained optimization on some difficult test problems. In Numerical Optimization 1984. P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds. SIAM, Philadelphia, 1985, 160-177.
[4]
Powell, M. J. D., and Yuan, Y. A recursive quadratic programming algorithm that uses differentiable exact penalty functions. Math, Program. 35 (July 1986), 265-278.Chamberlain, R. M., Lemarechal, C., Pedersen, H. C., and Powell, M. J. D. The watchdog technique for forcing convergence in algorithms for constrained optimization. Math, Program. Stud. 16 (Mar. 1982), 1-17.
[5]
Mar. 1982 Chamberlain, R. M., Lemarechal, C., Pedersen, H. C., and Powell, M. J. D. The watchdog technique for forcing convergence in algorithms for constrained optimization. Math, Program. Stud. 16 (Mar. 1982), 1-17.
[6]
SIAM Powell, M. J. D. The performance of two subroutines for constrained optimization on some difficult test problems. In Numerical Optimization 1984. P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds. SIAM, Philadelphia, 1985, 160-177.
[7]
Tapia, R. A. Diagonalized multiplier methods and quasi-Newton methods for constrained optimization. J. Optim. Theor. Appl. 22 (June 1977), 135-184.
[8]
Celis, M. R., Dennis, J. E., and Tapia, R. A. A trust region strategy for nonlinear equality constrained optimization. In Numerical Optimization, 1984. P. T. Boggs, R. H. Byrd, and R. B. schnabel, Eds. SIAM, Philadelphia, 1985, 71-82.
[9]
Tapia, R. A. Quasi-Newton method for equality constraint optimization: Equivalence of existing methods and a new implementation. Nonlinear Programming 3. O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds. Academic Press, New York, 1978, 125-164.
[10]
SIAM Celis, M. R., Dennis, J. E., and Tapia, R. A. A trust region strategy for nonlinear equality constrained optimization. In Numerical Optimization, 1984. P. T. Boggs, R. H. Byrd, and R. B. schnabel, Eds. SIAM, Philadelphia, 1985, 71-82.
[11]
Boggs, P. T., and Tolle, J. W. A family of descent functions for constrained optimization. SIAM J. Number. Anal. 21 (Dec. 1984), 1146-1161.
[12]
Boggs, P. T., and Tolle, J. W. A strategy for global convergence in a sequential quadratic programming algorithm. To appear in SIAM J. Number. Anal. 21 (Dec. 1984), 1146-1161.
[13]
SIAM J. Coleman, T., and Conn, A. On the local convergence of a quasi-Newton method for the nonlinear programming problem. SIAM J. Numer. Anal. 21 (Aug. 1984), 755-769.
[14]
Di Dillo, G., and Grippo, L. A new class of augmented Lagrangians in nonlinear programming. SIAM J. Control Opt. 17 (Sept. 1979), 618-628.
[15]
Fontecilla, R. A general convergence theory for quasi-Newton methods for constrained optimization. Ph.D. dissertation, Mathematical Sciences Dept., Rice Univ., Houston, Tex., 1983.
[16]
Glad, S. T. Properties of updating methods for the multiplies in augmented Lagrangiahs. J. Optim. Theor. Appl. 28 (June 1979), 135-156.
[17]
Nocedal, J., and Overton, M. Projected Hessian updating algorithms for nonlinearly constrained optimization. To appear inSIAM J. Numer. Anal.
[18]
Schittkowski, K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function, Part I: Convergence analysis. Numer. Math 38, 1 (1981), 83-114.
[19]
Rice Univ Fontecilla, R. A general convergence theory for quasi-Newton methods for constrained optimization. Ph.D. dissertation, Mathematical Sciences Dept., Rice Univ., Houston, Tex., 1983.
[20]
Numer. Math 38 Schittkowski, K. The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function, Part I: Convergence analysis. Numer. Math 38, 1 (1981), 83-114.
[21]
Tomonobu, S., Modeling and Simulation in Wireless Sensor Networks, Journal of Wireless Communications (JOWC) Special Issue on Wireless Sensor Networks - Special Issue on Wireless Sensor Networks, July, 2017
[22]
MIT Press, Cambridge I Nemenman, F Shafee &WBialek, in Advances in Neural Information Processing 14, TG Dietterich, S Becker & Z Ghahramani, eds, pp 471–478 (MIT Press, Cambridge, 2002).
[23]
N. Slonim, G. S. Atwal, G. Tkacik, W. Bialek, “Estimating Mutual Information and Multi-Information in Large Networks, ” http://arxiv.org/abs/cs/0502017.
[24]
BOX, M. J. A New method of constrained optimization and a comparison with other methods. Computer J. 8 (1965), 42-52.
Browse journals by subject