INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

A QOS-Aware Of Dynamic Logistics Service

Composition Algorithm Based On Social Network
Bijily Issac1
PG Scholar, Department of Computer Science and Engineering,
SriGuru Institute of Technology,
Coimbatore- India
, bijilyissac@gmail.com1

M. Karthikeyan 2
PG Scholar, Department of Computer Science and Engineering,
SriGuru Institute of Technology,
Coimbatore- India,
karthisrit@gmail.com3

Abstract In todays world, internet services are extremely essential as they're needed for accomplishing tasks during a
matter of second. Internet services offer options like e-Booking, e-Shopping, e-Banking that helps users to accumulate
everything from wherever they're. Presently internet developers use linguistics based mostly descriptions of internet
services to pick out and compose them and supply one composition arrange to the users. In bound cases providing one
arrange to the users might not enable them to explore alternative smart choices that are obtainable. With facilitate the
assistance of culture loop pattern it's attainable to allow multiple choices to the users request which might help them to
pick out an idea in step with their need and luxury. So associate formula is projected supported linguistics description
associated multiple composite services dynamically and to supply the user a flexibility to pick out an optimized
composition supported their comfort.
Keywords: Logistics Path Planning, Service Composition, Social Network, QOS, Big Data.

1 INTRODUCTION
With the proliferation of net services providing a similar practicality,
researches regarding usefulness and adaptive capability of net services
choice mechanism have gained substantial momentums. This paper
presents a dynamic net services composition rule supported the best
path technique of the weighted directed acyclic graph. Experiment
results show that the rule will accelerate the speed of service choice,
and produce nice profit to the appliance of net services composition.
There square measure 2 directions in our future work: one is to look
for the strategy of implementing run-time whereas, because of under
utilization of feedback info, the huge useless redundant iterations end
in low resolution potency of the rule. This approaches will solve some
key problems in net services composition and provides nice
illuminations to the present paper; but, none of them provides an
efficient resolution to deal with the problems of low potency within the
giant resolution area. During this paper, we have a tendency to gift
Associate in nursing hymenopteran colony rule [9] and genetic rule
[10] combination based mostly rule (ACAGA_WSC). By means that
of genetic rule, ACAGA_WSC overcomes the shortcomings of the
hymenopteran colony rule, and achieves higher potency and joining
speed. Experiment shows that the new rule provides higher
performance for the services composition drawback. The rest of this
paper is organized as follows. Next section provides short introduction
of the necessities of net services composition. Section three discusses
the hymenopteran colony rule based mostly net services composition
model. Section four describes style of ACAGA_WSC. In section five,
judge our rule by Associate in nursing experiment. Finally, Section
half-dozen concludes the paper.

IJTET2015

Only the exclusivity of resources is taken into account, and also

the sharing of resources isn't taken into consideration in a very
programming method. The exclusivity of resources implies that if
a resource is occupied or used, it can't be employed by different
tasks at an equivalent time. within the connected literature of
service computing and or cloud computing [9, 10], the exclusivity
of resources implies that a resource is employed one time in a very
programming method, regardless of what percentage tasks are in a
very programming method. And additionally the exclusivity of
resources could be a typical characteristic of resources
programming in commission computing and or cloud computing
setting, as a result of the unit of your time for a programming is
sometimes seconds or maybe milliseconds, microseconds [11, 12].
However, in cloud producing setting, the unit of your time for
resources programming is sometimes days or weeks, thus so as to
boost the resources utilization, resources ought to be thought-about
to reprocess in different tasks once resources are free in a very
multiple tasks programming method. During this paper, we have a
tendency to decision the time division sharing of resources.
The best programming didn't contemplate the correlation of
resources. Resource programming, service choice, discovery, and
composition within the literature are supported the options of
resources and/or services [1315]. However, in fact, there are
correlations among resources, notably resources were employed in
tasks. Normally, for instance, 2 consecutive sub tasks in a very task
performed by resources of an equivalent supplier ought to be a lot
of economical than completely different suppliers. Here, an
equivalent supplier is that the correlation of resources.

63

INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

In cloud producing setting, tasks could also be continuous, but,
during this paper, we have a tendency to place time into segments
and handle all tasks in a very slot a bit like designing in producing
enterprises. And so we have a tendency to might optimally
schedule virtual resources at the start of a slot, absolutely
considering the correlation and sharing of resources, to interrupt
through the limitation of native optimization and to realize the
general optimization for multiple tasks.

2 RELATED WORKS
Just like service composition and optimum programing for single
task, each single task of multiple tasks for optimum programing in
cloud producing additionally ought to bear decomposition,
production of candidate resource sets, choice of resources, and
choice of execution path. From the angle of the execution path of sub
tasks and candidate resource sets. Differing types of tasks: the
execution path of sub tasks and corresponding candidate resource
sets area unit completely different. As an example, tasks from
logistics enterprises and tasks from producing enterprises area unit
differing types. Same style of tasks: the execution path of sub tasks
and corresponding candidate resource sets area unit completely
identical. As an example, multiple tasks from a particular style of
product producing enterprises area unit identical sort. Mixed styles
of tasks: the execution path of sub tasks and corresponding candidate
resource sets area unit partially identical. As an example, multiple
tasks from sorts differing types differing kinds of product producing
enterprises area unit mixed types. All the tasks have completely
different producing methods however need identical cutting process.
Virtual resources integration and optimum programing for
completely different for various styles of tasks might adopt the tactic
of ancient single task execution due to completely different candidate
resource sets and execution methods. And for mixed styles of tasks,
we are going to study it within the future due to its quality. Therefore
during this paper, we are going to concentrate on identical style of
tasks and study virtual resource integration and optimum
programing.
Though the native optimization approaches square measure
economical, they need the limitation of vicinity. On one hand, the
native optimization approaches severally take into account the QOS
of every service so the QOS of the composite service may not satisfy
the constraints. On the opposite hand, owing to some nonlinear QOS
attributes, the excellent QOS don't have the character of optimum
substructure. therefore we have a tendency to cannot merely add up
all the QOS attributes, which suggests the QOS of the composite
service might not be the optimum one the QOS for each single
service is perfect. In cloud producing service system, supported
cloud producing service platform, producing enterprises will
integrate an outsized variety of customized necessities type to create
bunch necessities and may form a dynamic entity named cloud
enterprise per dynamic configuration of bunch necessities and
integration of virtual producing resources from the pool of cloud
producing resources.

IJTET2015

The cloud enterprise will offer merchandise or services on

demand and at last will satisfy customized necessities through the
optimum planning of virtual resources and also the mapping of
virtual resources and real resources.
Its core plan is to make the pool of cloud producing resource
supported the virtualization for producing resources and servitization
for producing capability through the combination of recent
technologies like cloud computing and IoT and so give numerous
producing services which might be obtained safe and reliable, of
high-quality, and of cheap for the total life-cycle producing method,
and eventually to realize customers, manufacturers, and suppliers
price access together.

Similarity
Cloud

Netwo
rking

Infrast
ructur
e

Find
Similar

Training
Database

QOS Ranking
[Cluster Formation]
Rank

Cloud

Fig. 1 QOS Structure

3 DESIGN OBJECTIVES
We Enhances a scientific approach is projected to calculate QOS for
composite services with complicated structures, taking into thought
of the likelihood and conditions of every execution path. Four sorts
of basic composition patterns for composite services area unit
discussed: successive, parallel, loop, and conditional patterns.
Specially, QOS solutions area unit provided for unstructured
conditional and loop patterns. We have a tendency to additionally
show however QOS-based service choice may be conducted
supported the projected QOS calculation. Experiments are conducted
to point out the effectiveness of the projected methodology
improvement, discover multiple composite services, nonfunctional
preferences, and pragmatic data. Possible composition, assign
weights choices to the user, choose set up supported his preference.
The worldwide optimization methodology not solely considers
the QOS of one service however the entire QOS of the composite
service so as to induce the worldwide best answer.

64

INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

For the sake of individually units and worth ranges of each QOS
attribute, normalization is required. Risk driven choice algorithmic
program will important cut back the search area by preferentially
looking the services generate.
Best service path inside a suitable amount of your time.
Methodologies square measure the method of analyzing the queries
and providing a personal service for the users. The subsequent square
measure the four modules concerned within the service composition
techniques.
3.1
Query Analysis
A query is a process that user enters a info into an online program
to satisfy his or her search request Net search queries square measure
distinctive therein they're usually plain text or machine-readable text
with no mandatory search-directives (such as "and""or" with "-" to
exclude). They vary greatly from commonplace question languages,
that square measure ruled by strict syntax rules as command
languages with keyword or point parameters. A user WHO is
craving for info concerning totally different social networks that
cowl many topics or sides might want to explain every of them by a
disjunction of characteristic words, like vehicles OR cars OR
vehicles. A faceted question may be a conjunction of such facets; e.g.
a question like (electronic OR processed OR DRE) AND (voting OR
elections OR election OR pick OR electoral) is probably going to
search out informations of various social network concerning
electronic selection although they omit one among the words
"electronic" and "voting", or maybe each.
3.2
RFS Implementation
In the service necessities part, the buyer details the technical and
useful specifications that a service has to fulfil. whereas process the
service necessities, the buyer conjointly specifies nonfunctional
attributes like characteristics of the human agent providing the
service, constraints and preferences on knowledge quality, and
needed security policies for the service. Service compliance details
like certifications required, standards to be adhered to, and so on, are
known. The technical specifications lay down the hardware,
software, application standards, and language support policies to that
a service ought to adhere. Once the shoppers have known and
classified their service wants, they issue missive of invitation for
Service (RFS). This RFS may be generated in a very code format
mistreatment linguistics net technologies and that we have illustrated
this within the next section. If the user isn't glad with the services
discovered, they will modification their necessities (say, by
increasing the price constraint) and or policies and restart the
invention part with a brand new RFS. We tend to conjointly assume
that the user necessities can modification once the user begins
intense the services then we tend to show a link between the
consumption and necessities part.
3.3
Service Selection
In the service choice part, by analyzing the user question services
square measure selected by comparison the specifications listed
within the RFS with service descriptions. The chosen service was
affected by useful and technical attributes outlined, and conjointly by
the fund, security, compliance, knowledge quality, and agent policies
of the buyer. A corporation will unleash the RFS to a restricted
preapproved set of suppliers.

IJTET2015

As an alternative, it will explore for all attainable vendors on the net.

Choice of services from RFS will give user requested composed info
concerning totally different social networks which might use.
3.4
Pattern Selection
In this module, calculation of QoS for composite services with
complicated structures square measure processed, taking into thought
of the likelihood and conditions of every execution path. Four
varieties of basic composition patterns for composite services square
measure discussed: consecutive, parallel, loop, and conditional
patterns. Specifically, QoS solutions square measure provided for
unstructured conditional and loop patterns. Itll generate a
composition commit to meet the necessities fixed by demand one,
that sets necessities solely on the QoS of the online service
composition. We tend to 1st conduct service choice during which the
planned QoS analysis technique is adopted to calculate QoS for
composite services. Then, the result's compared with service choice
results supported different QoS calculation ways.

4 SYSTEM MODEL
The reason is that the influence of the correlation of resources
employed in tasks is incredibly little. But in conjunction with the
raised variety of tasks, the benefits of E2 and E3 that take
correlations under consideration area unit vast, and therefore the
profits of E2 and E3 area unit far more than E1 for a similar variety
of tasks, and therefore the gap are larger and larger. Thats as a result
of the correlations each in an exceedingly task and among tasks area
unit thought of, and therefore the value of selected resource are less
than the default worth. Therefore, it may be finished that the
projected methodology that thought of the correlations of resources
has higher performance than while not considering the correlations.
In the social science space, there area unit several classical theories
concerning relationship among individuals which provides the muse
of our analysis. In 1960, Milgram found the Six Degree of
Separation theory. The little world experiment proves that everybody
and everything is six or fewer steps away, by introduction from the
other person within the world, so a series of a friend of a friend
may be created to attach any 2 individuals in an exceedingly applied
to the areas like informatics, biology and communication technology
etc. This theory shows that the gap among actors in an exceedingly
relation network is usually short.
About the impact of relationship strength, proposes the weak ties
theory shows that the link among actors has 2 states of robust and
weak and analyses the strength with the feeling, interaction
frequency, reciprocal exchange and therefore the density aspects.
The experiment shows that robust relationship usually brings several
recurrent info whereas weak relationship will become a bridge to
convey messages. Within the B2B space, points out that smart
cooperation relationship will improve the degree of trust and name.
Additional analyses the impact of robust and weak relationship. It
shows that the robust relationship supported throughout long
cooperation can cut back the value and increase revenue, whereas
weak relationship will additional seemingly to find new markets for
a corporation and select applicable one to extend profit.

65

INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

In application uses a graph to create a business cooperation network
and alter the partner select drawback to a MOO drawback. It
optimizes the multiple QoS within the same time. Additionally use
the cooperation relationship to choose partner. It evaluated the end in
node attribute and network attribute.
Applies the SNA to
cooperation network. It uses a paper author/co-author relation
knowledge and analyses the common interest and talent to create a
team.
AI coming up with Tools is a way to compose service path. Offers a
survey concerning this AI coming up with approaches. Proposes the
plan to mechanically build the service work flow and offers a replanning element which might somehow trot out the service failure
scenario. Proposes a service description language PDDL to translate
the goal service into the design domain then translated the results
back to the service domain. Uses a dependency graph to scale back
search area by presumptuous all services area unit unsettled, then
finding path within the graph. Proposes HTN-planners SHOP2 to
mechanically compose DAML-S net services.

Shortest-Job-First (SJR) Scheduling:

Associate with each process the length of its next CPU burst. Use
these lengths to schedule the process with the shortest time.
Two schemes:
1. Non preemptive once CPU given to the process it cannot be
preempted until completes its CPU burst.

5 SCHEDULING ALGORITHM

This formula defines an exponential average

Efficient scheduling across nodes is necessary to

maximize application performance regardless of the
efficiency of your parallel algorithms.
Dynamic scheduling in a heterogeneous environment is
significantly more complicated.
Programming parallel applications is difficult, and not
worth the effort unless large performance gains can be
realized.
Scheduling is a key part of the workload management
software which usually perform some or all of:

Queuing

Scheduling

Monitoring

Resource management

Accounting
Round-robin:
Each process is placed in a run-queue
Allocated a service quantum of time (commonly set to 10
milliseconds)
Processes that demand less time run without being
interrupted
Processes exceeding the service quantum are interrupted
and returned to the back of the run-queue to await further
processing
Round-robin favors short process demands
Consequently it is biased in favor of a greedy user who
runs many short-demand processes
The UNIX scheduler schedules processes not users
What was needed was a fair-share(FS) scheduler

IJTET2015

2. Preemptive if a new process arrives with CPU burst length less

than remaining time of current executing process, preempt. This
scheme is known as the Shortest-Remaining-Time-First (SRTF).
SJF is optimal gives minimum average waiting time for a given set
of processes.
Prediction of the Length of the Next CPU Burst

Pn+1 = a tn+(1-a)Pn

o
o

(1)

Pn stores the past history

tn contents are most recent information

The parameter a controls the relative weight of recent and past

history of in our prediction

If a =0 then Pn +1 =Pn

(2)

That is prediction is constant

If a = 1 then Pn +1 = tn

(3)

Prediction is last CPU burst

Priority Scheduling
A priority number (integer) is associated with each process
The CPU is allocated to the process with the highest priority
(smallest integer highest priority).
1. Preemptive
2. Non-preemptive

66

INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

SJF is a priority scheduling where priority is the predicted next CPU
burst time.

[6] J. Li, J. Xia, W. Tang, J. Zeng, X. Wang, & L. Wu, Survey on

Problem Starvation low priority processes may never execute.

Research ofComputers 27(10), 2010.

Webservices selection algorithms based on QoS Application

[7] Zeng. L, Benatallah. B, Ngu. A. H, Dumas. M, Kalagnanam. J,

Solution Aging as time progresses increase the priority of the
process.

&Chang.

6 CONCLUSION
A systematic QoS analysis approach for dynamic
composition is able to provide comprehensive QoS
information for a composite service even with the existence
of complex composition structures such as unstructured
conditional patterns and MEME loop patterns. The QoS
information generated by the proposed QoS analysis
approach includes not only the QoS of the web service
composition but also the QoS and probability of the
execution paths with the help of logistic services.This work
can be enhanced with the Dynamic QoS of a web service
composition can be calculated based on the assumption that
each task has a dynamic QoS. The dynamic QoS of each
task is more likely to be a probability distribution in reality.
For future research, it is to study dynamic QoS calculation
method for a composite service with component dynamic
QoS modelled as general QoS probability distributions. It
would be even challenging to estimate the probability
distributions for services with short life cycle or less
frequent use.

311-327, 2004.

H,

QoS-aware

middleware

for

web

services

compositionSoftware Engineering, IEEE Transactions on, 30(5),

[8] Liu. Y, Ngu. A. H, & Zeng. L. Z. QoS computation and policing
indynamic web service selection In Proceedings of the 13th
internationalWorld Wide Web conference on Alternate track papers
& posters, pp. 66-73. ACM, 2004.
[9] Yu. T, & Lin. K. J, Service selection algorithms for Web
serviceswith end-to-end QoS constraints Information Systems and
EBusinessManagement, 3(2), 103-126, 2005.
[10] Y. Dai, L. Yang, B, Zhang. & Y, Gao, QoS for Composite
WebServices and Optimizing Chinese Journal of Computers,
29(7),1167-1178, 2006.
[11] Gary. M. R, & Johnson. D. S, Computers and Intractability: A
Guideto the Theory of NP-completeness. 1979.
[12] Liu. G. &Ramakrishnan. K. G, A* Prune: an algorithm for
finding Kshortest paths subject to multiple constraints In
INFOCOM 2001.Twentieth Annual Joint Conference of the IEEE
Computer and CommunicationsSocieties. Proceedings. IEEE (Vol. 2,

REFERENCES

pp. 743-749), 2001.

[1] Strunk. A, QoS-aware service composition: A survey, 2010

[13] Alrifai. M, Skoutas. D. &Risse. T, Selecting skyline services

IEEE8th European Conference on Web Services (ECOWS) pp. 67-74,

forQoS-based web service composition. In Proceedings of the 19th

2010.

internationalconference on World wide web, pp. 11-20. ACM, 2010.

[2] O'Sullivan. J, Edmond. D, &TerHofstede. A, What's in a

[14] Alrifai. M, Risse. T, &Nejdl. W, A hybrid approach for

Service?Distributed and Parallel Databases, 12(2-3), 117-133,

efficientWeb service composition with end-to-end QoS constraints

2002.

ACMTransactions on the Web (TWEB), 6(2), 7, 2012.

[3] Wang. Z, &Crowcroft. J, Quality-of-service routing for

[15] Hiratsuka. N, Ishikawa. F, &Honiden. S, Service selection

supportingmultimedia applications IEEE Journal on Selected Areas

withcombinational use of functionally-equivalent services 2011

in Communications,14(7), 1228-1234, 1996.

IEEE InternationalConference on Web Services (ICWS), pp. 97-104,

[4] Oksanen. T, &Visala. A, Coverage path planning algorithms

2011.

foragricultural field machines Journal of Field Robotics, 26(8),

[16] Canfora. G, Di Penta. M, Esposito. R, &Villani. M. L, A

651-668,2009.

frameworkfor QoS-aware binding and re-binding of composite web

[5] Y. Dong, H. Ni, H. Deng, & L. Liu, Service Selection Strategy

servicesJournal of Systems and Software, 81(10), 1754-1769, 2008.

OfferingGlobal Optimal Quality of Service. Journal of Chinese

ComputerSystens, 32(3), 455-459, 2011.
IJTET2015

67

INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY

VOLUME 3 ISSUE 1 JANUARY 2015 - ISSN: 2349 - 9303

[17] Klein. A, Fuyuki. I, &Honiden. S, SanGA: A Self-Adaptive
Network-Aware Approach to Service Composition, 2013.
[18] S. Liu, Y. Liu, F. Zhang, G. Tang, & N. Jing, A Dynamic Web
ServicesSelection Algorithm with QoS Global Optimal in Web
ServicesComposition [J]. Journal of Software, 18(3), 646-656,
2007.
[19] Y. Wang, J. Li, Z. Chen, Y. Meng, & H. Ding, Web services
selectionalgorithm with QoS global optimal Application Research
of Computers, 27(5), 2010.
[20] Kousalya. G, Palanikkumar. D, &Piriyankaa. P. R, Optimal
Webservice selection and composition using multi-objective bees
algorithm2011 Ninth IEEE International Symposium on Parallel
andDistributed Processing with Applications Workshops (ISPAW),
pp.193-196, 2011.
[21] Yang. Z, Shang. C, Liu, Q, & Zhao. C, A Dynamic Web
ServicesComposition Algorithm Based on the Combination of Ant
Colony Algorithmand Genetic Algorithm Journal of Computational
Information Systems, 6(8), 2617-2622, 2010.
[22] Travers. J, & Milgram. S, An experimental study of the small
worldproblem Sociometry, 425-443, 1969.
[23] Granovetter. M. S, The strength of weak ties American
journal ofsociology, 1360-1380, 1973.

AUTHOUR PROFILE
Bijily Issac is currently pursuing masters degree program in computer
science and engineering in SriGuru Institute of Technology , India,
E-mail: bijilyissac@gmail.com
M. Karthikeyan is currently pursuing master`s degree program in
computer science and engineering in SriGuru Institute of Technology,
India,
E-mail: karthisrit@gmail.com

IJTET2015

68