Differentiated Quality of Service Scheme Based on the Use of Multi-classes of Ant-like Mobile Agents Liliana Carrillo, Carles Guadall, José Luis Marzo

Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella

Institut d’Informàtica i Aplicacions Campus Montilivi UdG, 17071 Girona, Spain (+34) 972418475

Istituto Dalle Molle di Studi sull’Intelligenza Artificiale Galleria 2, CH-6928 Manno-Lugano, Switzerland (+41) 91 610 8568

{lilianac,cguadall,marzo}@eia.udg.es

{gianni,frederick,luca}@idsia.ch

We present AntNet-QoS, a novel approach that taking inspiration from the Ant Colony Optimization (ACO) framework, and in particular from the AntNet routing algorithm, allows dynamic scheduling, forwarding and link sharing among multiple packet classes in a differentiated service (DiffServ) network.

Categories and Subject Descriptors C.2 [Computer-Communication Networks]: C.2.2 Network Protocols: - Routing Protocols. C.2.1 Network Architecture and Design: - Distributed Networks

General Terms Algorithms, Management, Measurement, Performance, Design.

Keywords Quality of Service (QoS), DiffServ, QoS Routing (QoSR), Antbased Algorithms, Ant Colony Optimization (ACO).

1. INTRODUCTION

In this paper we present AntNet-QoS, a DiffServ scheme that takes into account all these needs by extending the ideas of AntNet [2], an ACO algorithm [3] designed for best-effort routing in IP networks.

2. AntNet-QoS – GENERAL DESCRIPTION AntNet-QoS [4] is a differentiated QoS scheme where n CoS are considered to be provided. Core nodes do the PHB in terms of scheduling and forwarding for the n CoS. In terms of scheduling, we consider n queues, serviced proportionally to their priority according to a min-max class-based queuing policy. We allocate resources to each CoS in accordance with its relative weight. In the case of an empty queue, excess capacity is dynamically allocated to the remaining classes based on the relative weights. Data forwarding decisions are based on stochastic routing tables obtained according to the AntNet model (fig. 1). AntNet-QoS uses n different and independent Classes of Ant-like mobile agents (CoA) to deal with the n different CoS. The task of each ant belonging to a specific CoA consists in sampling/discovering a path that can provide the QoS required by the CoS managed by the ant's CoA. links

Once the classification is made, core nodes could differentiate the traffic (aggregates of flows) in terms of forwarding (QoSR), scheduling (queuing priority, discarding), and fragmentation (if it is permitted). Most of the QoS schemes for DiffServ networks do the differentiation (known as Per-Hop Behavior – PHB) only in terms of scheduling but not on forwarding. Schemes that take into account the forwarding differentiation generally propose QoSR algorithms where the focus is on improving the performance of individual CoS. But, since in a multi-class network, as DiffServ is, services with high priority coexist with services with lower priority, the decision in routing and scheduling for the high priority services has to be made carefully to not affect the performance of the lower priority services. Then, a scheme that allows dynamic scheduling, forwarding and link sharing among multiple CoS is needed. Copyright is held by the author/owner(s). CoNEXT’05, October 24–27, 2005, Toulouse, France. ACM 1-59593-035-3/05/0010.

destination

In a DiffServ network [1], ingress nodes have the aim of classifying those arriving flows into Classes of Services (CoS) that can be provided in the network.

P11 P11 P11

P21 P21 ... ...

PM1 PM1

P21 ... PM1

P12 P12 P12

P22 P22

P22

... ... PM2 PM2

... PM2

... ...

... ... ... ...

... ... ...

P1N P1N P1N

P2N P2N ... ...

P2N ...

PMN PMN PMN

Pheromone routing table per CoS for ants destinations Retard Retard Retard Retard (1) (2) stat (1) stat (2) (1) (2)

... ......

links

n CoS ... ... ...

Pw per CoS

destination

ABSTRACT

P11 P11 P11

P21 P21 ... ...

PM1 PM1

P21 ... PM1

P12 P12 P12

P22 P22 ... ...

PM2 PM2

P22 ... PM2

n CoS ... ... ...

... ...

... ... ... ...

... ... ...

P1N P1N P1N

P2N P2N

P2N

... ...

... PMN PMN PMN

Probabilistic Routing table per CoS for data

n CoS Retard Retard (N) stat (N) (N)

Local statistics per CoS

Figure 1. Forwarding: data structures in every node Per each CoS, every node holds an ant routing table (called pheromone table), a data routing table, and a vector of statistics. In the kth pheromone table, each value Pij indicates for the kth CoS, the real-valued goodness of going over neighbor i to destination j. Values in the kth pheromone table are updated using the end-to-end delay estimates reported by the kth CoA. The vector of statistics (average path delay, best path delay, variation delay) is needed to evaluate the delays reported by the ants. Data routing tables are derived from the pheromone tables by applying a power function (so data avoid low probability paths).

8

1

CoS0

2

Figure 2. Simple network formed by 8 nodes and 9 links AntNet-QoS shows a quick adaptive response, as it is typical of antbased algorithms. It rapidly learns about the three possible paths and distributes the traffic in accordance with their respective capacity. After 35 seconds, 83% of the CoS0 traffic follows the best path 1-3-5. The rest of the CoS0 traffic follows the path 1-2-4-5. 59% of CoS1 traffic follows the path 1-2-4-5, 35% follows the path 1-8-7-6-5, and the remaining 6% follows the path 1-3-5 (mainly used for CoS0 traffic).

3.2 Performance Analysis In a second series of experiments we considered a more complex and realistic network, NSFNET-T1 (fig. 3). In this case, traffic of three CoS is sent from node 1 to node 4. We analyze throughput, end-to-end delay, variation delay, and overhead, when network load increases from 10 to 100% (fig. 4) following the same type of experiments described in [6]. 4 14

5

1

3

11

12

6

10

7

Average delay (s) 90 %

0.1 0 10%

20%

30%

40%

CoS2

Total

CoS0

1 0.5 0 40%

50%

70%

80%

90% 100%

80%

90%

4b

1.5

30%

60%

Per-Class % Ant/Data Arrived

2

20%

50%

Load Percentage (%)

4a CoS1

Total

0.2

Per-Class Variance Delay CoS0

CoS2

0.3

10 0%

70 %

80 %

60 %

50 %

40 %

30 %

20 %

CoS1

0.4

60%

70%

80%

90% 100%

CoS1

CoS2

Total

15 10 5 0 10%

20%

30%

40%

50%

60%

70%

100%

Load Percentage (%)

4c

4

5

9

CoS0

4d

Figure 4. Per-class performance of AntNet-QoS

6

13

Per-Class Average Delay

Total

Load Percentage (%)

3

2

CoS2

Load Pe rce ntage (%)

10%

7

CoS1

% Ant/Data Arrived

In a simple network (fig. 2), where all links have the same capacity, two CoS are sent from node 1 to node 5. Three are the possible paths connecting these two end nodes. The priority preference of CoS0 is 70%, and the one of CoS1 is 30%.

Per-Class Average Throughput

4000000 3500000 3000000 2500000 2000000 1500000 1000000 500000 0 10 %

3.1 Traffic Distribution over Multiple Paths

provides an average delay of 512 ms for the CoS2 traffic, while AntNet-QoS provides an average delay of only 129 ms. Average Througput (bps)

Using the OMNeT++ simulator [5], we have implemented our AntNet-QoS scheme. We report preliminary results concerning the ability of the algorithm to distribute the different traffic flows across different paths and its overall performance.

Variance delay (s)

3. EVALUATION OF THE SCHEME

8

Figure 3. NSFNET-T1 network: 14 nodes and 21 links Traffic marked as CoS0, CoS1 and CoS2 has priority preference of 70%, 20% and 10% respectively. The capacity of each link along path 1-11-12-4 (the shortest path) is 3 Mps, and the capacity of the other links is 2 Mps. 20% of the generated traffic belongs to CoS0, 30% to CoS1, and 50% to CoS2. Forward ants are proactively generated every 0.2 sec. Figure 4a shows the total average throughput, and the individual class ones. In [6], it is said that the widest bandwidth (WB) algorithm shows a network efficiency (ratio between the average total throughput and the total capacity of the paths connecting node 1 and node 4) of 88.1%, while that of a per-class approach, called PERD, shows a 97.1%. On the other hand, the network efficiency of AntNet-QoS is 93.2%. In terms of delay, when the traffic load is relatively low, there is no obvious difference between AntNet-QoS and its opponents, but when traffic load increases, it performs much better than its opponents. For instance, in the extreme case of 100% traffic load, the WB algorithm

In more general terms, the experimental results seem to show that AntNet-QoS can provide a significant advantage over its competitors especially concerning measures of end-to-end delay and jitter (fig. 4b and 4c). Moreover, the low overhead (fig. 4d) of AntNet-QoS shows its efficiency in terms of an effective use of network resources to deliver good performance.

4. Conclusions and Future Work We have proposed a scheme that allows dynamic scheduling, forwarding and sharing link among multiple CoS. In spite of the fact that this work is still in progress, preliminary results show that the proposed scheme can make full utilization of network resources providing good performance in terms of end-to-end delay, throughput, and jitter. Future work includes the implementation of an admission control scheme, the cooperation among the different CoAs to improve the process of path evaluation and pheromone updating using both positive and negative reinforcements; use of both proactive and reactive ant generation to better support high priority CoS; identification of mechanisms for self-tuning of the internal parameters in order to build a fully autonomic routing system.

5. References [1] S. Blake, D. Black, M. Carlson, E. Davies, W. Weiss, and Z. Wang. An architecture for Differentiated Services. RFC 2475, 1998. [2] G. Di Caro, and M. Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9, pp. 317-365, 1998. [3] M. Dorigo, G. Di Caro, L.M. Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life Vol. 5, N. 2, 1999. [4] L. Carrillo, J.L. Marzo, P. Vilà, Ll. Fàbrega, and C. Guadall. A Quality of Service Routing Scheme for Packet Switched Networks based on Ant Colony Behavior. In Proceedings of the SPECTS 2004. [5] The OMNET++ Network Simulator, http://www.omnetpp.org/ [6] W. Zhou. Provision and QoS Route Optimization in Differentiated Service Networks. Master’s thesis. Helsinki University of Technology. Networking Laboratory. 2002.

Differentiated Quality of Service Scheme Based on ...

C.2 [Computer-Communication Networks]: C.2.2 Network. Protocols: - Routing Protocols. C.2.1 Network Architecture and. Design: - Distributed Networks. General Terms. Algorithms, Management, Measurement, Performance, Design. Keywords. Quality of Service (QoS), DiffServ, QoS Routing (QoSR), Ant- based Algorithms ...

223KB Sizes 3 Downloads 322 Views

Recommend Documents

A Quality of Service Routing Scheme for Packet ...
Abstract. Quality of Service (QoS) guarantees must be supported in a network that intends to carry real-time multimedia traffic effectively. A key problem in providing. QoS guarantees is routing which consists of finding a path in a network that sati

Segmentation of Markets Based on Customer Service
Free WATS line (800 number) provided for entering orders ... Segment A is comprised of companies that are small but have larger purchase ... Age of business.

A Quality of Service Negotiation-Based Admission ...
Index Terms—Call admission control, quality of service (QoS), wideband code .... proposed algorithm allows for preemption of NRT data, which ...... satellite communications, telematics applications, communication services and antennae ...

Location-Based-Service Roaming based on Web ...
1. Introduction. In various Add-On services, Location Based. Services (LBS) are services based on the ... network-based approach and handset-based approach.

A Novel Blind Watermarking Scheme Based on Fuzzy ...
In this paper, a novel image watermarking scheme in DCT domain based on ... health professionals and manipulated and managed more easily [13],[15] .... log),(. (8). And 'entropy' is an indication of the complexity within an image. A complex ..... dif

Locality-Sensitive Hashing Scheme Based on Dynamic ...
4.1 Theory of Virtual Rehashing ..... Color The Color dataset contains 68,040 32-dimensional data objects, which are the color histograms of images in the.

Towards a Distributed Clustering Scheme Based on ...
Comprehensive computer simulations show that the proposed ..... Protocols for Wireless Sensor Networks,” Proceedings of Canadian Con- ference on Electrical ...

Authentication Scheme with User Anonymity Based on ...
Anonymous authentication schemes on wireless environments are being widely ... the Internet, she/he can guess which access point the user connects, and she/he can also guess the ... three party structure: the authentication costs of home agent are ex

[PDF Download] Foundations of IT Service Management Based on ...
[PDF Download] Foundations of IT Service Management Based on. ITIL V3 (Spanish Management) (ITSM Library) Download Full. Book Synopsis. The ITIL V3 ...

A Burst Error Correction Scheme Based on Block ...
B.S. Adiga, M. Girish Chandra and Swanand Kadhe. Innovation Labs, Tata Consultancy ..... Constructed. Ramanujan Graphs,” IJCSNS International Journal of Computer. Science and Network Security, Vol.11, No.1, January 2011, pp.48-57.

Towards a Distributed Clustering Scheme Based on ... - IEEE Xplore
Abstract—In the development of various large-scale sensor systems, a particularly challenging problem is how to dynamically organize the sensor nodes into ...

Hierarchical Location Management Scheme Based on ...
COMMUN., VOL.E87–B, NO.3 MARCH 2004. PAPER Special Section on Internet Technology IV ... tail stores, coffee shops, and so forth. Also, sensor networks.

Service Quality
This response illustrates the importance placed on “quality” and “customer satisfaction” by many organizations. The empirical analysis of the Profit Impact of Marketing. Strategy (PIMS) database has shown a positive relationship between perce

Alternative Perspectives on Service Quality and Customer Satisfaction ...
Purpose - The purpose of this paper is to further investigate the linkages between business process management (BPM) and customer satisfaction. Also, to challenge the dominance of the customer contact perspectives on service processes and to propose

Inter-Cluster Service Lookup Based on Jini
This wastes lots of network bandwidth and the ... considerable network bandwidth and increasing the ..... Purpose: Measure the influence of different values of.

On Practical Service-Based Computing in Distributed ... - CiteSeerX
to be inefficient, with a huge, and increasing, number of data signals .... However, technology for modeling and analyzing functions at .... it is a wired network of ECUs (in-car wireless devices ..... by the advantages we mention above. In Figure ..