Home Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph
Article Open Access

Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph

  • Lv Feng EMAIL logo , Gao Chunlin and Ma Kaiyang
Published/Copyright: May 4, 2017

Abstract

With rapid development of computer performance and distributed technology, P2P-based resource sharing mode plays important role in Internet. P2P network users continued to increase so the high dynamic characteristics of the system determine that it is difficult to obtain the load of other nodes. Therefore, a dynamic load balance strategy based on hypergraph is proposed in this article. The scheme develops from the idea of hypergraph theory in multilevel partitioning. It adopts optimized multilevel partitioning algorithms to partition P2P network into several small areas, and assigns each area a supernode for the management and load transferring of the nodes in this area. In the case of global scheduling is difficult to be achieved, the priority of a number of small range of load balancing can be ensured first. By the node load balance in each small area the whole network can achieve relative load balance. The experiments indicate that the load distribution of network nodes in our scheme is obviously compacter. It effectively solves the unbalanced problems in P2P network, which also improve the scalability and bandwidth utilization of system.

PACS: 42.30.Va

1 Introduction

P2P network is a new generation of technology that changes the Internet. It has a profound impact on the way of publishing, sharing and achieving information for Internet users. However, with the rapid increase of user number, a disadvantage of P2P network structure is gradually exposed, that is, a few nodes bear too large information, while some node has little communication, or even no communication at all with others [1, 2]. Especially when large events or unexpected events occurs, some resources become hot resources, increasing the node load suddenly which owing these sources. It causes the response time, data processing ability and throughput of nodes reduce significantly, resulting in network congestion [39]. Therefore, load balance technology is used in peer to peer networks gradually. In P2P network, since the nodes have high dynamic and locality, they are hard to acknowledge the load status of other nodes, so the load balance problem is still a prominent and urgent problem waiting to be solved.

Excellent load balance algorithms can greatly improve the scalability and availability of system. For the load balance problems in P2P network, the scholars at home and abroad have done a lot of researches. Rao [10] proposes a load balancing strategy based on virtual node. A virtual node is similar to a node in P2P network and one physical node may have multiple virtual nodes. The load balance is performed by the transfer from virtual node in heavy-load nodes to light-load nodes. The defects of such methods are that the virtual node increases the overhead of network and poor real-time performance. Li et al proposes a load balance method based on gossip [11]. They put load information of nodes in the message for transferring, and the acception is decided by the node itself. It can effectively reduce the load of processing access request of origin nodes, but the success rate is not ensured. Rah man et al [12] propose to choose some nodes that has powerful processing capability as super nodes in P2P network, which are in charge of detecting the processing capability of node and works as routing request agent of other nodes. However, is tends to cause over concentrated load for the supernodes.

The problem of load unbalance of hot resource in unstructured P2P systems are discussed in this article, such as storage space, bandwidth etc. We propose a dynamic load balance strategy. The network is depicted as a collection of many small regions, and the major problems are ensuring the load balance of these small regions. Then, the nodes in network can be taken as the vertices of hypergraph, and the physical location among the nodes is taken as the side of hypergraph. On this basis, the hypergraph is partitioned in small area. The load statuses of partitioned regions are roughly equivalent, and the nodes lying in the same region have certain relevance. Hypergraph partitioning algorithm is adopted to copy the hot resources, to partake the visits of nodes, and to achieve relative global load balance status.

The remainder of this paper is organized as follows. In Section 2, a description of the hypergraph partitioning algorithm is given in detail. In Section 3, the improvement of multi-level partitioning of hypergraph is introduced to solve the problem in load unbalance in P2P network. Section 4 provides several tests to verify the feasibility and effectiveness of our scheme. The conclusions are presented in Section 5.

2 Related Theory of Hypergraph Partitioning Algorithms

2.1 Hypergraph Definition

In the past few decades, graph theory is proved to be very important tools for combinatorial problems in the fields like geometry, number theory, operational research and optimization. To solve more combinatorial problems, it is nature to extend the conception of graph. In 1970, the definition of hypergraph was proposed by C.Berge [13]. Hypergraph is a an extension of the map. In a Hypergraph one hyperside connects several points and each hyperside is a nonvoid subset of Hypergraph point set, which is often used to describe the structure in sparse irregular problems [14]. It not only inherits all the functions of general graphs, but also can solve difficult problems that are hard to deal with. Illustrated by association and clustering analysis in data mining, hypergraph has more concise expression and stronger results.

The representation of hypergraph is H = V, E. V = {V1, V2,…,Vn} is the set of vertex and E = {e1, e2,…,ej} is the set of hyper sides. Different with general graphs, the hypersides in hypergraph is a nonempty subset of the vertex set, that is, the sides of hypergraph can connect 3 or more vertices.

There are some related conceptions in hypergraph partitioning:

Figure 1 An hypergraph with 7 vertices and 4 edges
Figure 1

An hypergraph with 7 vertices and 4 edges

Size of hyperside: The size of each hyperside is the number of elements in the set, that is, the amount of vertices.

Weight of vertice: Each node ViV has a weight Wi, which is a integer generally.

Sum of external degrees(SOED): If certain hyperside ei crosses K blocks, its price is Ci = K. SOED is defined as the sum of hypersides crossing multiple blocks.

k-way partitioning: For a hypergraph, we define the set P = {P1, P2, …, Pn} as a k-way partitioning of hypergraph. Pi is the subset of vertex set V in hypergraph H. In such method, the entity is performed k-partitioning to acquire bidirectional partitions. Then, each part is further partitioned into quartiles. Assuming that k is a power of two, then the final k-way partitioning can be obtained in log(k) such steps (or after performing k − 1 bisections. In the cases in which k is not a power of two, the above approach needs to be modified so that each bisectioning produces appropriate size patitions.

Equilibrium K partition: For a hypergraph H, partitions set P creates equal numbers of each partition and minimize value of SODE.

2.2 Multi-level Partitioning

Since hypergraph is also a generalization of the graph, most of the graph partitions can be used in hypergraphs. Studies have pointed that the partition of graph is an NP complete problem, so heuristic algorithms are often adopted to make graph partitioning, instead of iterative ways. There are two popular algorithms currently [15]:

K-L algorithm: It is a classical graph partitioning algorithm put forward by Kernighan and Lin. The principle idea is: first graph G is randomly divided into two sub graphs P1 and P2 that has the same number of vertices. Choose two vertices from P1 and P2, if the weight difference of the two sub graphs is less than the weight of the former after vertex changing, exchange these two vertices and lock them. Then continue above searching and exchanging processes from unlocked nodes set until the weight difference of internal side and external side is negative, and stop the iteration. The process is described with following pseudo codes:

K-L algorithm is not good at the case that the data distribution is sparse; while it works well for the graph whose average degree is more than 3.

Multi-level partitioning of hyper graph was proposed by Karypis, integrated and improved with other partitioning algorithms. The core thought is that the hypergraph partitioning is divided into three phases: coarsening, initial partitioning and refinement. Coarsening aims at using gradually decreasing hypergraphs to approximate the original hypergraphs and to keep their structures as far as possible. It mean the vertices of graph are combined to form a hypergraph with fewer vertices. Then normal partitioning is performed at the phase of original partitioning, generally using K-L algorithm or FM algorithm. Finally it is restored to initial hypergraph at the phase of refinement. The multi-level partitioning algorithms can provide high-quality partition in relatively short time and it has become research benchmark in recent years [16].

Figure 2 The example process of multi-level partitioning of hypergraph
Figure 2

The example process of multi-level partitioning of hypergraph

3 LABR Load Balance Strategy

3.1 Basic thought and principles

Load balance is an NP complete problem, in general, especially in P2P network. Due to the locality of nodes and dynamicity of network, the nodes only know the load state of a small number of nodes. Most of them cannot know global load information and a perfect scheme for load balance is rarely found. This article believes P2P network does not need nor necessary to achieve global optimal load balancing. We only need the local nodes achieve load balance, global network can approach a relatively better balance state. It can be proved by the following queuing theory [17]:

The whole network is looked on a queuing model, that is, a task is processed just by one node in the same hour. The other tasks will not begin until the task is completed. Assuming both the task arriving rate and the completion rate obey Poisson distribution, then the number of average busy nodes is λμ. λ is average tasks in unit time and μ is the tasks number completed in unit time. λ and μ obey the Poisson distribution both, that is, f(t) = λ eλ t(t ≥ 0). If the average busy node number is m¯ and the number of total service nodes is m, the service rate is ρ=λmμ.Pk is the probability that the total tasks number is k in system, so we have P0 = 1−ρ, Pk = (1−ρ)ρk. The average number of busy nodes is obtained as the following equation:

m¯=n=0m1npn+n=mpn=n=0m1n(mρ)(n1)!P0+n=mpnmmmρnm!P0=mρ[n1m1(mρ)n1(n1)!P0+n=mmmρn1m!P0]=mρ[k=0m1pk+k=m1pk]=mρ=λμ

In above equation, the average number of nodes and the number of tasks per unit time is proportional to the number of tasks, and it is inversely proportional to the number of tasks completed in unit time. It also has nothing to do with the number of service nodes. If there is overloading node, the average tasks completed in unit time will be reduced, meanwhile, the number of average busy nodes increases.

Thus it can be seen that of each small region achieves optimal load balance, the overall network can be thought to keep good load balance. In view of this, this article proposes the solution to partition the network into the sets of many small regions, adopting hypergraph partitioning method, abbreviate as LABR (Local Area Balance Replication). First, we define supernodes according to online situation of nodes and each supernode is in charge of a small local area network. Each area will randomly select another area to start a 2-partition process of hypergraph (k-way partitioning of hypergaph, k=2), to keep consistent of the total load of the region. In this way, when the nodes in area approaches to certain status (such as overload), the nodes will actively make selection for the light-load nodes in the area through supernodes to achieve the transfer of load.

3.2 Region partitioning based on hypergraph

For P2P nodes, due to the limitation among them, heavy-load nodes are hard to choose the best light-load node to make load exchanging [18]. They are possible to choose some neighbour nodes to perform operation s of load balance, leading to relatively poor results, while global scheduling is difficult to be achieved. Therefore, we propose a partitioning strategy based on small areas, that is, the node only exchanges the load in its own area generally. The advantage of hypergraph is, different with common graphs, it can define the points set (hyperside), to make the nodes owning certain properties lie in the same hyperside. According to the hypergraph partitioning algorithm, the area is partitioned and the nodes lie in the same hyperside are possible to be in the same area. Thus we can perform load scheduling and reduce the communication consumption among the nodes.

3.2.1 Assignment of supernode

The selection of supernode adopts an adaptive method: We use probabilistic method, 100 is divided by the number of nodes in network, to acquire a probability number p. Then p is sent to the whole network for the operation of each node. If the acquired probability is in the range of 0 ∼ p, it becomes the super node. Then it is adjusted according to the actual state of node.

When new node joins, it will automatically join the area that has direct relation with this node. When more nodes join that causing the number is beyond 200, the area spilt begins. The process of splitting means choosing a node as the supernode in each area, and two supernodes perform 2-way partitioning of hypergraph in the local area. When the node leaves or loses efficacy, if the number of total vertices of the hypergraph is less than certain amount q, the two areas are merged. In general case, q is thought to be equivalent to be 10% of the upper limitation.

3.2.2 Hyperside clustering

Hyperside clustering is a complicated process. Since the major problems discussed in this article is load balance, we adopt the scheme proposed in literature [19], which divides hypersides by the computation of distance between nodes according to IP address. First, when the supernodes of two partition collect the information, the partition nodes are classified as one set. According to their IP addresses, an IP-tree with the height of 24 is established, as depicted in figure 3. Because the latter 8 bits of IP address describe different hosts of the same network, it will not be considered. Its root node is 0.0.0.0/0, having two child nodes 0.0.0/ and 128.0.0/1. Then the child node of each node a.b.c/n on the IP tree represents a binary partition at its nth bit. Based on such setting, we set the height of node i as H, then the distance of Na and Nb equals to Dab = HiHj. If D is specified to be less than 1, the nodes are partitioned to the same hyperside, and the same node joins the same hyperside.

Figure 3 IP tree of storage nodes
Figure 3

IP tree of storage nodes

3.2.3 Partitioning optimization

For original hypergraph G = (V, E), in coarsening phase, aftern steps of operation, we gradually map G to G1, G2, …, Gn. At the phase of initial partitioning, we first obtain a partition of Gn as pn. In original multi-level partitioning structure, the partition of Gi+1 is mapped to partition of Gi as pi at the ith step. Then partitioning algorithm is adopted to optimize pi as the partition of Gi. After n steps of operation we can acquire the partition of G.

At the phase of refinement and optimization, the following operations are joined: when pi is obtained after mapping and optimization, we adopt V-cycle [20] adjustment on Gi and re-coarsen Gi to get Gi+1,Gi+2,,Gn, and the partition of Gn. Then the work returns to refinement and optimization. When back to Gi, we can get pi ; if the partition measuring function of pi is better than that of pi, repeated the process of V-cycle until the partition measuring function will not be improved any more, when pik is compared to previous partition pik1 at a certain step. The partition result pik1 is adopted as the input of next iteration at the stage of refinement and optimization.

3.3 Algorithm realization of partitioning

This article makes a little improvement on K-L algorithm in node partitioning. The initialization of K-L algorithm divides the set of points into two equal numbers, while the algorithm of this paper is based on the size of the region itself. The node number after area partitioning will not changes. Taking into account of the load weight of nodes, each node will compute a parameter for load degree, recorded as contribution, which is decided by some attributes and total load in the area of node. The core ideas is: choose a pairs of node randomly in two areas and determine the difference of weight after exchanging is benefited to the area. If it is, exchange these two nodes. The pseudo code is described as follows:

The first 3 lines means that the unlocked nodes in two areas will randomly choose one node respectively; in the 6th and 7th lines, the weight difference is computed; 8-14 lines represent that if the difference between the sum of contribute before exchanging and the difference of contribute of two nodes after exchanging is a positive number, these two nodes are locked, and their location will be exchanged. If SOED value after exchanging increases, the operation is cancelled. The cycle continues until the difference of total load of two areas are negative, then the iteration stops. Thus, we have partitioned the load area of nodes and the total load value of these two areas is very close. The nodes whose physical location are close will lie in the same area, which facilitates the transfer of load.

The supernodes will count the number of light-load nodes in the area, and the address information. We set the number as 3 log 2 and establish a route table. At the same time, it contacts its neighbour node to send integral area information and load information to the neighbour node, as spare supernode. Finally, the partition information of node, that is, whether the node still belongs to this partition or it is transferred, is sent to the node. The nodes in the same area are sent to the information of spare supernode.

4 Experimental Results and Analysis

The simulations mainly adopt scatter diagram and broken line graph to display and contrast the load state before and after balancing. Before the first experiment data record, the load balance algorithm is not started. In the second experiment we start LABR strategy. When the system reaches steady state, the node load degree after load balance is printed and corresponding graph and tables are created by Matlab. This article adopts BA network environment of Peersim to make simulation and it adds the improved algorithm to the strategies module, to verify the effectiveness of hypergraph partition algorithm.

In figure 4, the horizontal coordinate denotes the node number of P2P network and the vertical coordinate denotes the ratio of control load and transmission load. Each supernode in the experiment is assigned to common nodes averagely. In test we set the number of common nodes managed by supernode as the square root of total number of nodes, that is, if there are 400 nodes in system, each supernode is in charge of 20 nodes and these nodes join in or leave the network randomly. From this figure we can see, the ration the ratio of control load and transmission load is very small whether it is a server or a super node in the system. Through the comparison, we find that the supernode reduces many burden for the server, for it executes management and monitoring.

Figure 4 The ratio of control load and transfer load
Figure 4

The ratio of control load and transfer load

Figure 5 depicts the change of supernode with time goes on. It is found that its change rate is not large. It indicates that with the change of running time, the supernodes in system achieve better stability and effectiveness, which also improve the stability of system.

Figure 5 Change rate of supernodes in network
Figure 5

Change rate of supernodes in network

To investigate the average load balance distribution of node, at the initial moment the selected node is assigned a random load between 0 and 1000. Figure 6 depicts the average load distribution before and after balance control. From the distribution figure we can see the load distribution of nodes is obviously compacter that that the algorithm is not implemented, and global load of system is smaller. Figure 7 depicts the statistics of nodes in load area. Most of the load concentrates below 100. At the low load area, the performance improved 22 percents that before. It indicates that the balancing algorithm proposed in this paper can balance the load distribution of network nodes, and reduce the global load of system. When balance control begins, the average load of light-load node has little change, while that of heavy-load nodes get obviously changes, which shows the effect of our scheme. The reason is our strategy not only considers the case that node itself contains the requested file, but also considers the relation of node load with its neighbor node.

Figure 6 Average load distribution before and after load balancing
Figure 6

Average load distribution before and after load balancing

Figure 7 Relation contrast between load degree and node number
Figure 7

Relation contrast between load degree and node number

Table 1 is the statics of distribution parameters of different user query (θ and Q denote the user query distribution parameter and link bandwidth), and the influence caused by file quest connections. When the connections number takes different value, the final effect of control algorithm is not changed drastically. The network structure of entropy (NSE) [21] is bigger than the case that the improved algorithm is not implemented. It means the load degree of network is more balanced and the global load is lower. In addition, different distribution parameter has little influence on network before and after the algorithm is implemented and NSE maintains around 3. The reasons is when the distribution parameter is bigger, the query probability of hot documents is greater. But for a network with balanced file distribution, the query request of each node will make big difference. With the connection number increases, the NSE of system gets slight increasing. It shows that the exchanging among the nodes is frequent and the load difference gets minimized. Therefore, the unbalance degree of degree is relieved, which strengthens the anti interference ability of network to a certain extent.

Table 1

The influence of parameter and connection number to the experiment

θQ=500Q=1000Q=2000
WithoutWithoutWithout
con-LABRcon-LABRcon-LABR
troltroltrol
0.23.663.713.433.773.533.82
0.83.633.793.453.783.563.84
1.53.613.823.573.773.543.83

5 Conclusion

Based on the study of search mechanism and load strategy in unstructured P2P network, related defects of unstructured P2P network is analyzed. With theoretical basis of queuing theory, a multi-level partitioning method based on hypergraph is proposed. It can control the system to be in a balance state in local area, so as to achieve overall load balance. Simulation results show that the improved scheme has a faster load transfer speed, and the load distribution ratio is relatively compacter than before, even under high load conditions, it also shows good robustness. Even in status of high load it shows better robustness and comprehensive performance compared to traditional P2P load balance algorithms. Due to limitation of research level and time, there are many problems waiting to be discussed and completed. In complicated P2P network there will be more uncertain factors, which brings big test to network robustness. Therefore, the universal property of our algorithm needs further study and discussion.

References

[1] Mirrezaei S.I., Shahparian J., Ghodsi M., A topology-aware load balancing algorithm for P2P systems, Digital Information Management, 2009, 45, 97–102.10.1109/ICDIM.2009.5356795Search in Google Scholar

[2] Fan D., An improved load balancing scheme for dynamic structured P2P networks, International Journal of Applied Mathematics and Statistics, 2013, 511, 96–204.Search in Google Scholar

[3] Deming F. Yong Q.Y., An adaptive and dynamic load balancing algorithm for structured P2P systems, Journal of Convergence Information Technology, 2011, 6, 95–103.10.4156/jcit.vol6.issue11.12Search in Google Scholar

[4] Mi W., Zhang C.H., An effective load-balancing algorithm SDYA for structured P2P systems, Journal of Beijing University of Posts and Telecommunications, 2010, 33, 116–120.Search in Google Scholar

[5] Joung Y., Approaching neighbor proximity and load balance for range query in P2P networks, Computer Networks, 2008, 52, 1451–1472.10.1016/j.comnet.2008.01.016Search in Google Scholar

[6] Takaoka M., Uchida M., Ohnishi K., Access load balancing with analogy to thermal diffusion for dynamic P2P file-sharing environments, IEICE Transactions on Communications, 2010, 5, 1140–1150.10.1587/transcom.E93.B.1140Search in Google Scholar

[7] Xiao L.F., Ying X.. A load balance algorithm for hybrid P2P network model, Computing, Communication, Control, and Management, 2008, 10, 236–239.10.1109/CCCM.2008.325Search in Google Scholar

[8] Wei X.L., Chen M., Zhang G.M., A comprehensive load balance mechanism for structured P2P systems, Journal of Beijing University of Posts and Telecommunications, 2012, 35, 87–90.Search in Google Scholar

[9] Song G.H., Xia Y.J., Zheng Y., P2P load-balance model based on multi-layer Bayesian trust network, Journal of Zhejiang University (Engineering Science), 2014, 44, 1676–1680.Search in Google Scholar

[10] Rao M.A., Load balancing in DHT based P2P networks, Computer Society, 2008, 34, 920–923.10.1109/ICECE.2008.4769343Search in Google Scholar

[11] Li Z.Y., Xie G.G., A load balancing algorithm for DHT-based P2P systems, Computer Research and Development, 2006, 43, 1579–1585.10.1360/crad20060914Search in Google Scholar

[12] Ragab E., An efficient load balancing algorithm for P2P systems, Journal of Communications, 2011, 6, 648–656.10.4304/jcm.6.8.648-656Search in Google Scholar

[13] C. Berge, Graphes hypergraphes, 1st ed., Preprint Series press, Matematisk Institut Aarhus Universitet, 1970.Search in Google Scholar

[14] Kennighan B.W., Lin S., An efficient heuristic procedure for pairirioning graphs, Bell system Technical Journal, 1970, 49, 191–307.10.1002/j.1538-7305.1970.tb01770.xSearch in Google Scholar

[15] Liu L.T., Kuo M.T., Cheng C.K., A Gradient Method on the Initial Partition of Fiduccia-Mattheyses Algorithm, Computer-aided Design, 1995, 20, 229–234.10.1109/ICCAD.1995.480017Search in Google Scholar

[16] Catalyurek U.V., Boman E.G., Devine K.D., A repartitioning hypergraph model for dynamic load balancing, Journal of Parallel and Distributed Computing, 2009, 69, 711–724.10.1016/j.jpdc.2009.04.011Search in Google Scholar

[17] Yu F., Liu W., Li P., Hypergraph Partitioning Algorithm for Load Scheduling of P2P Network, Journal of Shenyang Jianzhu University, 2014, 30, 953–960.Search in Google Scholar

[18] Khan M.A., Yeh L., Zeitouni K.M., Achieving availability and load balance in a mobile P2P data store, MobiCASE, 2015, 13, 171–172.10.4108/icst.mobicase.2014.257793Search in Google Scholar

[19] Song B.Y., Gao N., Li X.G., DLRD: a P2P grid resource discovery mechanism for dynamic load-balance, Journal on Communications, 2008, 29, 94–99.Search in Google Scholar

[20] Aric A., V-cycle Optimal Convergence for Certain (Multilevel) Structured Linear Systems, Siam Journal on Matrix Analysis & Applications, 2003, 3, 543–544.10.1137/S0895479803421987Search in Google Scholar

[21] Huang C., Wang Y.L., Li D., Description and measurement of actor-network structure entropy, Journal of Nanjing University of Science & Technology, 2012, 36, 414–419.Search in Google Scholar

Received: 2016-11-13
Accepted: 2016-11-23
Published Online: 2017-5-4

© 2017 Lv Feng et al.

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Articles in the same Issue

  1. Regular Articles
  2. Analysis of a New Fractional Model for Damped Bergers’ Equation
  3. Regular Articles
  4. Optimal homotopy perturbation method for nonlinear differential equations governing MHD Jeffery-Hamel flow with heat transfer problem
  5. Regular Articles
  6. Semi- analytic numerical method for solution of time-space fractional heat and wave type equations with variable coefficients
  7. Regular Articles
  8. Investigation of a curve using Frenet frame in the lightlike cone
  9. Regular Articles
  10. Construction of complex networks from time series based on the cross correlation interval
  11. Regular Articles
  12. Nonlinear Schrödinger approach to European option pricing
  13. Regular Articles
  14. A modified cubic B-spline differential quadrature method for three-dimensional non-linear diffusion equations
  15. Regular Articles
  16. A new miniaturized negative-index meta-atom for tri-band applications
  17. Regular Articles
  18. Seismic stability of the survey areas of potential sites for the deep geological repository of the spent nuclear fuel
  19. Regular Articles
  20. Distributed containment control of heterogeneous fractional-order multi-agent systems with communication delays
  21. Regular Articles
  22. Sensitivity analysis and economic optimization studies of inverted five-spot gas cycling in gas condensate reservoir
  23. Regular Articles
  24. Quantum mechanics with geometric constraints of Friedmann type
  25. Regular Articles
  26. Modeling and Simulation for an 8 kW Three-Phase Grid-Connected Photo-Voltaic Power System
  27. Regular Articles
  28. Application of the optimal homotopy asymptotic method to nonlinear Bingham fluid dampers
  29. Regular Articles
  30. Analysis of Drude model using fractional derivatives without singular kernels
  31. Regular Articles
  32. An unsteady MHD Maxwell nanofluid flow with convective boundary conditions using spectral local linearization method
  33. Regular Articles
  34. New analytical solutions for conformable fractional PDEs arising in mathematical physics by exp-function method
  35. Regular Articles
  36. Quantum mechanical calculation of electron spin
  37. Regular Articles
  38. CO2 capture by polymeric membranes composed of hyper-branched polymers with dense poly(oxyethylene) comb and poly(amidoamine)
  39. Regular Articles
  40. Chain on a cone
  41. Regular Articles
  42. Multi-task feature learning by using trace norm regularization
  43. Regular Articles
  44. Superluminal tunneling of a relativistic half-integer spin particle through a potential barrier
  45. Regular Articles
  46. Neutrosophic triplet normed space
  47. Regular Articles
  48. Lie algebraic discussion for affinity based information diffusion in social networks
  49. Regular Articles
  50. Radiation dose and cancer risk estimates in helical CT for pulmonary tuberculosis infections
  51. Regular Articles
  52. A comparison study of steady-state vibrations with single fractional-order and distributed-order derivatives
  53. Regular Articles
  54. Some new remarks on MHD Jeffery-Hamel fluid flow problem
  55. Regular Articles
  56. Numerical investigation of magnetohydrodynamic slip flow of power-law nanofluid with temperature dependent viscosity and thermal conductivity over a permeable surface
  57. Regular Articles
  58. Charge conservation in a gravitational field in the scalar ether theory
  59. Regular Articles
  60. Measurement problem and local hidden variables with entangled photons
  61. Regular Articles
  62. Compression of hyper-spectral images using an accelerated nonnegative tensor decomposition
  63. Regular Articles
  64. Fabrication and application of coaxial polyvinyl alcohol/chitosan nanofiber membranes
  65. Regular Articles
  66. Calculating degree-based topological indices of dominating David derived networks
  67. Regular Articles
  68. The structure and conductivity of polyelectrolyte based on MEH-PPV and potassium iodide (KI) for dye-sensitized solar cells
  69. Regular Articles
  70. Chiral symmetry restoration and the critical end point in QCD
  71. Regular Articles
  72. Numerical solution for fractional Bratu’s initial value problem
  73. Regular Articles
  74. Structure and optical properties of TiO2 thin films deposited by ALD method
  75. Regular Articles
  76. Quadruple multi-wavelength conversion for access network scalability based on cross-phase modulation in an SOA-MZI
  77. Regular Articles
  78. Application of ANNs approach for wave-like and heat-like equations
  79. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  80. Study on node importance evaluation of the high-speed passenger traffic complex network based on the Structural Hole Theory
  81. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  82. A mathematical/physics model to measure the role of information and communication technology in some economies: the Chinese case
  83. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  84. Numerical modeling of the thermoelectric cooler with a complementary equation for heat circulation in air gaps
  85. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  86. On the libration collinear points in the restricted three – body problem
  87. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  88. Research on Critical Nodes Algorithm in Social Complex Networks
  89. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  90. A simulation based research on chance constrained programming in robust facility location problem
  91. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  92. A mathematical/physics carbon emission reduction strategy for building supply chain network based on carbon tax policy
  93. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  94. Mathematical analysis of the impact mechanism of information platform on agro-product supply chain and agro-product competitiveness
  95. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  96. A real negative selection algorithm with evolutionary preference for anomaly detection
  97. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  98. A privacy-preserving parallel and homomorphic encryption scheme
  99. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  100. Random walk-based similarity measure method for patterns in complex object
  101. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  102. A Mathematical Study of Accessibility and Cohesion Degree in a High-Speed Rail Station Connected to an Urban Bus Transport Network
  103. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  104. Design and Simulation of the Integrated Navigation System based on Extended Kalman Filter
  105. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  106. Oil exploration oriented multi-sensor image fusion algorithm
  107. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  108. Analysis of Product Distribution Strategy in Digital Publishing Industry Based on Game-Theory
  109. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  110. Expanded Study on the accumulation effect of tourism under the constraint of structure
  111. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  112. Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph
  113. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  114. Research on the method of information system risk state estimation based on clustering particle filter
  115. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  116. Demand forecasting and information platform in tourism
  117. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  118. Physical-chemical properties studying of molecular structures via topological index calculating
  119. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  120. Local kernel nonparametric discriminant analysis for adaptive extraction of complex structures
  121. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  122. City traffic flow breakdown prediction based on fuzzy rough set
  123. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  124. Conservation laws for a strongly damped wave equation
  125. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  126. Blending type approximation by Stancu-Kantorovich operators based on Pólya-Eggenberger distribution
  127. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  128. Computing the Ediz eccentric connectivity index of discrete dynamic structures
  129. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  130. A discrete epidemic model for bovine Babesiosis disease and tick populations
  131. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  132. Study on maintaining formations during satellite formation flying based on SDRE and LQR
  133. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  134. Relationship between solitary pulmonary nodule lung cancer and CT image features based on gradual clustering
  135. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  136. A novel fast target tracking method for UAV aerial image
  137. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  138. Fuzzy comprehensive evaluation model of interuniversity collaborative learning based on network
  139. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  140. Conservation laws, classical symmetries and exact solutions of the generalized KdV-Burgers-Kuramoto equation
  141. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  142. After notes on self-similarity exponent for fractal structures
  143. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  144. Excitation probability and effective temperature in the stationary regime of conductivity for Coulomb Glasses
  145. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  146. Comparisons of feature extraction algorithm based on unmanned aerial vehicle image
  147. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  148. Research on identification method of heavy vehicle rollover based on hidden Markov model
  149. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  150. Classifying BCI signals from novice users with extreme learning machine
  151. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  152. Topics on data transmission problem in software definition network
  153. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  154. Statistical inferences with jointly type-II censored samples from two Pareto distributions
  155. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  156. Estimation for coefficient of variation of an extension of the exponential distribution under type-II censoring scheme
  157. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  158. Analysis on trust influencing factors and trust model from multiple perspectives of online Auction
  159. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  160. Coupling of two-phase flow in fractured-vuggy reservoir with filling medium
  161. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  162. Production decline type curves analysis of a finite conductivity fractured well in coalbed methane reservoirs
  163. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  164. Flow Characteristic and Heat Transfer for Non-Newtonian Nanofluid in Rectangular Microchannels with Teardrop Dimples/Protrusions
  165. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  166. The size prediction of potential inclusions embedded in the sub-surface of fused silica by damage morphology
  167. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  168. Research on carbonate reservoir interwell connectivity based on a modified diffusivity filter model
  169. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  170. The method of the spatial locating of macroscopic throats based-on the inversion of dynamic interwell connectivity
  171. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  172. Unsteady mixed convection flow through a permeable stretching flat surface with partial slip effects through MHD nanofluid using spectral relaxation method
  173. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  174. A volumetric ablation model of EPDM considering complex physicochemical process in porous structure of char layer
  175. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  176. Numerical simulation on ferrofluid flow in fractured porous media based on discrete-fracture model
  177. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  178. Macroscopic lattice Boltzmann model for heat and moisture transfer process with phase transformation in unsaturated porous media during freezing process
  179. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  180. Modelling of intermittent microwave convective drying: parameter sensitivity
  181. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  182. Simulating gas-water relative permeabilities for nanoscale porous media with interfacial effects
  183. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  184. Simulation of counter-current imbibition in water-wet fractured reservoirs based on discrete-fracture model
  185. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  186. Investigation effect of wettability and heterogeneity in water flooding and on microscopic residual oil distribution in tight sandstone cores with NMR technique
  187. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  188. Analytical modeling of coupled flow and geomechanics for vertical fractured well in tight gas reservoirs
  189. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  190. Special Issue: Ever New "Loopholes" in Bell’s Argument and Experimental Tests
  191. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  192. The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  193. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  194. Erratum to: The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  195. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  196. Rhetoric, logic, and experiment in the quantum nonlocality debate
  197. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  198. What If Quantum Theory Violates All Mathematics?
  199. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  200. Relativity, anomalies and objectivity loophole in recent tests of local realism
  201. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  202. The photon identification loophole in EPRB experiments: computer models with single-wing selection
  203. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  204. Bohr against Bell: complementarity versus nonlocality
  205. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  206. Is Einsteinian no-signalling violated in Bell tests?
  207. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  208. Bell’s “Theorem”: loopholes vs. conceptual flaws
  209. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  210. Nonrecurrence and Bell-like inequalities
  211. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  212. Three-dimensional computer models of electrospinning systems
  213. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  214. Electric field computation and measurements in the electroporation of inhomogeneous samples
  215. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  216. Modelling of magnetostriction of transformer magnetic core for vibration analysis
  217. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  218. Comparison of the fractional power motor with cores made of various magnetic materials
  219. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  220. Dynamics of the line-start reluctance motor with rotor made of SMC material
  221. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  222. Inhomogeneous dielectrics: conformal mapping and finite-element models
  223. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  224. Topology optimization of induction heating model using sequential linear programming based on move limit with adaptive relaxation
  225. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  226. Detection of inter-turn short-circuit at start-up of induction machine based on torque analysis
  227. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  228. Current superimposition variable flux reluctance motor with 8 salient poles
  229. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  230. Modelling axial vibration in windings of power transformers
  231. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  232. Field analysis & eddy current losses calculation in five-phase tubular actuator
  233. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  234. Hybrid excited claw pole generator with skewed and non-skewed permanent magnets
  235. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  236. Electromagnetic phenomena analysis in brushless DC motor with speed control using PWM method
  237. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  238. Field-circuit analysis and measurements of a single-phase self-excited induction generator
  239. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  240. A comparative analysis between classical and modified approach of description of the electrical machine windings by means of T0 method
  241. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  242. Field-based optimal-design of an electric motor: a new sensitivity formulation
  243. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  244. Application of the parametric proper generalized decomposition to the frequency-dependent calculation of the impedance of an AC line with rectangular conductors
  245. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  246. Virtual reality as a new trend in mechanical and electrical engineering education
  247. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  248. Holonomicity analysis of electromechanical systems
  249. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  250. An accurate reactive power control study in virtual flux droop control
  251. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  252. Localized probability of improvement for kriging based multi-objective optimization
  253. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  254. Research of influence of open-winding faults on properties of brushless permanent magnets motor
  255. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  256. Optimal design of the rotor geometry of line-start permanent magnet synchronous motor using the bat algorithm
  257. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  258. Model of depositing layer on cylindrical surface produced by induction-assisted laser cladding process
  259. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  260. Detection of inter-turn faults in transformer winding using the capacitor discharge method
  261. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  262. A novel hybrid genetic algorithm for optimal design of IPM machines for electric vehicle
  263. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  264. Lamination effects on a 3D model of the magnetic core of power transformers
  265. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  266. Detection of vertical disparity in three-dimensional visualizations
  267. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  268. Calculations of magnetic field in dynamo sheets taking into account their texture
  269. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  270. 3-dimensional computer model of electrospinning multicapillary unit used for electrostatic field analysis
  271. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  272. Optimization of wearable microwave antenna with simplified electromagnetic model of the human body
  273. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  274. Induction heating process of ferromagnetic filled carbon nanotubes based on 3-D model
  275. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  276. Speed control of an induction motor by 6-switched 3-level inverter
Downloaded on 10.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/phys-2017-0024/html
Scroll to top button