An agent architecture for network support of distributed simulation systems

Size: px
Start display at page:

Download "An agent architecture for network support of distributed simulation systems"

Transcription

1 An agent archtecture for network support of dstrbuted smulaton systems Robert Smon, Mark Pullen and Woan Sun Chang Department of Computer Scence George Mason Unversty Farfax, VA, U.S.A. smon, mpullen, Abstract Contnued research nto dstrbuted agent-based systems and evolvng web based technologes are openng up tremendous possbltes for the deployment of large scale and hghly extensble and flexble smulaton systems. However, the queston remans as to how well agent and web based smulaton systems can use underlyng network protocols. Ths s especally true for complex dstrbuted smulatons that have multple partcpants and real-tme data delvery requrements. Ths paper addresses the ssue of nterconnecton patterns between web-based smulaton agents. We frst descrbe a smple agent-orented archtectural extenson to an exstng dstrbuted smulaton system. Next, we present a set of nterconnecton algorthms between the agents n the system, under the assumpton that only end-host multcast s avalable. In other words, we assume natve IP multcast wll not be deployed n the near future on a large scale. We expermentally evaluate our approach under a number of dfferent scenaros. Our results show that by usng a proper connecton strategy t s possble to get good performance for agent-based systems that use end-host multcast. Index terms Agent-based Smulaton, Performance of Agent-based Smulaton Systems, Overlay Multcast Support for Dstrbuted Smulaton

2 A. INTRODUCTION One of the problems currently facng dstrbuted smulaton system desgners s how to best take advantage of evolvng web-based technologes to provde for smulaton servce nteroperablty, composablty, extensblty and dscovery. Snce many dstrbuted smulaton systems requre real-tme performance, a closely related problem s how web-enhanced smulaton envronments can effectvely use network level QoS servces for relablty, bounded latency and group-based multcast. The challenge n addressng both ssues s that web-based smulaton technologes and network-level control polces operate at dfferent system levels, and the polces and semantcs at each level do not readly translate nto effcent support at another level. For nstance, software agents are often the enttes that control web-based smulaton programs. However, applcaton-level agents may not make effcent use of avalable network servce choces such as end-host multcast, whereby the multcast functon s shfted from the network nto the applcaton [3]. End-host multcast s requred when IP multcast s not avalable. The focus of ths paper s the desgn and mplementaton of an agent-based archtecture and set of nterconnecton algorthms to effcently use end-host multcast n the Next Generaton Internet (NGI). We have prevously addressed the ssue of supportng a web-based dstrbuted vrtual smulaton (DVS) system over the NGI [9]. Portons of ths earler work descrbed our NGI Internet Federaton Obect Model (NGI FOM) and the Selectvely Relable Multcast transfer Protocol (SRMP). The NGI FOM provded a structured FOM to support a varety of multcastng styles wthn a dstrbuted smulaton system such as the HLA[13]. SRMP s a transport level protocol that supports a mx of relable and best-effort multcast by takng advantage of the specfc requrements of the DVS. For nstance, many data streams are refreshed frequently and thus may be dstrbuted by best-effort transport, whle a small fracton of traffc conssts of data change rarely and thus requres relable transport. Our orgnal work was mplemented by modfyng an RTI wrtten n TAO. Ths paper extends our approach to take advantage of several proposed web-based technologes, specfcally dstrbuted agents usng Web Servces [8] and the Semantc Web[5]. Our goal s to develop and evaluate an agentfed verson of our work n the NGI FOM and SRMP, and to use them to effectvely support an end-host DVS applcaton. Usng ths framework, we desgn nterconnecton algorthms between agents that make effcent use of the network. We have defned three basc agent classes; one to represent ndvdual runnng federatons and ther assocated FOMs, a second class concerned wth end-to-end data transport, and a thrd class of network-level agents. Our agents and ther capabltes are descrbed usng an ontology markup language based on DAML-S, and s therefore compatble wth current work n web servces and other agent ontologes [8]. Prevous related work n Web Servces for dstrbuted smulaton ncludes research nto technques for composable servces [2][10]. However, to date, there has been lttle work addressng the relatonshp between moble and composable smulatons and end-host multcast, whch s ncreasngly becomng an accepted alternate to drect IP multcast. B. BACKGROUND The use of agent-based computng n desgnng flexble and extensble smulaton systems has long been recognzed[1]. Agents are a powerful software engneerng unt that can encapsulate complex rule sets, can be composed from other agents and can communcate semantcally rch

3 messages va agent communcaton languages. Messages passed between agents are descrbed by knowledge representaton schemas called ontologes[5]. Agent computng s partcularly well suted for deployment n the context of recent work n Web servces and the Semantc Web. Web servces are applcatons or software components that are deployed on the World Wde Web. Web servces have an assocated sute of enablng protocols, such as the WSDL [7](Web Servces Defnton Language). Web smulaton servces must be descrbed along multple dmensons, ncludng both syntactc (how to use t) and semantc (what does the servce mean and what does t offer). Whle methods for syntactc descrptons are generally well understood for dstrbuted smulaton, the ssue of semantc descrpton s stll consdered an open queston. One promsng approach to ths problem s through ongong efforts n Semantc Web servce descrpton. A potental drawback n usng web-enabled agent-orented smulaton s that system performance wll suffer. Ths s partcularly true n the case of group-based communcaton systems that use end-host multcast. End-host multcast s where group management and packet replcaton s performed on end host systems, rather then wthn the network, as n the orgnal IP multcast model. As the end-host multcast model ncreases n mportance, there s growng concern about ts mpact on system performance, especally for systems such as tme senstve DVS. For nstance, snce agent composton and locaton can cause communcaton bottlenecks, t s essental to desgn effectve agent placement algorthms for end-host multcast. C. AGENT DESCRIPTION We use three classes of agents. The frst class s federate agents, and s used to represent and control ndvdual smulaton programs assocated wth a partcular NGI FOM. The functon of these agents s to allow for automatc servce dscovery, servce nvocaton, servce composton and servce executon montorng for smulaton federatons. The second agent class s fed_com agents, short for federaton communcaton. These agents are used to specfy and control communcaton level relablty and group communcaton ssues, such as multple types of relablty for dfferent data obects n the same federaton by provdng agent control over SRMP functonalty. The thrd agent class s serv_comp agents, short for servce composton agent. These agents nteract wth the network level to specfy the constructon of multcast overlay trees. Serv_comp agents determne the nterconnecton pattern between fed_com agents. They also possess the necessary functonalty to perform data conversons, such as lowerng the data rate to certan members of a group, due to compresson technques, data dstrbuton management, etc. These three classes of agents communcate by exchangng web-pages. Each web page contans ontologcal nformaton based upon DAML-S. In the DAML-S model, each ontologcal framework consstng of three subonotologes: a servce profle, a process model and a groundng. The agent servce profle descrbes what the servce can do, for purposes of servce advertsement, servce dscovery and servce matchmakng. Matchmakng s the act of matchng servces wth other servces. The process model descrbes how smulaton servces work n terms of control and data flow n terms of nputs and outputs, along wth the servce s precondtons and sde effects. The groundng specfes the detals of how an agent can access a servce. In our case we use WSDL as the format to specfy fed_com communcaton modes and assocated transport-level port numbers.

4 D. ARCHITECTURE Our approach s to defne two communcaton paths through the system. The frst s drect agent-to-agent communcaton, and s used for setup and control purposes. Ths occurs as agents exchange web pages. The second type s used drectly for data transfer, bypassng drect agent control. Ths occurs when drect network paths are setup to go between fed_com agents. The reason for two paths s that agent communcaton methods, ncludng ours, operate by exchangng XML messages. Ths technque s too slow for tme senstve data transport. The serv_comp agents wll also partcpate drectly n data transfer, usng drect network connectons. A smulaton s ntated when a federate agent fnds other federate agents va the use of a system matchmaker. Under the drecton of the ntatng agent, the agents perform an all-to-all exchange of web page descrptons, whch nclude ther FOMs and requrements for runtme smulaton parameters, based on the RTI model for smulaton specfcaton. Usng ths shared nformaton, the runtme smulaton requrements are encoded n the form of a XML descrpton. Each federate agent then dscovers a local serv_comp agent to determne network connectvty and data management requrements. Ths ncludes a specfcaton of the federates expected data rate and the selecton of the desred multcast servce, ether IP Multcast or end-host. Serv_comp agents manage multcastng and the need to support both heterogeneous data rates and data relablty modes. Data rates are determned by network connectvty and applcaton needs. For nstance, n the case of DVS systems requrng streamng data or meda streams dfferent rates can be supported, due to dfferent compresson technologes or network connectvty. Interest Management technques n the HLA also can result n dfferent requred data rates. Data relablty s a functon of the FOM. Fed_comp Fed_comp Broadcast Doman Serv_comp Broadcast Doman Wde Are Network Serv_comp Fed_comp Serv_comp Fed_comp Broadcast Domans Fgure 1: Smulaton agent archtecture From the archtectural vewpont, serv_comp agents manage local domans that represent connecton ponts between federate agents runnng on end-hosts and the Wde Area Network (WAN). A local doman may be one or more Local Area Networks (LAN), a sngle hgh-end computer connected drectly to a router, etc. We characterze the local doman as a broadcast doman. In effect, each broadcast doman s the end-pont of a logcal multcast dstrbuton tree. Based on the smulaton specfcaton and the locaton of federates nsde each broadcast doman, each serv_comp dscovers and assgns fed_comp agents to provde transport level mxed data delvery mode support. Thus, the number and locaton of each fed_comp agent represents the endponts n the logcal data dstrbuton tree. An overvew of ths archtecture s

5 shown n Fgure 1. If natve IP Multcast were possble, fed_comp agents could be placed drectly n a spannng tree. However, under the end-host scenaro each fed_comp agent needs to perform data forwardng and packet replcaton. Therefore, the nterconnecton pattern between fed_comp agents s of central mportance to system performance. The purpose of defnng and analyzng fed_comp nterconnecton algorthms s to reduce communcaton latency and system load, thus mprovng end-to-end performance. Notce that all end-host overlay technques cause extra packet transmssons over the network. Our goal s to mnmze ths effect and reduce actual bandwdth utlzaton. Our approach to multcastng s for sngle-source tree constructon. That s, each sender s the root of a tree that conssts of all the recevers. Further, we dynamcally place serv_comp agents wthn the tree at specfc places n order to reduce data traffc transmsson, as explaned below. The algorthm has three phases. In phase one, we create a mesh of fed_comp agents ordered by data rate. In phase two, we create a seres of sngle source overlay multcast trees. For phase two, we add applcaton-level admsson control, n an attempt to lmt congeston over any partcular porton of the WAN. We also use a load-balancng path selecton heurstc. Our algorthm s flexble, and uses several dfferent approaches to tree creaton. In phase three, we place extra serv_comp agents n the system to support the data rate of recevng fed_comp agents, as requred. Ths allows us to further reduce bandwdth utlzaton. The detals follow. Phase 1: Create a mesh of fed_comps per source s dfferent data rate. The mesh s a complete vrtual graph whose vertces are the fed_comps. Frst, fnd the shortest path between each fed_comp usng lnk delay as the lnk cost. Then add a un-drectonal vrtual lnk between the two group members, (.e. fed_comp) to the mesh, only when there s a path that starts from a sender to a recever fed_comp, the data rate requested by the sender s greater than or equal to the data rate requested by the recever, and the physcal lnks of the shortest path have the avalable bandwdth greater than or equal to the data rate requested by the recever. Algorthm for Mesh Creaton Let Mˆ be a set of fed_comp agents. For all ˆ Mˆ m // Requred n case of newly assgned fed_comp f ( mˆ.data_rate > (maxfederate.data_rate) mˆ.data_rate = (maxfederate. source.data_rate; For all ˆ Mˆ m Fnd the shortest path from ˆ Mˆ to ˆ Mˆ where usng a shortest path m algorthm and the delay as the lnk cost. For all ˆ Mˆ m m

6 f (( mˆ mˆ ) and ( mˆ 's data rate mˆ 's data rate ) and (the bottleneck bandwdth of the path from mˆ to mˆ m 's data rate )) ˆ Add a vrtual lnk from mˆ to mˆ to the mesh. We repeat ths procedure to create a mesh per each source s dfferent data rate. If the sources data rates are the same, a mesh can be used to create Overlay Multcast Trees rooted on the sources wth the same data rate. Phase 2: Create a source-based Overlay Multcast Tree over the mesh that the source s data rate matches. We do applcaton-level admsson control, nsurng that no partcular lnk or path s overloaded. Our algorthm accommodates ether a shortest path or a spannng tree routng tree constructon. We use a load balancng heurstc based upon avodng paths for whch there s a large mbalance of utlzaton along specfc lnks. Phase 2 requres ths extra complexty because we are tryng to mnmze multple routng metrcs, ncludng delay, bottleneck bandwdth and overall tree cost. Durng constructon of source-based multcast tree, at each step, a largest data rate edge connectng an off-tree node to the partal tree s added to the tree. When a node decdes ts parent, t chooses the node connected wth the mesh lnk that has the least value of ( 1 ILBR( P m ˆ, mˆ )), where ILBR ( P ) m ˆ, mˆ (Independent Least-balanced Routng [11]) s defned as ILBR ( Pm ˆ, mˆ ) = z P z P ec m ˆ, mˆ ec mˆ, mˆ z z Excess capacty ecz at each lnk n the system s lnk z s defned as the bandwdth requrements of the smulaton connectons routed through the lnk as a percentage of total lnk capacty. Ths nformaton s obtanng usng standard network montorng and tracng tools. Only when the avalable bandwdth of the bottleneck lnk of the path between two group members supports the recever s data rate, the path s added to the overlay multcast tree. If a path s added to the overlay multcast tree, the avalable bandwdth of each lnk on the path s reduced by the recever s data rate. Each parent fed_comp keeps only the fed_comp wth the hghest data rate request among the chldren canddates as ts chldren. Ths condton s enforced by placng only one fed_comp n each doman. The algorthm shown below mplements fndng a mnmal cost spannng tree. Algorthm for routng overlay creaton

7 Let Mˆ be a group of fed_comps and ˆ Mˆ m be a multcast group member. Let L be a lst of frnge fed_comps. The status of mˆ Mˆ can be UNSEEN, FRINGE, and IN-TREE. UNSEEN means the node s never vsted, FRINGE means the node was vsted, and IN-TREE means the node s added to the multcast tree. Set the status of all ˆ Mˆ m to UNSEEN; Set source_node s status to IN_TREE; current_node = source_node; For all ˆ Mˆ m For all w node adacent to the current_node next_node = w ; If (next_node.status s UNSEEN) //admsson_control returns true f the avalable bandwdth of the //bottleneck lnk of the path from current_node to next_node s //greater than or equal to the next_node s data rate, otherwse //returns false. If (admsson_control(current_node, next_node) == true) next_node.status = FRINGE; next_node.cost = ILBR( ) ; 1 P current _ node, next _ node next_node.parent=current_node; Add next_node nto the lst of frnge node; If (next_node.status s FRINGE) new_cost = ILBR( ) ; 1 P current _ node, next _ node If (next_node.cost > new_cost)

8 //For release_path_bandwth(next_node.parent, next_node); If (admsson_control(current_node, next_node) == true) next_node.cost = new_cost; next_node.parent=current_node; else //reserve the bandwdth agan for the path between next_node //and ts parent. admsson_control(next_node.parent, next_node); If (the parent of next_node already has a chld whose data_rate s greater than that of next_node) release_path_bandwth(next_node.parent, next_node); If (admsson_control(current_node, next_node) == true) next_node.delay = new_delay; next_node.parent=current_node; else admsson_control(next_node.parent, next_node); If Add the off-tree node wth the largest data rate among the frnge nodes to the multcast tree (IN-TREE); current_node = the selected node; //end For Shortest Path based Heurstc Varant

9 Ths s smlar to the above Mnmum Spannng Tree-based algorthm. The dfference s that t uses the cost of the path from the source group member to another member to choose a parent of a node nstead of the cost ust between the parent_node and chld node to determne a parent_node of a node. We omt the detals because of space consderatons. Phase 3: Place serv_comps to adapt the data rate to users requests at the nodes on the overlay multcast tree that have the chldren whose requested data rates are smaller than the node s. Fnally, at the end of Phase 3, drect network connectons are nstantated between the fed_coms n the system, along wth connectons between any added serv_comps and ther assocated fed_coms. The result of the three phases of ths algorthm s drect transport level network connectons between fed_comps, the agents that control SRMP functonalty. Further, f as a result of Phase 3 addtonal serv_comps were added for data reducton, there are transport level connectons setup between these serv_comps and other fed_comps n the system. Recall that for data transfer all connectons use regular transport level protocols, not agent communcaton protocols. E. EVALUATION We have conducted an expermental evaluaton of our approach for constructng fed_comp nterconnecton patterns. We compare the performance of the Shortest Path-based heurstc and the Mnmum Spannng Tree-based heurstc wth the performance of IP Multcast, usng DVMRP, along wth pure uncast. We determne the IP Multcast tree based on the uncast paths from the source to each recever. The evaluaton metrcs for the performance of each algorthm ncludes the number of serv_comp agents needed to be placed for a smulaton, the average lnk stress, the worst lnk stress, the resource usage, the total bandwdth usage, and the relatve delay penalty (RDP) of each path. In reference [5], the stress of a physcal lnk s defned as the number of dentcal copes of a packet carred by a physcal lnk. For our evaluaton, the physcal lnk stress s rato of the number of packets that a lnk processed to the number of packets sent by all members. Resource usage s the sum of the product of the lnk stress and the lnk delay over all lnks used. We assume that lnks wth hgher delay values tend to be assocated wth hgher cost. The total bandwdth usage s the sum of all bandwdth reserved along the paths from all sources to all recevers. The resource usage and total bandwdth are metrcs to measure the network resources consumed n the process of data delvery to all recevers. RDP s the rato of the latency experenced when sendng data usng the overlay to the latency experenced when sendng data drectly usng the underlyng network. In our smulaton, all fed_comp agents send and receve packets. We created a separate source-based multcast tree for each member to send out packets to all other multcast group members n IP Multcast, the Shortest Path-based overlay heurstc and the Mnmum Spannng Tree-based heurstc. The admsson control s performed when a path s added to the multcast trees n IP Multcast, the shortest-tree-based heurstc and the mnmum-tree-based heurstc, and also for a path between the source and recever for uncast. A source-based tree s accepted only

10 when there s bandwdth enough to meet the data late requested by each member for all the paths from a source to all other multcast group members. Otherwse, the tree s reected. We used CSIM package to wrte the smulaton programs, and Georga Tech Internetwork Topology Models (GT-ITM) [12] to generate transt-stub graphs wth 100 nodes. The multcast group sze vares from 5, 10, 15, 20, 25, and 30. Notce that 30 group members mples that 30% of the routers are part of the group, whch s qute a hgh percentage compared to a typcal WAN scenaro. We ncluded ths worst case scenaro as a stress test for our approach. The members are unformly assgned to each node on the graph. We ran the smulaton program for each heurstc 30 tmes per group sze. Each tme, we used dfferent graph wth 100 nodes. We used the number for each lnk n the graph generated by GT-ITM as the lnk delay. The delay of the local lnk s randomly dstrbuted between 1 and 15. We used 1 Gbps for the bandwdth of the backbone lnks and 20 Mbps for the local lnk between the router and the end host. The data rates requested by the fed_comp members are randomly dstrbuted among 150 Kbps, 60 Kbps, and 20 Kbps. The frst set of results n Fgure 2 shows the effect of data rate reducton, by comparng the number of serv_comp agents placed n the two overlay technques to what would happen n IP Multcast. In the latter case, data reducng gateways are requred at the end-ponts of the IP multcast tree. Notce that ths comparson s not requred n uncast group sze IPMultcast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 2 The number of serv_comp Agents due to data reducton The averages are between 9.98 and for the Mnmum Spannng Tree-based heurstc, between and for the Shortest Path-based heurstc, and between and for IP Multcast at 95% confdence level. Notce that the overlay approach actually reduces the number of data-reducng agents requred over IP multcast, whch must be modfed to make ths type of ntellgent data reducton n the data path. Ths s a strong ndcaton that agent moblty s mportant. Fgure 3 shows average lnk stress. The averages are between and for IP Multcast, between 0.80 and 0.81 for the Mnmum Spannng Tree-based heurstc, between 0.99

11 and 1.0 for the Shortest Path-based heurstc, and between 1.05 and 1.07 for uncast at 95% confdence level group sze IPMultcast Uncast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 3 Average Lnk Stress Fgure 4 shows the maxmum, or worst case lnk stress for the scenaros. Ths gves us an ndcaton as to the mbalance of the varous approaches. The mnmum-spannng-based heurstc has the larger worst lnk stress than IP Multcast, but has smaller worst lnk stress than uncast. However, the Shortest Path-based heurstc has the larger worst lnk stress than IP Multcast and uncast. The fgure 3 shows the result group sze IPMultcast Uncast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 4 The Worst Lnk Stress

12 Fgure 5 shows the total bandwdth usage. The Shortest Path-based heurstc and the Mnmum Spannng Tree-based heurstc naturally both have larger total bandwdth usage than IP Multcast, but the smaller than uncast. The Mnmum Spannng Tree-based heurstc has the smaller total bandwdth usage than the Shortest Path-based heurstc. The results show that our approach scales n lnear fashon to the Multcast approach Kbps group sze IPMultcast Uncast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 5 Total Bandwdth Usage Fgure 6 shows the RDP. The Shortest Path-based heurstc has a smaller RDP than the Mnmum Spannng Tree-based heurstc. We used 1 for the RDP of uncast and IP Multcast. The RDP penalty for the Shortest Path heurstc s qute compettve as compared to IP multcast and uncast, ndcatng the vablty of our approach for tme senstve communcaton.

13 group sze IPMultcast Uncast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 6 Relatve Delay Penalty Fnally, Fgure 7 shows Resource Usage. The Mnmum Spannng Tree-based heurstc and the Shortest Path-based heurstc both have larger resource usage than IP Multcast, but smaller than uncast. Once agan, we see that our approach scales n lnear fashon group sze IPMultcast Uncast Shortest Path Heurstc Mn Spannng Tree Heurstc Fgure 7 Resource Usage In summary, we see that for moderate group szes, the overlay technques are wthn a factor of 2 as compared to IP multcast for expected delay, stress, resource usage and bandwdth usage. When group members approach 30% of the avalable network router sze, overlay technques are less effcent. However, n vrtually all cases the overlay technques outperform IP

14 multcast for number of requred data reducton agents. We observe that for networks where IP multcast s not avalable t s possble to stll obtan good network performance, expect n hghly saturated networks. Further, snce the end-host technques can make ntellgent use of packet rebroadcast, the number of data reducng agents requred s reduced n the overlay methods, as compared to IP multcast. E. CONCLUSIONS Ths paper descrbed an agent-based archtecture and nterconnecton strategy for a dstrbuted vrtual realty smulaton envronment. We frst dscussed a web-based ontology for three classes of agents requred to make a prevously deployed system compatble wth current work n Web Servces and the Semantc Web. We then descrbed how these agents ntalze and confgure themselves nto an nterconnecton pattern. We ntroduced a new algorthm for agent nterconnecton, nvolvng three separate phases. The outcome of the thrd phase nvolved settng up drect network connectons, and may also result n addtonal agents beng placed for purposes of data reducton. We expermentally evaluated our approach, usng two dfferent heurstcs, aganst IP Multcast and pure uncast. Expect n the crcumstances of extremely dense group membershp, our approach perform n a compettve fashon to IP multcast. Further, the ablty to place ntellgent agents for packet forwardng on end-hosts reduces the computatonal burden wthn the system.

15 F. REFERENCES [1] Agent Based Smulaton 2002: 3rd Agent Based Smulaton Workshop, Edted by Chrstopher Urban, Socety for Computer Smulaton, Aprl [2] S. Chandrasekaran, et. al., G, "Web Servce Technologes and ther Synergy wth Smulaton," Proceedngs of the 2002 Wnter Smulaton Conference (WSC'02), San Dego, Calforna (December 2002) pp [3] Y. Chu, S. Rao, and H. Zhang. A Case for End System Multcast, In Proceedngs of ACM Sgmetrcs, June [4] DAML: The DARPA Agent markup Language Homepage, avalable at [5] J. Hendler, Agents and the Semantc Web IEEE Intellgent Systems, March 2001, pp [6] S. Jan, et. al., A Comparson of Large-Scale Overlay Management Technques, Techncal Report UW-CSE , Computer Scence and Engneerng, Unversty of Washngton, [7] U. Ogbu, Usng WSDL n SOAP applcatons, avalable at 106.bm.com/developerworks/webservces/lbrary/ws-soap/ndex.html?dwzone=ws [8] S. A. McIlrath, D. L. Martn, Brngng Semantcs to Web Servces, IEEE Intellgent Systems, January/February 2003 (Vol. 18, No. 1) pp [9] Pullen, J.M, Smon, R., Khunboa, C., Parupall, M. and Brutzman, D., A Next- Generaton Internet Federaton Obect Model for the HLA, Sxth IEEE Internatonal Workshop on Dstrbuted Smulaton and Real Tme Applcatons (DSRT) October 2002, Fort Worth, Texas. [10] A.P. Sheth and John A. Mller, "Web Servces: Techncal Evoluton yet Practcal Revoluton?" IEEE Intellgent Systems (IEEEIS), Vol. 18, No. 1 (January-February 2003) pp IEEE Computer Socety Press. [11] R. Smon and A. Sood, Load-balanced Routng for Collaboratve Multmeda Communcaton, 6 th Internatonal Symposum for Hgh Performance Dstrbuted Computng (HPDC 97), August 1997, pp [12] M. Thomas and E. W. Zegura. "Generaton and Analyss of Random Graphs to Model Internetworks," Techncal Report GIT-CC-94-46, College of Computng, Georga Tech, [13] F. K., Weathery, R., and Dahmann, J., Creatng computer smulaton systems, Prentce Hall, New Jersey, 2000.

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, Gabrel-Mro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty

More information

A Dynamic Energy-Efficiency Mechanism for Data Center Networks

A Dynamic Energy-Efficiency Mechanism for Data Center Networks A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Network Aware Load-Balancing via Parallel VM Migration for Data Centers

Network Aware Load-Balancing via Parallel VM Migration for Data Centers Network Aware Load-Balancng va Parallel VM Mgraton for Data Centers Kun-Tng Chen 2, Chen Chen 12, Po-Hsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Politecnico di Torino. Porto Institutional Repository

Politecnico di Torino. Porto Institutional Repository Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A cost-effectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A cost-effectve

More information

Network-Wide Load Balancing Routing With Performance Guarantees

Network-Wide Load Balancing Routing With Performance Guarantees Network-Wde Load Balancng Routng Wth Performance Guarantees Kartk Gopalan Tz-cker Chueh Yow-Jan Ln Florda State Unversty Stony Brook Unversty Telcorda Research kartk@cs.fsu.edu chueh@cs.sunysb.edu yjln@research.telcorda.com

More information

A role based access in a hierarchical sensor network architecture to provide multilevel security

A role based access in a hierarchical sensor network architecture to provide multilevel security 1 A role based access n a herarchcal sensor network archtecture to provde multlevel securty Bswajt Panja a Sanjay Kumar Madra b and Bharat Bhargava c a Department of Computer Scenc Morehead State Unversty

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

A New Paradigm for Load Balancing in Wireless Mesh Networks

A New Paradigm for Load Balancing in Wireless Mesh Networks A New Paradgm for Load Balancng n Wreless Mesh Networks Abstract: Obtanng maxmum throughput across a network or a mesh through optmal load balancng s known to be an NP-hard problem. Desgnng effcent load

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

Scalability of a Mobile Cloud Management System

Scalability of a Mobile Cloud Management System Scalablty of a Moble Cloud Management System Roberto Bfulco Unversty of Napol Federco II roberto.bfulco2@unna.t Marcus Brunner NEC Laboratores Europe brunner@neclab.eu Peer Hasselmeyer NEC Laboratores

More information

Resource Scheduling in Desktop Grid by Grid-JQA

Resource Scheduling in Desktop Grid by Grid-JQA The 3rd Internatonal Conference on Grd and Pervasve Computng - Worshops esource Schedulng n Destop Grd by Grd-JQA L. Mohammad Khanl M. Analou Assstant professor Assstant professor C.S. Dept.Tabrz Unversty

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Reinforcement Learning for Quality of Service in Mobile Ad Hoc Network (MANET)

Reinforcement Learning for Quality of Service in Mobile Ad Hoc Network (MANET) Renforcement Learnng for Qualty of Servce n Moble Ad Hoc Network (MANET) *T.KUMANAN AND **K.DURAISWAMY *Meenaksh College of Engneerng West K.K Nagar, Cheena-78 **Dean/academc,K.S.R College of Technology,Truchengode

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1 Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,

More information

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks PP/ Grd-based Overlay Archtecture to Support VoIP Servces n Large Scale IP Networks We Yu *, Srram Chellappan # and Dong Xuan # * Dept. of Computer Scence, Texas A&M Unversty, U.S.A. {weyu}@cs.tamu.edu

More information

Overview of monitoring and evaluation

Overview of monitoring and evaluation 540 Toolkt to Combat Traffckng n Persons Tool 10.1 Overvew of montorng and evaluaton Overvew Ths tool brefly descrbes both montorng and evaluaton, and the dstncton between the two. What s montorng? Montorng

More information

Multi-Source Video Multicast in Peer-to-Peer Networks

Multi-Source Video Multicast in Peer-to-Peer Networks ult-source Vdeo ultcast n Peer-to-Peer Networks Francsco de Asís López-Fuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika. VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group - Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;

More information

Network Security Situation Evaluation Method for Distributed Denial of Service

Network Security Situation Evaluation Method for Distributed Denial of Service Network Securty Stuaton Evaluaton Method for Dstrbuted Denal of Servce Jn Q,2, Cu YMn,2, Huang MnHuan,2, Kuang XaoHu,2, TangHong,2 ) Scence and Technology on Informaton System Securty Laboratory, Bejng,

More information

Optimization of network mesh topologies and link capacities for congestion relief

Optimization of network mesh topologies and link capacities for congestion relief Optmzaton of networ mesh topologes and ln capactes for congeston relef D. de Vllers * J.M. Hattngh School of Computer-, Statstcal- and Mathematcal Scences Potchefstroom Unversty for CHE * E-mal: rwddv@pu.ac.za

More information

Complex Service Provisioning in Collaborative Cloud Markets

Complex Service Provisioning in Collaborative Cloud Markets Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European

More information

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems 1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The

More information

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing

A Novel Problem-solving Metric for Future Internet Routing Based on Virtualization and Cloud-computing www.ijcsi.org 159 A Novel Problem-solvng Metrc for Future Internet Routng Based on Vrtualzaton and Cloud-computng Rujuan Zheng, Mngchuan Zhang, Qngtao Wu, Wangyang We and Haxa Zhao Electronc & Informaton

More information

Load Balancing By Max-Min Algorithm in Private Cloud Environment

Load Balancing By Max-Min Algorithm in Private Cloud Environment Internatonal Journal of Scence and Research (IJSR ISSN (Onlne: 2319-7064 Index Coperncus Value (2013: 6.14 Impact Factor (2013: 4.438 Load Balancng By Max-Mn Algorthm n Prvate Cloud Envronment S M S Suntharam

More information

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines DBA-VM: Dynamc Bandwdth Allocator for Vrtual Machnes Ahmed Amamou, Manel Bourguba, Kamel Haddadou and Guy Pujolle LIP6, Perre & Mare Cure Unversty, 4 Place Jusseu 755 Pars, France Gand SAS, 65 Boulevard

More information

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Formulating & Solving Integer Problems Chapter 11 289

Formulating & Solving Integer Problems Chapter 11 289 Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng

More information

Genetic Algorithm Based Optimization Model for Reliable Data Storage in Cloud Environment

Genetic Algorithm Based Optimization Model for Reliable Data Storage in Cloud Environment Advanced Scence and Technology Letters, pp.74-79 http://dx.do.org/10.14257/astl.2014.50.12 Genetc Algorthm Based Optmzaton Model for Relable Data Storage n Cloud Envronment Feng Lu 1,2,3, Hatao Wu 1,3,

More information

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn

More information

THE deployment of IEEE 802.11 wireless networks

THE deployment of IEEE 802.11 wireless networks IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. X, NO. X, XXX 2008 1 Passve Onlne Detecton of 802.11 Traffc Usng Sequental Hypothess Testng wth TCP ACK-Pars We We, Member, IEEE, Kyoungwon Suh, Member, IEEE,

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

Design and Development of a Security Evaluation Platform Based on International Standards

Design and Development of a Security Evaluation Platform Based on International Standards Internatonal Journal of Informatcs Socety, VOL.5, NO.2 (203) 7-80 7 Desgn and Development of a Securty Evaluaton Platform Based on Internatonal Standards Yuj Takahash and Yoshm Teshgawara Graduate School

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

Dynamic Resource Allocation and Power Management in Virtualized Data Centers

Dynamic Resource Allocation and Power Management in Virtualized Data Centers Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabs-usa.com, mjneely@usc.edu

More information

Conferencing protocols and Petri net analysis

Conferencing protocols and Petri net analysis Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre

More information

Sangam - Efficient Cellular-WiFi CDN-P2P Group Framework for File Sharing Service

Sangam - Efficient Cellular-WiFi CDN-P2P Group Framework for File Sharing Service Sangam - Effcent Cellular-WF CDN-P2P Group Framework for Fle Sharng Servce Anjal Srdhar Unversty of Illnos, Urbana-Champagn Urbana, USA srdhar3@llnos.edu Klara Nahrstedt Unversty of Illnos, Urbana-Champagn

More information

Lecture 7 March 20, 2002

Lecture 7 March 20, 2002 MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

A Parallel Architecture for Stateful Intrusion Detection in High Traffic Networks

A Parallel Architecture for Stateful Intrusion Detection in High Traffic Networks A Parallel Archtecture for Stateful Intruson Detecton n Hgh Traffc Networks Mchele Colajann Mrco Marchett Dpartmento d Ingegnera dell Informazone Unversty of Modena {colajann, marchett.mrco}@unmore.t Abstract

More information

A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analysis of View Maintenance Techniques for Data Warehouses A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

More information

Methodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications

Methodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

An ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures

An ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures An ILP Formulaton for Task Mappng and Schedulng on Mult-core Archtectures Yng Y, We Han, Xn Zhao, Ahmet T. Erdogan and Tughrul Arslan Unversty of Ednburgh, The Kng's Buldngs, Mayfeld Road, Ednburgh, EH9

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

Some literature also use the term Process Control

Some literature also use the term Process Control A Formal Approach for Internal Controls Complance n Busness Processes Koumars Namr 1, Nenad Stojanovc 2 1 SAP Research Center CEC Karlsruhe, SAP AG, Vncenz-Preßntz-Str.1 76131 Karlsruhe, Germany Koumars.Namr@sap.com

More information

Chapter 3: Dual-bandwidth Data Path and BOCP Design

Chapter 3: Dual-bandwidth Data Path and BOCP Design Chater 3: Dual-bandwdth Data Path and BOCP Desgn 3. Introducton The focus of ths thess s on the 4G wreless moble Internet networks to rovde data servces wthn the overlang areas of CDA2000-WLA networks.

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

Network Services Definition and Deployment in a Differentiated Services Architecture

Network Services Definition and Deployment in a Differentiated Services Architecture etwork Servces Defnton and Deployment n a Dfferentated Servces Archtecture E. kolouzou, S. Manats, P. Sampatakos,. Tsetsekas, I. S. Veners atonal Techncal Unversty of Athens, Department of Electrcal and

More information

Auditing Cloud Service Level Agreement on VM CPU Speed

Auditing Cloud Service Level Agreement on VM CPU Speed Audtng Cloud Servce Level Agreement on VM CPU Speed Ryan Houlhan, aojang Du, Chu C. Tan, Je Wu Department of Computer and Informaton Scences Temple Unversty Phladelpha, PA 19122, USA Emal: {ryan.houlhan,

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS Shanthy Menezes 1 and S. Venkatesan 2 1 Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX, USA 1 shanthy.menezes@student.utdallas.edu

More information

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014

More information

QoS-Aware Active Queue Management for Multimedia Services over the Internet

QoS-Aware Active Queue Management for Multimedia Services over the Internet QoS-Aware Actve Queue Management for Multmeda Servces over the Internet I-Shyan Hwang, *Bor-Junn Hwang, Pen-Mng Chang, Cheng-Yu Wang Abstract Recently, the multmeda servces such as IPTV, vdeo conference

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Cloud-based Social Application Deployment using Local Processing and Global Distribution

Cloud-based Social Application Deployment using Local Processing and Global Distribution Cloud-based Socal Applcaton Deployment usng Local Processng and Global Dstrbuton Zh Wang *, Baochun L, Lfeng Sun *, and Shqang Yang * * Bejng Key Laboratory of Networked Multmeda Department of Computer

More information

METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS

METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng

More information

Distributed Optimal Contention Window Control for Elastic Traffic in Wireless LANs

Distributed Optimal Contention Window Control for Elastic Traffic in Wireless LANs Dstrbuted Optmal Contenton Wndow Control for Elastc Traffc n Wreless LANs Yalng Yang, Jun Wang and Robn Kravets Unversty of Illnos at Urbana-Champagn { yyang8, junwang3, rhk@cs.uuc.edu} Abstract Ths paper

More information

Virtual Network Embedding with Coordinated Node and Link Mapping

Virtual Network Embedding with Coordinated Node and Link Mapping Vrtual Network Embeddng wth Coordnated Node and Lnk Mappng N. M. Mosharaf Kabr Chowdhury Cherton School of Computer Scence Unversty of Waterloo Waterloo, Canada Emal: nmmkchow@uwaterloo.ca Muntasr Rahan

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst

More information

A Passive Network Measurement-based Traffic Control Algorithm in Gateway of. P2P Systems

A Passive Network Measurement-based Traffic Control Algorithm in Gateway of. P2P Systems roceedngs of the 7th World Congress The Internatonal Federaton of Automatc Control A assve Network Measurement-based Traffc Control Algorthm n Gateway of 2 Systems Ybo Jang, Weje Chen, Janwe Zheng, Wanlang

More information

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints Effectve Network Defense Strateges aganst Malcous Attacks wth Varous Defense Mechansms under Qualty of Servce Constrants Frank Yeong-Sung Ln Department of Informaton Natonal Tawan Unversty Tape, Tawan,

More information

J. Parallel Distrib. Comput. Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers

J. Parallel Distrib. Comput. Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronment-conscous schedulng of HPC applcatons

More information

Dynamic Scheduling of Emergency Department Resources

Dynamic Scheduling of Emergency Department Resources Dynamc Schedulng of Emergency Department Resources Junchao Xao Laboratory for Internet Software Technologes, Insttute of Software, Chnese Academy of Scences P.O.Box 8718, No. 4 South Fourth Street, Zhong

More information

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks

Energy Efficient Routing in Ad Hoc Disaster Recovery Networks Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l

More information

Peer-to-Peer Networks Protocols, Cooperation and Competition

Peer-to-Peer Networks Protocols, Cooperation and Competition Peer-to-Peer Networks Protocols, Cooperaton and Competton Hyunggon Park Sgnal Processng Laboratory (LTS4), Insttute of Electrcal Engneerng, Swss Federal Insttute of Technology (EPFL), Lausanne, Swtzerland

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

Abteilung für Stadt- und Regionalentwicklung Department of Urban and Regional Development

Abteilung für Stadt- und Regionalentwicklung Department of Urban and Regional Development Abtelung für Stadt- und Regonalentwcklung Department of Urban and Regonal Development Gunther Maer, Alexander Kaufmann The Development of Computer Networks Frst Results from a Mcroeconomc Model SRE-Dscusson

More information

A CAVALIER Architecture for Metro Data Center Networking

A CAVALIER Architecture for Metro Data Center Networking A CAVALIER Archtecture for Metro Data Center Networkng Akhl Lodha,, Ashwn Gumaste, Abstract: Data Center Networkng (DCNs) s a fast emergng enterprse applcaton that s drvng metropoltan bandwdth needs. Ths

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution

A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution A Cluster Based Replcaton Archtecture for Load Balancng n Peer-to-Peer Content Dstrbuton S.Ayyasamy 1 and S.N. Svanandam 2 1 Asst. Professor, Department of Informaton Technology, Tamlnadu College of Engneerng

More information

EVALUATING THE PERCEIVED QUALITY OF INFRASTRUCTURE-LESS VOIP. Kun-chan Lan and Tsung-hsun Wu

EVALUATING THE PERCEIVED QUALITY OF INFRASTRUCTURE-LESS VOIP. Kun-chan Lan and Tsung-hsun Wu EVALUATING THE PERCEIVED QUALITY OF INFRASTRUCTURE-LESS VOIP Kun-chan Lan and Tsung-hsun Wu Natonal Cheng Kung Unversty klan@cse.ncku.edu.tw, ryan@cse.ncku.edu.tw ABSTRACT Voce over IP (VoIP) s one of

More information