Journal of Emerging Trends in Computing and Information Sciences

2010-11 CIS Journal. All rights reserved. http://www.cisjournal.org

Volume 2 No.7, JULY 2011

ISSN 2079-8407

An Association Rules Analysis to enhance solving the Congestion Problem

Soukaena Hassan Hasheem
University of Technology, Iraq, 2011, Soukaena_hassan@yahoo.com

ABSTRACT
This research aims to enhance network routing algorithm to be most efficient and strong to face the most important routing problem, congestion. By using association rules for analyzing proposed database which its transactions are tracked routes from most famous network routing algorithms and its attributes are the most critical attributes for network routing algorithms. The extracted rules and some proposed unextracted rules will be analyzed, to build the proposed routing algorithm, which guide to the optimal shortest path with efficient deal for congestion. Finally by comparing the enhanced proposed algorithm with previous algorithm according to the most important criteria of routing, the result was very reasonable and encouraging.
Keywords data mining, routing algorithm, association rules, extracted rules and congestion control.

1. INTRODUCTION
Data mining is defined as the process of discovering patterns in data. The patterns discovered must be meaningful in that they lead to some advantage [1-4]. Networking Routing consists of two fundamental steps: Forwarding packets to the next hop (from an input interface to an output interface in a traditional wired network) and Determining how to forward packets (building a routing table or specifying a route). Congestion control refers to the set of actions taken by the network to minimize the intensity, spread, and duration of congestion. It can be said that it is that aspect of a networking protocol that defines how the network deals with congestion [5-10].

Preprocessing Algorithm
Input: Get all reliable famous network routing algorithms. Output: Proposed network routing algorithms database. Step 1: Take the current routing algorithm. Step2: Extract its parameters as attributes. Step3: Store these attributes in attributes file if not repeated. Step4: Go to step1 if any more algorithms. Step5: Each attributes presented by the consequence alphabet. Step6: Construct the structure of the proposed database where, No. of transaction picked according to the no. of given routes tracked according to different routing algorithms. Since each transaction presents a route, (that because the no. of algorithms is very limited to present the no of transactions, for that will be replaced by routes tracked from these algorithms). No. of columns picked according to the no. of given attributes in attributes file, since each column presents an attribute. Step7: For each transaction (route tracked by routing algorithm) insert the attributes values that by writing attribute alphabet if the attribute value is satisfy some condition else is not written in the transaction. Step8: end.

2. THE DESIGN OF PROPSED SYSTEM

The proposed system aims to build an advanced network routing algorithm to find shortest path with efficient congestion control. This proposal depends on analysis process results which would be done on famous routing algorithms. This analysis performed by using association rule data mining technique, but before using data mining for analysis, there is a preprocessing stage must be done to build the proposed routing algorithm database which will be introduced to data mining. To explain the proposed system in details, we will emphases on consequences stages, these stages are:

2. 1 Preprocessing Stage
This stage presents the initial step in the proposed algorithm which will consider all the reliable networking routing algorithms. The next algorithm presents the overall process of the preprocessing stage:

Attributes Encodings
This research takes the routes tracked by routing algorithms as transactions and the following attributes will be considered:

307

Journal of Emerging Trends in Computing and Information Sciences

2010-11 CIS Journal. All rights reserved. http://www.cisjournal.org

Volume 2 No.7, JULY 2011

ISSN 2079-8407

Attribute (A): if the route tracked by the link state routing algorithm this attribute will appear, else will not appear. Attribute (B): if the route tracked by the single path routing algorithm this attribute will appear, else will not appear. Attribute (C): if the route tracked by the flat routing algorithm this attribute will appear, else will not appear. Attribute (D): if the route tracked by the host intelligent routing algorithm this attribute will appear, else will not appear. Attribute (E): if the route tracked by the intradomain routing algorithm this attribute will appear, else will not appear. Attribute (F): if the route tracked by the static routing algorithm this attribute will appear, else if will not appear. Attribute (G): if the routes path length under the reasonable no. of nodes this attribute will appear, else will not appear. Attribute (H): if the routes reliability higher than reasonable ratio this attribute will appear, else if will not appear. Attribute (I): if the routes delay time under reasonable time this attribute will appear, else if will not appear. Attribute (J): if the routes bandwidth higher than reasonable ratio this attribute will appear, else will not appear. Attribute (K): if the routs load under reasonable ratio this attribute will appear, else will not appear. Attribute (L): if routes communication cost under than reasonable ratio this attribute will appear, else will not appear.

probability that X and Y hold together among all the possible presented cases. It is said that the rule X Y holds in the transaction set D with confidence c if c% of transactions in D that contain X also contain Y . In other words, the confidence of the rule is the conditional probability that the consequent Y is true under the condition of the antecedent X. The problem of discovering all association rules from a set of transactions D consists of generating the rules that have a support and confidence greater than the given thresholds. These rules are called strong rules.

2.3 Analysis and Design Stage

The results of the previous section will be thousands of association rules, from analyzing these rules will get some strong rules that give a potential point to enhance a routing algorithm to deal much stronger with problems within routing environment, these potential rules are: A----- B (using link state will predict for using single path and all other routing algorithms which presented by absence of CDEF ). A------C (using link state will predict for using flat and all other routing algorithms which presented by absence of BDEF). A------D (using link state will predict for using host intelligent and all other routing algorithms which presented by absence of BCEF). A------E (using link state will predict for using intradomain and all other routing algorithms which presented by absence of BCDF). A------F (using link state will predict for using static and all other routing algorithms which presented by absence of BCDE). That means the use of link state algorithm to predict the probability of using another routing algorithm later for routing from the source to destination. Now from analysis there are rules not appear indeed, these rules will be proposed to complete the analysis: A------G ( this means link state is not predict route path length ). A------H ( this means link state is not predict route reliability). A-------I ( this means link state is not predict route delay time). A-------J ( this means link state is not predict route bandwidth). A------K ( this means link state is not predict route load). A------L ( this means link state is not predict route cost communication). reasonable reasonable reasonable reasonable reasonable reasonable

2. 2 Association Rules Mining Stage

The problem is stated as follows, Let I = {i1, i2, ...im} be a set of literals, represent the most important attributes of routing algorithms, called items. Proposed database D be a set of transactions, where each transaction T is a set of items such that T I, these transactions are routes tracked by most famous routing algorithms. A unique identifier TID is given to each transaction. A transaction T is said to contain X, a set of items in I, if X T. where these items present the presence of routing algorithm attributes in tracked routes. An association rule is an implication of the form X Y, where X I, Y I, and X Y =. The rule X Y has a support s in the transaction set D is s% of the transactions in D contain X Y. In other words, the support of the rule is the

308

Journal of Emerging Trends in Computing and Information Sciences

2010-11 CIS Journal. All rights reserved. http://www.cisjournal.org

Volume 2 No.7, JULY 2011

ISSN 2079-8407

Now from analyzing the extracted and unextracted rules, the obtained results could be as in follow: The link state algorithm is a good algorithm in normal environment for routing, which means by normal environment there is always suitable path from source to destination (no local minima, no congestion and no load and delay) and that is impossible for real environment. So from the analysis, there is ability to enhance the link state routing algorithm to deal with real complex environment which may be suffer from congestion, load, delay and other problems. Before we explain the proposed algorithm, the proposed congestion state measure will be displayed, which aims to examine the congestion state for all neighbors routers to select the best one which present a minimum congestion. This will be done by a proposed modest mathematical equation to measure the congestion, and it is as follow: CSRi = TPPA TPPS, Where CSRi, Congestion State Router (no. i) TPPAi, Time Ping Packet Acknowledgement (no. i) TPPSi, Time Ping Packet Send (no. i) This means that measure of congestion depends on counting all the times between sending ping packets from current source to all neighbors to represent the current destinations and receiving ping packets acknowledgements from all current destinations to the source. The minimum time will be depended and the related current destination will be taken as the best congestion state node to represent the new current source.

2. Loop

G(V) = S(X,V) else G(V) =

Find U not in N such that D(U) is the smallest. Find U not in N such that G(U) is best congestion state. If U was the same node which is the best in cost and congestion, then 1. Add U into set N. 2. Else U added in set N will be the short with low congestion state. Update D(V) and G(V) for all V not in N. D(V) = min{D(V), D(U) + C(U,V)}. G(V) = min {G(V), G(U) + S(U,V)}. Until all nodes in N.

3. DISCUSSION WORKS

AND

EXPRIMENTAL

Proposed network routing Algorithm (Enhanced Shortest Path Algorithm)

Input: Routing tables, source congestions thresholds. Output: shortest optimal path. and destination,

The problem of network congestion control remains a critical issue and a high priority, especially in given growing size, demand, and speed (bandwidth) of the networks. Congestion is a real threat to the growth of existing packet-switched networks, and of the future deployment of integrated services communication networks. It is a problem that cannot be ignored. From that the research concentrates on enhancing the shortest path algorithm to deal with congestion. The implementation of the proposed system will begin with taken samples of networks; each one depends on different routing algorithms. Then and by the proposed path track program, which tends to track and record all details related to the path from source to destination, see Figure (1).

Step1: Basic Notations X: source node. N: set of nodes to which enhanced shortest paths are known so far. N is initially empty. D(V): the cost of the known shortest path from source X to V. G(V): the congestion state of the known shortest path from source X to V. C(U,V): cost of link U to V. C(U,V) = if not neighbors. S(U,V): congestion state of link U to V. S(U,V) = if not neighbors. Step2: Algorithm (at Node X). Initialization N = {X} For all nodes V If V adjacent to X then 1. D(V) = C(X,V) else D(V) =

Figure (1): The Proposed Path Track Program

From the proposed program, the entire attribute values will be taken and encoded for building the proposed database of routing algorithms see Figure (2).

309

Journal of Emerging Trends in Computing and Information Sciences

2010-11 CIS Journal. All rights reserved. http://www.cisjournal.org

Volume 2 No.7, JULY 2011

ISSN 2079-8407

Figure (2): Proposed Encoded Routing Algorithm Database

Figure (2) above which presents the proposed database which will be introduced to association rule data mining technique, see Figure (3-a), which display how to mine the proposed database by detecting the both minimum support and minimum confidence. Figure (3-b) displays the extracted association rules.

(a)

(b) (a)
Figure (4): a- Traditional Algorithm, b-Proposed Algorithm.

By applying both algorithms on same real network environment, with considering the most important criteria of routing algorithm with performance ratio 100% for comparisons between the traditional and the proposed. There are some obtained comparisons results are shown in Figure (5). Metrics Reach Minimum Path length Reach Minimum Reliability Reach Minimum Delay Reach Minimum Bandwidth Reach Minimum Load Reach Minimum Communication Cost Traditional 90% 70% 80% 70% 70% 80% Proposal 85% 95% 75% 95% 90% 75%

(b)
Figure (3): a- Association Rule Mining Program, b- File of Association Rules Extracted

Now before we display how the proposed enhanced routing algorithm, we first display the implementation of traditional shortest path algorithm, the resulted shortest path is (1-4-7-5-8-2), see Figure (4-a). In traditional shortest path the basic criteria is the low cost of distances between source and destination, without consideration of congestions. In the proposed shortest path both of minimum cost and minimum congestion state will be taken as a basic consideration, see Figure (4-b). This explains the implementation of proposed shortest path which shows how the selection of shortest path will be affected by congestion state. The shortest path with congestion consideration is (1-4-3-5-8-2).

Figure (5): Comparison between Traditional and Proposed

310

Journal of Emerging Trends in Computing and Information Sciences

2010-11 CIS Journal. All rights reserved. http://www.cisjournal.org

Volume 2 No.7, JULY 2011

ISSN 2079-8407

4. CONCLUSION
There are some conclusions reached implementing the proposed system, these are: 1. by

[2] X. and Davison, B. D. Knowing a Web Page by the Company It Keeps. In Proceedings of the 15th ACM Conference on Information and Knowledge Management (CIKM), pp. 228-237, Arlington, VA, 2006. [3] Tan, P., Steinbach, M., and Kumar, V. Introduction to Data Mining. Pearson Addison Wesley, 2006. [4] Han, J., and Kamber, M. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2006. [5] RESENDE, M. G. C., PARDALOS, P. M. Handbook of Optimization in Telecommunications. Berlin: Springer, 2006. [6] JOHANSSON, B., JOHANSSON, M. Primal and dual approaches to distributed cross-layer optimization. In 16th IFAC World Congress. Prague (Czech Republic), 2005. [7] XIAO, L., JOHANSSON, M., BOYD, S. Simultaneous routing and resource allocation via dual decomposition. IEEE Transactions on Communications, 2004, vol. 52, no. 7, p. 11361144. [8] CHIANG, M. Geometric programming for Communication Systems - Foundations and Trends in Communications and Information Theory. Hanover (USA): now Publishers Inc., 2005. [9] PIO RO, M., MEDHI, D. Routing, Flow, and Capacity Design in Communication and Computer Networks. San Francisco (USA): Morgan Kaufmann, 2004. [10] JOHANSSON, M., XIAO, L. Cross-layer optimization of wireless networks using nonlinear column generation. IEEE Transactions on Wireless Communications, 2006, vol. 5, no. 2, p. 435 445.

2.

3.

4.

5.

Building the proposed routing algorithm database which contains thousands of tracked path (paths tracked by various routing algorithm). Then applying the proposed encoding scheme for major tracked paths critical attributes. The support association rule data mining technique applied on high accurate and integrated environment leading to make the resulted patterns more validated and reliable. By using association rules the most critical patterns obtained, these referred to the link state (shortest path algorithm), as unreliable algorithm. The proposed shortest path algorithm was built on the principle of treatment most problems related with the traditional shortest path, especially congestion. The proposed congestion measure algorithm presented by broadcasting ping packets and calculates the times of arrival of the acknowledgment for these ping packets. Then select the fast response node as the best and make the shortest path algorithm depending on two critical criteria which are the cost and congestion. By implementing both algorithms, traditional and proposed, on the same network environment, the results obtained were compared according to the most critical criteria of routing algorithms. After comparisons there was observed enhancement in path from source to destination.

REFERNECES
[1] Witten, I. H., and Frank, E., Data Mining: Practical Machine Learning Tools and Techniques, 2nd edition, Morgan Kaufmann, San Francisco, 2005.

311