A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Pramananda Perumal, T.
- IPv6 Transition Techniques – Dual Stack and Tunneling
Authors
1 Presidency College, Kamarajar Salai, Triplicane, Chennai-600 005, Tamil Nadu, IN
Source
Indian Journal of Economics and Development, Vol 5, No 4 (2017), Pagination: 1-9Abstract
Objectives: IPv6 is to be used largely in the growing internetworks. At present IPv4 is used extensively. Migrating from IPv4 to IPv6 is a challenge, considering many factors like hardware, applications and networks reach ability. This paper explains the drawbacks of IPv4, advantages of IPv6 and migration techniques to IPv6.
Methods/Analysis: GNS3 is a networking simulator. Using this simulation tools, network topologies can be built, and the routers can be configured. Using this GNS3 simulation tool, two topologies are built with IPv4 and IPv6 to coexist, and only IPv4 networks between two IPv6 networks.
Results/Findings: The appropriate migration techniques, dual stack and tunneling were configured in the routers and end results of reach ability were tested.
Applications: IPv6 can be used in many applications like IoT, vehicle tracking, automatic maintenance of building, in health care, remote monitoring, etc.
Keywords
IPv4 Address- Internet Protocol Address Version 4, IPv6 – Internet Protocol Address Version 6, NAT – Network Address Translation, IPsec – IP Security, QoS, IPv4 Header, IPv6 Header, Routing Table, Routing Crisis, Auto-Configuration, Dual Stack, Tunneling, DHCP v6, ISP – Internet Service Provider.Full Text
References
- IETF IPv6 Working group: https://datatracker.ietf.org/wg/ipv6/documents/. Date accessed: 10/11/2016.
- IPv6 Forum: http://www.ipv6forum.com. Date accessed: 20/12/2016.
- IPv6 Forum India: https://www.ipv6.com/general/ipv6-the-next-generation-internet. Date accessed: 20/12/2016
- IPv6 Information: https://www.internetsociety.org/deploy360/ipv6/. Date accessed: 07/01/2017
- Department of Telecommunications. www.dot.gov.in/ntcell. Date accessed: 31/08/2016.
- Joseph Davies. Understanding IPv6 3rd. 2012.
- Boltzmann and Non-Boltzmann Sampling for Image Processing
Authors
1 Presidency College, Kamarajar Salai, Triplicane, Chennai-600 005, Tamil Nadu, IN
2 Chennai Mathematical Institute (CMI), Siruseri, Kelambakkam, Chennai-603 103, Tamil Nadu, IN
Source
Indian Journal of Economics and Development, Vol 5, No 9 (2017), Pagination: 1-8Abstract
Objectives: We present two algorithms for image processing; the first is based on Boltzmann sampling and the second on entropic sampling.
Methods: These algorithms come within the Bayesian framework which has three components: 1. Likelihood: a conditional density - the probability of a noisy image given a clean image, 2. A Prior and, 3. A Posterior: a conditional density - the probability of a clean image given a noisy image. The Likelihood provides a model for the degradation process; the Prior models what we consider as a clean image; it also provides a means of incorporating whatever data we have of the image; the Posterior combines the Prior and Likelihood and provides an estimate of the clean counterpart of the given noisy image. The algorithm sets a competition between: 1. The Likelihood that tries to anchor the image to the given noisy image so that the features present can be retained including perhaps the noisy ones and, 2. The Prior which tries to make the image smooth, even at the risk of eliminating some genuine features of the image other than the noise.
Findings: A proper choice of the prior and the likelihood functions would lead to good image processing. We need also good estimators of the clean image.
Application: The choice of estimators is somewhat straight forward for image processing employing Boltzmann algorithm. For non-Boltzmann algorithm we need efficient estimators that make full use of the entropic ensemble generated.
Keywords
Image Processing, Prior, Posterior, Boltzmann Sampling, Entropic Sampling, Bayesian.Full Text
References
- S. Gemen, D. Gemen. Stochastic relaxation, Gibbs distributions, and Bayesian restoration. IEEE Transactions of Pattern Analysis and Machine Intelligence. 1984; 6, 721-741.
- J.E. Besag. On the statistical analysis of dirty pictures (with discussions). Journal of the Royal Statistical Society Series B. 1986; 48(3), 259.
- E. Tanaka. Statistical mechanical approach to image processing. Journal of Physics A: Mathematical and General. 2002; 35(37), 1-81.
- J.M. Pryce, A.D. Bruce. Statistical mechanics of image restoration. Journal of Physics A: Mathematical and General. 1995; 28, 1-511.
- H. Nishimori, K.M.Y. Wong. Statistical mechanics of image restoration and error correcting codes. Physical Review. 1999; 60(1), 132-44.
- K.P.N. Murthy, M. Janani, B. ShenbagaPriya. Bayesian restoration of digital images employing Markov chain Monte Carlo - a review. ArXiv. 2005.
- G.M. Torrie, J.P. Valleau. Nonphysical sampling distributions in Monte Carlo free-energy estimation - umbrella sampling. Journal of Computational Physics. 1977; 23(2), 187-199.
- B.A. Berg, T. Neuhaus, Multicanonical ensemble: A new approach to simulate first-order phase transitions. Physical Review Letters. 1992; 68(9).
- J. Lee. New Monte Carlo algorithm: entropic sampling. Physical Review Letters. Erratum. 1993; 71.
- F. Wang, D.P. Landau. Efficient, multiple-range random walk algorithm to calculate the density of states. Physical Review Letters. 2001; 86.
- K.V. Ramesh. Boltzmann and non-Boltzmann sampling for image processing, Thesis, M Tech (Computational Techniques), University of Hyderabad. 2009.
- S. Kullback, R.A. Leibler. On information and sufficiency. Annals of Mathematical Statistics. 1951; 22(1), 79-86.
- R.W. Hamming. Error detecting and error correcting codes. Bell System Technical Journal. 1950; 29(2), 147-160.
- N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E. Teller, Equation of state calculations by fast computing machine. Journal of Chemical Physics. 1953; 21, 1-7.
- K.P.N. Murthy. Non-Boltzmann ensembles and Monte Carlo simulation. Journal of Physics: Conference Series. 2016; 759.
- Metropolis and Wang-Landau Algorithms
Authors
1 Presidency College, Kamarajar Salai, Triplicane, Chennai 600 005, Tamilnadu, IN
2 Chennai Mathematical Institute (CMI), H1, SIPCOT IT Park, Siruseri, Kelambakkam, Chennai 603 103, Tamilnadu, IN
Source
Indian Journal of Economics and Development, Vol 6, No 2 (2018), Pagination: 1-16Abstract
Objectives: We review two algorithms developed for simulating macroscopic systems. The first is the Metropolis and the second is the Wang-Landau algorithm.
Methods: Metropolis algorithm has been extensively employed for simulating a canonical ensemble and estimating macroscopic properties of a closed system at any desired temperature. A mechanical property, like energy can be calculated by averaging over a large number of micro states of the stationary Markov chain generated by the Metropolis algorithm. However thermal properties like entropy, and free energies are not easily accessible. A method called umbrella sampling was proposed some forty years ago for this purpose. Ever since, umbrella sampling has undergone several metamorphoses and we have now multi canonical Monte Carlo, entropic sampling, flat histogram methods, Wang-Landau algorithm etc.
Findings: In this paper we review Metropolis algorithm for estimating mechanical properties and Wang-Landau algorithm for estimating both mechanical and thermal properties of an equilibrium system.
Applications: We shall make the review as pedagogical and as self-contained as possible. These algorithms can be applied to a variety of problems in physics, astrophysics, chemistry, biology, soft matter, computer science, etc.
Keywords
Monte Carlo Simulation, Metropolis Algorithm, Entropic Sampling, Flathistogram Methods, Detailed Balance, Markov Chain.Full Text
References
- N Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast CEomputing Machines, Journal of Chemical Physics 21 1087 (1953); see also G. Bhanot, The Metropolis Algorithm, Reports of Progress in Physics 51, 429 (1988).
- K. P. N. Murthy and V. S. S. Sastry, Markov chain Monte Carlo Methods in Statistical Physics, PoS(SMPRI2005)018 (2005).
- W. Feller, An Introduction to Probability Theory and Applications I and II, John Wiley (1968)
- A. Papoulis, Probabilty Theory, Random Variables, and Stochastic Processes McGraw Hill (1965)
- K. P. N. Murthy, Monte Carlo Methods in Statistical Physics, Universities Press (2004)
- K. P. N. Murthy, Monte Carlo : Basics, Report ISRP - TD-3, Indian Society for Radiation Physics, Kalpakkam Chapter (2000); Esee arXiv:cond-mat/014215v1, 12 Apr. 2001
- E. J. McGrath, and D. C. Irving, ETechnqiues for Efficient Monte Carlo Simulation Volume III : Variance Reduction, Report SAI - 72 - 590 - LJ , Office of the Naval Research, Department of the Navy, Arlington, Virginia 22217 USA (March 1973)
- L. D. Fosdick, Monte Carlo Computation on the Ising Lattice in Methods of Computational Physics, Vol. 1, Editor B Adler, p.245 (1963).
- G. M. Torrie, and J. P. Valleau, Nonphysical sampling distributions in Monte Carlo free-energy estimation: Umbrella sampling, Journal of Computational Physics 23 187 (1977). E
- B. A. Berg, and T. Neuhaus, Multicanonical ensemble: A new approach to simulate first-order phase transitions, Physical Review Letters 68, 9 (1992).E
- J. Lee, New Monte Carlo algorithm: Entropic sampling, Physical Review Letters 71, 211 (1993); Erratum, 71, 2353 (1993)
- F. Wang, and D. P. Landau, Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States, Physical Review Letters 86, 2050 (2001).
- D. Jayasri, V. S. S. Sastry, and K. P. N. Murthy, Wang-Landau Monte Carlo simulation of isotropic-nematic transition in liquid crystals, Physical Review E 72, 36702 (2005).
- P. Poulin, F. Calvo, RE. Antoine, M. Broyer, P. Dugord, Performances of Wang-Landau algorithms for continuous systems, Physical Review E 73, 56704 (2006).
- W. Janke, Monte Carlo Simulations in Statistical Physics – From Basic Principles to Advanced Applications, in Order, Disorder and Criticality: Advanced Problems of Phase Transition Theory, Vol. 3 (edited by Y. Holovatch), World Scientific (2012)pp. 93-166.
- B. J. Schulz, K Binder, M. M¨uller, and D. P. Landau, Avoiding Boundary Effects in WangLandau Sampling Physical Review E 67, 67102 (2003).
- C. Zou, and R. N. Bhatt, Understanding and Improving the Wang-LandauE Algorithm, Physical Review E 72, 25701(R) (2005).
- Carrier Supporting Carrier – Requirements and Deployment
Authors
1 Presidency College, Kamarajar Salai, Triplicane, Chennai-600 005, Tamil Nadu, IN
Source
Indian Journal of Economics and Development, Vol 6, No 3 (2018), Pagination: 1-7Abstract
Objectives: Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) Carrier Supporting Carrier (CSC) enables one MPLS VPN-based service provider to allow other service providers to use a segment of its backbone network. Carrier supporting carrier (CSC) is implemented in circumstances in which one service provider needs to use the transport services provided by another service provider. The service provider providing the transport is called the backbone carrier and the service provider using the services provided by the backbone carrier is called a customer carrier. The customer carrier can either be an ISP provider or an MPLS VPN service provider. In my study, I have taken the case of the carrier customer is a service provider running MPLS VPN.
Methods/Analysis: In this project, we are giving interconnection between customer branches of ISP1. The POP locations of ISP1 are running with MPLS and ISP1 POP locations are interconnected via other ISP Backbone carrier ISP2 using MPLS network. Customers connected in POP sites 1 and POP sites 2 to ISP1, are using BGP protocol to send the network information to ISP1 in their respective location. ISP1 is also running BGP, collecting the information of Customers from both the POP sites using BGP protocol and sharing this information from POP1 site to POP2 site via backbone carrier ISP2.
Application: Backbone carrier ISP2 creates an MPLS link with both POP sites of ISP1 and carries customer network information via ISP2 network such that both the customer branches can share data across POP locations.
Results: The above network was simulated using GNS3 network simulation tools and the reach ability between the two customer sites of ISP2 the customer carrier was tested, with success.
Keywords
MPLS Technology, VPN, Carrier Supporting Carriers, MPLS VPN, Private Networks, MPLS VPN, VPN Implementation, Service Provider.Full Text
References
- https://www.cisco.com/c/en/us/td/docs/ios/12_0s/feature/guide/fscsc23.html. Date accessed: 01/2018.
- https://www.cisco.com/c/en/us/td/docs/ios-xml/ios/mp_ias_and_csc/configuration/xe-16/mp-ias-and-csc-xe-16-book/mpls-vpn-carrier-supporting-carrier-using-ldp-and-an-igp.pdf. Date accessed: 02/2018.
- https://tools.ietf.org/html/rfc4364. Date accessed: 02/2018
- MPLS Fundamentals, Luc De Ghein, CCIE, 2nd Edition.2006.
- Path Identification Between Locations Within a Campus Using ACO
Authors
1 Loyola College, Chennai, IN
2 Presidency College, Chennai, IN
Source
Indian Journal of Economics and Development, Vol 6, No 5 (2018), Pagination: 1-5Abstract
Objectives: To identify the paths between locations within the college campus. The paths were stored to create a voice guidance system for the visually challenged students studying in our institution.
Methods: We have allotted number for locations, and each location has its neighbor’s detail. A graph was generated by this information which gives a complete outline of connection among the locations. We have generated an algorithm based on Ant Colony. The algorithm was tested first with 9 locations and it was able to exactly list out all possible paths between sources and the destination.
Findings: Once the edge between vertices has been identified by an ant, then the pheromone level is maintained in that edge should be high. The pheromone level is kept above a value called threshold value. If pheromone level on a particular edge is below the threshold value then that path was omitted by other ants. The high pheromone level makes the other ants to proceed through that path. The current vertex is checked with the destination vertex to check whether the algorithm process has identified a path. Tests were conducted by considering all the locations within our campus, where our visually challenged students will go for their classes.
Application: All paths between the source and destinations are identified correctly and recorded. The voice guidance system is its incubation stage and surely this would help the visually challenged students to reach their destinations without others help.
Keywords
ACO, Path Identification, Ant Colonies, Ant System, Swarm Intelligence, All Possible Paths.Full Text
References
- M. Dorigo, V. Maniezzo, A. Colorni, Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics. 1996; 26(1), 1-10.
- M. Dorigo, C. Blumb. Ant colony optimization theory: A survey. Theoretical computer Science. 2005; 344 (2-3), 243-278.
- Marco Dorigo, Thomas Stutzle. Ant Colony Optimization. The MIT Press. 2004.
- Amali Asha, S.P. Victor, A. Lourdusamy. Performance of ant system over other convolution masks in extracting edge. International Journal of Computer Applications (0975 – 8887). 2011; 16(4), 1-6.
- W. Peng, X. Hu. A fast algorithm to find all-pairs shortest paths in complex networks. Procedia Computer Science. 2012; 9, 557-566.
- C.L.Azevedo, J.L. Cardoso. Vehicle tracking using the k-shortest paths algorithm and dual graphs. Transportation Research Procedia. 2014; 1(1), 3-11.
- AAljanaby, K.R. Ku-Mahamud, N.M Norwawi. Optimizing large scale problems using multiple ant colonies algorithm based on pheromone evaluation technique. International Journal of Computer Science and Network Security (IJCSNS). 2008; 8(10), 54-58.
- N.Aljanaby, K.R. Ku-Mahamud, N.M. Norwawi. A new multiple ant colonies optimization algorithm utilizing average pheromone evaluation mechanism. Proceedings of the Knowledge Management International Conference, Langkawi, Malaysia. 2008; 531-534.
- Dilpreetkaur, P.S. Mundra. Ant colony optimization: a technique used for finding shortest path. International Journal of Engineering and Innovative Technology (IJEIT). 2012; 1(5), 1-3.