Accommodations of QoS DiffServ Over IP and MPLS Networks

Size: px
Start display at page:

Download "Accommodations of QoS DiffServ Over IP and MPLS Networks"

Transcription

1 Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering Eole de Tehnologie Superieure Conordia University Universite du Quebe 455 de Maisonneuve Blvd. W. MONTREAL, CANADA MONTREAL, Canada (HG M8) Abstrat:- Multiasting has beome inreasingly important with the emergene of Internet-based appliations suh IP telephony, audio/video onferening, distributed databases and software upgrading. IP Multiasting is an effiient way to distribute information from a single soure to multiple destinations at different loations. In pratie IP is onsidered as a layer protool. Multiprotool label Swithing (MPLS) replaes the IP forwarding by a simple label lookup. MPLS ombines the flexibility of layer routing and layer swithing. In this paper, we present a new fair share poliy (FSP) that implements Differentiated Servies to solve the problems of QoS and ongestion ontrol when multiasting is used. Analysis tools are used to evaluate our new fair share poliy (FSP) for different senarios. The results should provide insights for the omparisons between IP multiast in MPLS networks using FSP and plain IP multiasting using the same poliy when DiffServ are adopted. Key-Words: Multiast, IP, MPLS, DiffServ, QoS. Introdution Multiasting has been at the enter of interest in the area of Internet ativities and has already ontributed to some major suesses. IP Multiast supports group ommuniations by enabling soures to send a single opy of a message to multiple reipients at different loations who expliitly want to reeive the information []. With the huge inrease demand for bandwidth, one of the hallenges the Internet is faing today is to keep the paket forwarding performane up. Reent developments in Multiprotool label Swithing (MPLS) open new possibilities to address some of limitations of IP systems. MPLS is an Internet Engineering Task Fore (IETF) standard []. It replaes the IP forwarding by a simple label lookup mehanism. MPLS ombines the flexibility of layer (L) routing and layer (L) swithing, whih enhanes network performane in terms of salability, omputational omplexity, lateny and ontrol message overhead. Besides this, MPLS offers a vehile for enhaned network servies suh as Quality of Servies (QoS)/ Class of Servie (CoS), Traffi Engineering and Virtual Private Networks (VPNs). IP multiast in MPLS networks is still an open issue [-4]. On the other hand, the IETF DiffServ working group is looking at a more salable model and more likely to be easier to implement than IntServ/RSVP model [5]. In the DiffServ arhiteture, traffi that requires the same Per-Hop-Behavior (PHB) is aggregated into a single queue. The DiffServ arhiteture fouses on the use of DiffServ (DS) byte, whih is the redefined 8-bit Type of Servie (TOS) field in the IPv4 header or the IPv6 Traffi Class otet as a QoS mehanism. are lassified into the orresponding queues using their DiffServ Code Points (DSCP). use DSCP bits in order to reeive a partiular PHB, or forwarding treatment. Marking, lassifiation, traffi onditioning or poliing are done at network This work was supported by a CRD grant from NSERC/BELL Canada

2 boundaries (first router for example) and paket treatment and handling is arried on eah network node [6]. It would be interesting to ompare QoS performane of IP and MPLS multiasting, given their partiular onstraints. In regular IP multiasting only overhead pertaining to IP multiast tree should be established, while in MPLS multiasting we have to add also the orresponding MPLS multiast tree establishment times and ontrol pakets. In this paper and taking all the above onstraints into onsideration, we evaluate the QoS performane for a typial router in the two ases of IP and MPLS multiasting. We also onsider Differentiated Servies; i.e. traffis with different priority lasses. Fair Share Poliy (FSP) FSP is not a all admission rather it is a traffi poliing mehanism. In FSP, pakets are disarded in ase of ongestion differently at eah queue aording to soure priority and the maximum number in the queue; i.e. the soure with higher priority will experiene less paket disarding than soures with lower priorities. FSP guarantees fairness among flows having the same priority (i.e., required QoS) in two respets: Firstly the buffer spae alloated to lower priority traffi is larger; thus leading to less paket disard. Seondly by seletive paket disarding on pakets from the same flow and making sure that the total number of pakets disarded per flow is the same for all flows with the same QOS requirement. In this paper, we only explore the first fairness mehanism. The Analytial Model Our analytial model is shown in Fig.. In this model, a typial IP or MPLS router and our FSP traffi poliing mehanism proess three independent soures orresponding to different input traffi lasses. Soure is assigned the highest priority, then soure and finally soure. For this model, the enforement is assumed to our at the router (node) aording to Fair Share Poliy. The following assumptions are used: - Assume a Bernoulli arrival for all soures; in order to be short and disrete inter-arrivals. - FSP uses non pre-emptive priority queuing. - The arrival probabilities are, and for eah soure respetively. Note that represents the probability of reeiving a paket while one paket is served on the hannel. 4- Servie disiplines for different queues are β, β and β for eah soure respetively. 5- Average queue sizes are n, n and n for eah soure respetively. 6- Maximum buffer sizes are nmax, n max and n max for eah soure respetively. 7- Total system buffer size: B = n max + n max + n max, where n imax and i =,, is alulated as: n n n max = (( )*B), n (( max= *B)) n + n + n n + n + n n and n max = (( )*B) n+ n+ n 8- All of MPLS or IP routers on the subjet Internet are homogeneous in providing resoure and traffi onditions, so we take one of them as a representive for IP routers and the other one as a representaive for MPLS routers. 9- All pakets are of the same length. Soure Soure Soure Arriving Dropped Arriving Dropped Arriving Dropped Input Buffer FSP Input Buffer FSP Input Buffer FSP Priority assignment. for Soure. for Soure for Soure Fig. The analytial model Node Departing P

3 . The Coupled State Diagrams The oupled state diagrams for the analytial model in Fig. are shown in Fig.. This diagram represents a typial router with priority lasses. The solution of the number in every lass depends on the solutions of the other lasses.; where β = always in order to give soure with highest priority the best servie probability, β ; i.e. pakets from = P soure will be served only when the buffer orresponding to soure (whih has higher priority) is empty and finally β P = P ; i.e. pakets from soure top of IP layer), is the extra arrival probability due to IP ontrol overhead used to establish the IP multiast tree. The above equation an be rewritten in terms of as: = τ + = where is where is a fator. Similarly for MPLS based networks, an be written as: = + + Where and are the same as in the ase of IP networks; is the extra arrival probability due MPLS ontrol overhead used to establish MPLS multiast paths or tree. an be rewritten in terms of as: ( = + + ) = where is a fator.. Solution of the Analytial Model By writing the balane equations for the state diagram in Fig. [7], and solving these equations by iteration to find the probabilities. In order to write the equations in simpler forms we define: λ = ( P, β) = ( )P β and σ = P β + ( )( P β) () Fig. The Coupled State Diagram will be served only when the buffers orresponding to soure and soure (whih have higher priority) are all empty. P is the probability that reflets the omulative effets of hannel error and ongestion of next router (i.e. the probability of no loss or errors on the hannel). Paket loss probability for eah soure an be obtained by alulating the probability to be in last stage in the state diagram Pnmax, Pnmax and P nmax respetively. For IP based networks, the soure arrival probability is atually a ompsite one; for instane (for soure ) an be written as: + = τ +, τ = Where is the proessing time at lower layers (for example MAC layer) and is the proessing time at IP layer, is the intrinsi arrival probability at the appliation layer (on To find a speifi probability P i : σ λ P i = P i P i Where i=,4 nmax. () Notie that P = ( ) P () σ and P = P P (4) P i an be rewritten in the following form: P i = (ai + bi ) P (5) where i=,4 nmax; and nmax is a speifi soure maximum buffer size. σ λ ai = ( ai ai ) (6) ( σ) Where a = a = and a = σ λ b ( b b ) (7) i = i i λ Where b = b = b = and b = nmax Taking into aount that: P i = i =

4 P an be found using the following: P = nmax (8) + (a i + b i ) i = then any probability an be found in terms of P as in equation (5). The average number of pakets in the buffer for a speifi soure an be found as: n = nmax i * P i (9) i = Notie that the loss probability is equal to the probability to be in last stage of state diagram; for example the loss probability for soure is: P L = P nmax. 4. Analysis Results Fig. shows the average number of pakets in the system buffer versus for all soures for both IP and MPLS. The figure shows that IP and MPLS will have very similar average number of pakets espeially for low priority traffi and when the intrinsi arrival rates are relatively high. Note that the value of τ is relatively small in whih we assumed that the differene in paket proessing between IP and MPLS is small. Average number of pakets Average number of pakets in the buffer for all soures for both IP and MPLS,5,,5,,5, =., =., =.5,β =, P =.8, B =, =., τ =. Fig. Average number of pakets in the buffer for all soures for both IP and MPLS (small τ) Fig.4 shows the paket loss probability for all soures for both IP and MPLS versus for relatively high intrinsi arrival rates and small τ. It shows that IP and MPLS have almost the same loss probability, IP IP MPLS MPLS exept a small differene for soure ; and as inreases the differene beomes even smaller. Paket loss probability,9,8,7,6,5,4,,, Paket loss probability for all soures for both IP and MPLS,5,,5,,5, Fig.4 Paket loss probability for all soures for both IP and MPLS (small τ) However, Figs.5 and 6 show that when τ inreases MPLS will have superiority over IP in terms of average number of pakets in the system buffer and paket loss probability. As shown in Fig. 5, the average number of pakets in the system buffer in the ase of MPLS is less than IP for all soures and this differene is lear for low priority soures and. Fig. 6 shows that the paket loss probability in the ase of MPLS is less than IP for all soures. This means when the differene in paket proessing τ between MPLS and IP inreases, MPLS will be better. Average number of pakets Fig.5 Average number of pakets in the buffer for all soures for both IP and MPLS (large τ) IP IP MPLS MPLS =., =., =.5,β =, P =.8, B =, =., τ = Average number of pakets in the buffer for all soures for both IP and MPLS,5,,5,,5, IP IP MPLS MPLS =., =., =.5, β =, P =.8, B =, =., τ =.8

5 Paket loss probability,,8,6,4, Paket loss probability for all soures for both IP and MPLS,5,,5,,5, Fig.6 Paket loss probability for all soures for both IP and MPLS (large τ) In the previous figures, 4, 5 and 6 was onstant and relatively small; that s why MPLS performane was better or very similar to IP performane. However, in the next figures we will study the effets of on MPLS performane. Figs. 7 and 8 show that IP will have superiority over MPLS when inreases espeially for soures and. As shown in Fig.7, the average number of pakets in the system buffer in the ase of IP (whih is onstant) is less than MPLS. Average number of pakets =., =., =.5, β =, P =.8, B =, =., τ= Average number of pakets in the buffer for all soures for both IP and MPLS,,4,6,8,, Fig.7 Average number of pakets for all soures for both IP and MPLS (Effet of ) Similarly, Fig. 8 shows that paket loss probability in the ase of IP (whih is IP IP MPLS MPLS IP IP MPLS MPLS =., =.5, =., β =, P =.8, B =, =., τ =. onstant) is less than MPLS. This means when the extra arrival rate due MPLS ontrol overhead used to establish MPLS multiast paths or tree inreases, IP will be perform better. Paket loss probability Paket loss probability for all soures for both IP and MPLS,,8,6,4,,,4,6,8,, IP IP MPLS MPLS Fig.8 Paket loss probability for all soures for both IP and MPLS (effet of ) 5. Conlusions and Future Work In this paper, a omparison between IP multiast sessions and MPLS multiast sessions is arried using analysis tools. In addition to that a new Fair Share Poliy (FSP), whih is a traffi poliing mehanism is proposed to ensure proper QoS. Also, Differentiated Servies are used in this omparison. In this paper, we found that when the differene in paket proessing time between IP and MPLS is high, IP multiast will perform less effiiently than MPLS in terms of average number of pakets in the system buffer and loss probability. However, when this differene is small, IP performs very similar to MPLS. In addition to that when MPLS have higher arrival rate due MPLS trees establishment ontrol overhead, it would perform worst than IP. Taking the same values of and for all priority lasses; impliitly assumes a shared tree. In the near future different values for and for different priority lasses (soure trees) an be assumed. Also, in the oming future, ARQ/FEC an be implemented in our analytial model or similar model to ensure a guaranteed delivery of multiast pakets. =., =.5, =., β =, P =.8, B =, =., τ =.

6 Referenes: [] B. Quinn et all, " IP Multiast Appliations: Challenges and Solutions ", RFC 7, September ; [] E. Rosen, A. Viswanathan and R. Callon," Multiprotool Label Swithing Arhiteture ", RFC, January ; [] D. Ooms et all, " Framework for IP multiast in MPLS ", IETF Draft, draft-ietfmpls-multiast-7.txt, January. [4] D. Ooms and W. Livens, " IP Multiast in MPLS Networks ", Proeedings of the IEEE Conferene on High Performane Swithing and Routing, June, pp. 5. [5] J. Wroklawski, " The Use of RSVP with IETF Integrated Servies ", RFC, September 997; [6] M. Carlson et al., " An Arhiteure for Differentiated Servies ", RFC 475, Deember 998; [7] T. Saadawi, M. Ammar and A. Elhakeem, " Fundamentals of Teleommuniation Networks ", New York, NY: John Wiley & Sons In

Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks

Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks Information Processing Letters 90 (004) 73 80 www.elsevier.com/locate/ipl Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks Abdullah AlWehaibi a,, Michael Kadoch

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Performance Benchmarks for an Interactive Video-on-Demand System

Performance Benchmarks for an Interactive Video-on-Demand System Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department

More information

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC

THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC THROUGHPUT EVALUATION OF AN ASYMMETRICAL FDDI TOKEN RING NETWORK WITH MULTIPLE CLASSES OF TRAFFIC Priya N. Werahera and Anura P. Jayasumana Department of Eletrial Engineering Colorado State University

More information

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Announcements. Lecture Caching Issues for Multi-core Processors. Shared Vs. Private Caches for Small-scale Multi-core

Announcements. Lecture Caching Issues for Multi-core Processors. Shared Vs. Private Caches for Small-scale Multi-core Announements Your fous should be on the lass projet now Leture 17: Cahing Issues for Multi-ore Proessors This week: status update and meeting A short presentation on: projet desription (problem, importane,

More information

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks 62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

Batch Auditing for Multiclient Data in Multicloud Storage

Batch Auditing for Multiclient Data in Multicloud Storage Advaned Siene and Tehnology Letters, pp.67-73 http://dx.doi.org/0.4257/astl.204.50. Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming User-level Fairness Delivered: Network Resoure Alloation for Adaptive Video Streaming Mu Mu, Steven Simpson, Arsham Farshad, Qiang Ni, Niholas Rae Shool of Computing and Communiations, Lanaster University

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

New Channel Allocation Techniques for Power Efficient WiFi Networks

New Channel Allocation Techniques for Power Efficient WiFi Networks ew Channel Alloation Tehniques for Power Effiient WiFi etworks V. Miliotis, A. Apostolaras, T. Korakis, Z. Tao and L. Tassiulas Computer & Communiations Engineering Dept. University of Thessaly Centre

More information

Multi-Channel Wireless Networks: Capacity and Protocols

Multi-Channel Wireless Networks: Capacity and Protocols Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Episode 12: TCP/IP & UbiComp

Episode 12: TCP/IP & UbiComp Episode 12: TCP/IP & UbiComp Hannes Frey and Peter Sturm University of Trier Outline Introdution Mobile IP TCP and Mobility Conlusion Referenes [1] James D. Solomon, Mobile IP: The Unplugged, Prentie Hall,

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay DoS-Resistant Broadast Authentiation Protool with Low End-to-end Delay Ying Huang, Wenbo He and Klara Nahrstedt {huang, wenbohe, klara}@s.uiu.edu Department of Computer Siene University of Illinois at

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

IN structured P2P overlay networks, each node and file key

IN structured P2P overlay networks, each node and file key 242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 Elasti Routing Table with Provable Performane for Congestion Control in DHT Networks Haiying Shen, Member, IEEE,

More information

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks

Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless

More information

We don t need no generation - a practical approach to sliding window RLNC

We don t need no generation - a practical approach to sliding window RLNC We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,

More information

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks

Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Hoc Wireless Networks Using Game Theory and Bayesian Networks to Optimize Cooperation in Ad Ho Wireless Networks Giorgio Quer, Federio Librino, Lua Canzian, Leonardo Badia, Mihele Zorzi, University of California San Diego La

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

Cluster-based Cooperative Communication with Network Coding in Wireless Networks

Cluster-based Cooperative Communication with Network Coding in Wireless Networks Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu

More information

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters

Distributed Resource Allocation Strategies for Achieving Quality of Service in Server Clusters Proeedings of the 45th IEEE Conferene on Deision & Control Manhester Grand Hyatt Hotel an Diego, CA, UA, Deember 13-15, 2006 Distributed Resoure Alloation trategies for Ahieving Quality of ervie in erver

More information

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon

Fast Distribution of Replicated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon ACEEE Int. J. on Information Tehnology, Vol. 3, No. 2, June 2013 Fast Distribution of Repliated Content to Multi- Homed Clients Mohammad Malli Arab Open University, Beirut, Lebanon Email: mmalli@aou.edu.lb

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems

Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,

More information

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams

Intra- and Inter-Stream Synchronisation for Stored Multimedia Streams IEEE International Conferene on Multimedia Computing & Systems, June 17-23, 1996, in Hiroshima, Japan, p 372-381 Intra- and Inter-Stream Synhronisation for Stored Multimedia Streams Ernst Biersak, Werner

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese

More information

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of

More information

Acoustic Links. Maximizing Channel Utilization for Underwater

Acoustic Links. Maximizing Channel Utilization for Underwater Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it

More information

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of

More information

Making Light Work of the Future IP Network

Making Light Work of the Future IP Network Making Light Work of the Future IP Network HPSR 2002, Kobe Japan, May 28, 2002 Ken-ihi Sato NTT Network Innovation Laboratories Transmission apaity inrease has been signifiant sine the introdution of optial

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Tackling IPv6 Address Scalability from the Root

Tackling IPv6 Address Scalability from the Root Takling IPv6 Address Salability from the Root Mei Wang Ashish Goel Balaji Prabhakar Stanford University {wmei, ashishg, balaji}@stanford.edu ABSTRACT Internet address alloation shemes have a huge impat

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

Detection of RF interference to GPS using day-to-day C/No differences

Detection of RF interference to GPS using day-to-day C/No differences 1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster

More information

Fine-Grained Capabilities for Flooding DDoS Defense Using Client Reputations

Fine-Grained Capabilities for Flooding DDoS Defense Using Client Reputations Fine-Grained Capabilities for Flooding DDoS Defense Using Client Reputations ABSTRACT Maitreya Natu University of Delaware 103 Smith Hall Newark, DE 19716, USA natu@is.udel.edu Reently proposed apability

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

Dynamic Backlight Adaptation for Low Power Handheld Devices 1

Dynamic Backlight Adaptation for Low Power Handheld Devices 1 Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

Implementing Load-Balanced Switches With Fat-Tree Networks

Implementing Load-Balanced Switches With Fat-Tree Networks Implementing Load-Balaned Swithes With Fat-Tree Networks Hung-Shih Chueh, Ching-Min Lien, Cheng-Shang Chang, Jay Cheng, and Duan-Shin Lee Department of Eletrial Engineering & Institute of Communiations

More information

On Dynamic Server Provisioning in Multi-channel P2P Live Streaming

On Dynamic Server Provisioning in Multi-channel P2P Live Streaming On Dynami Server Provisioning in Multi-hannel P2P Live Streaming Chuan Wu Baohun Li Shuqiao Zhao Department of Computer Siene Department of Eletrial Multimedia Development Group The University of Hong

More information

An Approach to Physics Based Surrogate Model Development for Application with IDPSA

An Approach to Physics Based Surrogate Model Development for Application with IDPSA An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute

More information

PROJECT PERIODIC REPORT

PROJECT PERIODIC REPORT FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise

More information

CA Identity Suite 14.x Implementation Proven Professional Exam (CAT-760) Study Guide Version 1.1

CA Identity Suite 14.x Implementation Proven Professional Exam (CAT-760) Study Guide Version 1.1 Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,

More information

Basics (cont.) Characteristics of data communication technologies OSI-Model

Basics (cont.) Characteristics of data communication technologies OSI-Model 48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49

More information

Z8530 Programming Guide

Z8530 Programming Guide Z8530 Programming Guide Alan Cox alan@redhat.om Z8530 Programming Guide by Alan Cox Copyright 2000 by Alan Cox This doumentation is free software; you an redistribute it and/or modify it under the terms

More information

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst XML Stream Proessing Yanlei Diao University of Massahusetts Amherst XML Data Streams XML is the wire format for data exhanged online. Purhase orders http://www.oasis-open.org/ommittees/t_home.php?wg_abbrev=ubl

More information

Preliminary investigation of multi-wavelet denoising in partial discharge detection

Preliminary investigation of multi-wavelet denoising in partial discharge detection Preliminary investigation of multi-wavelet denoising in partial disharge detetion QIAN YONG Department of Eletrial Engineering Shanghai Jiaotong University 8#, Donghuan Road, Minhang distrit, Shanghai

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

Cluster-Based Cumulative Ensembles

Cluster-Based Cumulative Ensembles Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,

More information

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs)

SINR-based Network Selection for Optimization in Heterogeneous Wireless Networks (HWNs) 48 J. ICT Res. Appl., Vol. 9, No., 5, 48-6 SINR-based Network Seletion for Optimization in Heterogeneous Wireless Networks (HWNs) Abubakar M. Miyim, Mahamod Ismail & Rosdiadee Nordin Department of Eletrial,

More information

LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement

LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, TPDS-179-5 1 LRED: A Robust and Responsive AQM Algorithm Using Paket Loss Ratio Measurement Chonggang Wang, Member, IEEE, Jianghuan Liu, Member, IEEE,

More information

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel

More information

The influence of QoS routing on the achievable capacity in TDMA based Ad hoc wireless networks

The influence of QoS routing on the achievable capacity in TDMA based Ad hoc wireless networks Wireless Netw () 6:9 DOI.7/s76-8-- The influene of QoS routing on the ahievable apaity in TDMA based Ad ho wireless networks S. Sriram Æ T. Bheemarjuna Reddy Æ C. Siva Ram Murthy Published online: August

More information

A Comparison of Hard-state and Soft-state Signaling Protocols

A Comparison of Hard-state and Soft-state Signaling Protocols University of Massahusetts Amherst SholarWorks@UMass Amherst Computer Siene Department Faulty Publiation Series Computer Siene 2003 A Comparison of Hard-state and Soft-state Signaling Protools Ping Ji

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger. - 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?

More information

Scalable TCP: Improving Performance in Highspeed Wide Area Networks

Scalable TCP: Improving Performance in Highspeed Wide Area Networks Salable TP: Improving Performane in Highspeed Wide Area Networks Tom Kelly ERN - IT Division Geneva 3 Switzerland tk@am.a.uk ABSTRAT TP ongestion ontrol an perform badly in highspeed wide area networks

More information

Joint Server Selection and Routing for Geo-Replicated Services

Joint Server Selection and Routing for Geo-Replicated Services Joint Server Seletion and Routing for Geo-Repliated Servies Srinivas Narayana, Wenjie Jiang, Jennifer Rexford, Mung Chiang Prineton University Abstrat The performane and osts of geo-repliated online servies

More information

Real-Time Protocol (RTP)

Real-Time Protocol (RTP) Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of

More information

The Implementation of RRTs for a Remote-Controlled Mobile Robot

The Implementation of RRTs for a Remote-Controlled Mobile Robot ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Performance Improvement in a Multi Cluster using a Modified Scheduling and Global Memory Management with a Novel Load Balancing Mechanism

Performance Improvement in a Multi Cluster using a Modified Scheduling and Global Memory Management with a Novel Load Balancing Mechanism Performane Improvement in a Multi Cluster using a Modified Sheduling and Global Memory Management with a Novel Load Balaning Mehanism P. Sammulal, PhD. Assistant Professor, Department of CSE, JNTUH College

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment

Chemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

We P9 16 Eigenray Tracing in 3D Heterogeneous Media

We P9 16 Eigenray Tracing in 3D Heterogeneous Media We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

IN RECENT years, multi-hop wireless networks have made

IN RECENT years, multi-hop wireless networks have made IEEE JOURNAL ON SELECED AREAS IN COMMUNUNICAIONS, VOL. 3, NO. 7, AUGUS 37 Revenue Maximization in ime-varying Multi-Hop Wireless Networks: A Dynami Priing Approah Yang Song, Chi Zhang, Member, IEEE, Yuguang

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

CA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5

CA Single Sign-On 12.x Proven Implementation Professional Exam (CAT-140) Study Guide Version 1.5 Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized use,

More information

Lecture 13. Quality of Service II CM0256

Lecture 13. Quality of Service II CM0256 Lecture 13 Quality of Service II CM0256 Types of QoS Best Effort Services Integrated Services -- resource reservation network resources are assigned according to the application QoS request and subject

More information

arxiv:cs/ v1 [cs.ni] 12 Dec 2006

arxiv:cs/ v1 [cs.ni] 12 Dec 2006 Optimal Filtering for DDoS Attaks Karim El Defrawy ICS Dept. UC Irvine keldefra@ui.edu Athina Markopoulou EECS Dept. UC Irvine athina@ui.edu Katerina Argyraki EE Dept. Stanford Univ. argyraki@stanford.edu

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Backpressure with Adaptive Redundancy (BWAR)

Backpressure with Adaptive Redundancy (BWAR) Bakpressure with Adaptive Redundany (BWAR) Majed Alresaini alresain AT us. edu Maheswaran Sathiamoorthy msathiam AT us. edu Bhaskar Krishnamahari bkrishna AT us. edu Mihael J. Neely mjneely AT us. edu

More information

Degree-Optimal Routing for P2P Systems

Degree-Optimal Routing for P2P Systems DOI 10.1007/s00224-007-9074-x Degree-Optimal Routing for P2P Systems Giovanni Chiola Gennaro Cordaso Luisa Gargano Mikael Hammar Alberto Negro Vittorio Sarano Springer Siene+Business Media, LLC 2007 Abstrat

More information

checking for optimal egress point in ibgp routing

checking for optimal egress point in ibgp routing heking for optimal egress point in ibgp routing Mar Olivier Buob (CORE/CPN/NEO), Mikaël Meulle (CORE/CPN/RIV), Steve Uhlig (Delft Universit of Tehnolog) 0/0/07 agenda 2 3 introdution internet routing border

More information

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

A Dictionary based Efficient Text Compression Technique using Replacement Strategy A based Effiient Text Compression Tehnique using Replaement Strategy Debashis Chakraborty Assistant Professor, Department of CSE, St. Thomas College of Engineering and Tehnology, Kolkata, 700023, India

More information

Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology

Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology The International Arab Journal of Information Tehnology, Vol. 12, No. 6, November 15 519 Model Based Approah for Content Based Image Retrievals Based on Fusion and Relevany Methodology Telu Venkata Madhusudhanarao

More information

Scheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiprocessor

Scheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiprocessor Sheduling Multiple Independent Hard-Real-Time Jobs on a Heterogeneous Multiproessor Orlando Moreira NXP Semiondutors Researh Eindhoven, Netherlands orlando.moreira@nxp.om Frederio Valente Universidade

More information