Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and
|
|
- Barnaby Mathews
- 6 years ago
- Views:
Transcription
1 Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A): Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) ISSN X (Onlne) ISSN (Prnt) Research Artcle Fault-Tolerant Uncast, Multcast and Broadcast Routng Flow-Based Models Olexandr V. Lemesho, Knan M. Arous, Olesandra S. Yeremeno. Telecommuncaton Systems Department, Kharv Natonal Unversty of Rado Electroncs, Urane, *Correspondng author Olexandr V. Lemesho Emal: Abstract: Flow-based models of uncast, multcast and broadcast fault-tolerant routng n telecommuncaton networs were proposed. The novelty of models s a descrpton of multproduct case, as well as n consderaton of flowng nature of modern networ traffc, allowng to mplement prevously nown condtons for communcaton lns overload preventon for the case of uncast, multcast and broadcast routng type. The models represented by a system of lnear equatons and nequaltes, whch maes them effectve n terms of algorthm mplementaton. As part of the proposed models tass of uncast, multcast and broadcast routng are focused on solvng optmzaton problems. Numercal examples showed effcency of the proposed models n terms of servng multple flows wth dfferent characterstcs concurrently and adaptaton to changes of networ parameters (e.g. channel capacty). The proposed model can be used for solvng the uncast, multcast and broadcast routng problems, and the mathematcal descrpton of more complex processes and problems, such as those assocated wth the desgn of telecommuncaton networs (selecton of topology and bandwdth of communcaton lns). Keywords: Flow-based model, Fault-tolerance, Routng, Bacup scheme, Uncast, Multcast, Broadcast flows INTRODUCTION Routng protocols s a sgnfcant part n provdng the qualty of servce (QoS) n modern communcaton systems whch prmarly based on IP and MPLS (MultProtocol Label Swtchng) technologes. It s mportant to note that the man source of QoS degradaton s the occurrng of networ overload. Unfortunately the majorty of routng protocols provde the recalculaton of routes n a perod of tens seconds. Thus they don t provde an effcent response on the networ overload. So, to ncrease the effcency of response on the possble denals of pacets servng caused by overloads n lns and routers buffers the fault-tolerant routng s used (e.g. MPLS Fast ReRoute technology). Routng protocol has to satsfy a number of mportant requrements such as provdng networ elements reservaton (protecton of ln, node and path) and adaptaton for sngle/multpath routng. Thus an approach as flow-based model that satsfes these requrements s offered. Modern networs are multservce,.e. they provde several servces concurrently on the bass of one transport platform. In addton to transmt traffc pacets of IPTV servce, dstance learnng, database replcaton, Web servces multcast routng s used. In order to mprove QoS dfferent schemes of fault-tolerant uncast, multcast and broadcast routng are used, whch n partcular are also based on provsons of the Fast Reroute concept. Represented schemes demonstrate an approach proposed n [1-3], and they are based on nonlnear flow model n whch the condtons for ln overload preventon are modfed for the case when only some flows can swtch to bacup routs but not all of them. Fault-Tolerant Routng Models Mathematcal Model for Uncast Flows Routng Let us descrbe a networ structure as orented graph Г ( V, E), where V v, 1, m s a set of vertces nodes (routers) of the networ and ( E s a set of graph arcs modelng networ lns. Let E ( :ln goes from to j be the set of lns. For each ln (, t s specfed the throughput, and wth each -th traffc flow the set of parameters assocated: r, s and d rate of -th flow, source node and 343
2 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): destnaton node respectvely. Quantty ( E of prmary path. x s the control varable, whch characterzes the part of -th flow of the ln For the purpose of preventon of networ nodes overload t s necessary to meet the condton of flow conservaton [4]: E E E x j j, ) E x j j, ) E x j j, ) E Condtons of multpath routng realzaton for prmary path are next 0; K, 1; K, 1; K, 0 1 s, d s ; d. ; (1) x. (2) Condtons of sngle path routng realzaton for prmary path are x 0;1. (3) Besdes, the model s supplemented by condtons of QoS assurance [5] that s very mportant for multservce networs. Mathematcal Model for Multcast/Broadcast Flows Routng In developng of multcast routng model let us use the same concept as for uncast. Each -th flow connected wth several parameters: an average flow rate at the networ entrance r ; source node s ; * 1 2 m d d, d,..., d (4) set of destnaton nodes, where m s the number of recevers of -th flow. In broadcast routng model every -th flow s connected wth an extended (n comparson to (4)) set of destnaton nodes Where all the networ nodes except for s are ncluded. ** d d,..., 1 2 m 1, d d, (5) Whle solvng the problem of multcast routng t s necessary to calculate a set of Booleans (3). Each of them characterzes the proporton of ntensty of -th flow n the ln the networ. and also Routng varables (3) are lmted by several constrants [6]: Each transt node v j V E :( E ( E ; K, where K denotes a set of flows n 1 f K, v s, (6) * ; v j d 1 f K. (7), whch can be any node, except for the source, s gven by the followng condtons: 344
3 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): :( E x jp, K; v s. (8) j The fulfllment of these condtons allows to have a flow n any communcaton ln (( j, p) E ) comng from the transt node only n that case when ths flow comes on the gven node at least va one ncomng ln ( ( E ). where In order to prevent cycle formng condtons added nto the proposed model: ( E E s a set of arcs formng -th cycle accordng to ther orentaton; x E, (9) E denotes power of the set E. The fulfllment of the condton (9) guarantees that the number of arcs used n multcast routng, composng any cycle s always smaller than the total number of arcs n ths cycle. Ensurng of the Fault-Tolerance Routng Condtons In order to mprove fault-tolerance routng together wth prmary path havng a root n the source node ( s ), we have to determne a bacup path wth the same root. From the mathematcal pont of vew n order to determne the bacup (reserved) path t s necessary to calculate addtonal varables ln ( E of the bacup path wth arguments (3), (6)-(9). x characterzng a part of the -th flow n the However wth the purpose of preventng the prmary and bacup paths overlappng wth realzaton of dfferent bacup-schemes we add several addtonal restrctng condtons that connect routng varables to calculate the prmary and bacup path trees. For example, whle mplementng protecton scheme of ( -ln the offered model (3), (4), (6)- (9) obtans such condtons [7,8]: x x 0. (10) bacup. The fulfllment of these condtons guarantees the usng of ( -ln by the sngle path, ether the prmary or In realzaton of the protecton scheme for -th node the model s added by the followng term: :( E x x 0. (11) The fulfllment of the gven condton guarantees the usng of -th node (.e. all ncdents to t lns) by ether the prmary or bacup path. To provde protecton for the prmary path the followng equalty condton must be added to the model x x 0, (12) ( E Whch guarantees the meetng of requrements regardng the absence of any common lns n the prmary or bacup path? OVERLOAD PREVENTION CONDITIONS Usng the proposed model let s consder followng two varants of ts applcaton, whch characterzed by the ablty to prevent the overload of networ lns by flows whch run through prmary and bacup routes. In the frst case, when consder only prmary paths flows, condton of the lns overload preventon has the form: r x ; ( E. (13) K 345
4 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): Then the requred lns throughput of the bacup paths flows are not guaranteed and the addtonal restrctons on varables x are not applcable. Then followng condtons entered: n case of one path routng realzaton (3). r K 1, ( E, (14) Durng the calculaton of varables x and x whle solvng the problem of fault-tolerant routng n networ t s reasonable to mnmze the followng objectve functon: F c c, (15) K( E K( E where c and c are lns metrcs whch used n calculaton of the prmary and bacup paths respectvely. As a result of mnmzaton of the equaton (15) varables x and x are calculated what n practce means the determnaton of the two types of paths between a nodes (source and destnaton) the prmary and bacup. More over the order of usng these routes by flows determned n the same tme wth ther calculaton. Besdes n [7,8] the necessty to mplement the condtons establshed: c x c x. (16) K( E K( E The fulfllment of ths condton guarantees that the prmary path wll be always more effectve n rate, pacet delay,.e. «shorter» than the bacup one wthn the chosen routng metrcs c and c. Whle mplementng of faulttolerance n multcast flows the optmzaton tas (15) wth the constrants (1)-(14) and (16) belongs to the class of nonlnear programmng. NUMERICAL EXAMPLES Let us consder an example of mplementaton of the proposed schemes (1)-(16) whle solvng the problem of sngle path fault-tolerant uncast routng n the networ the topology of whch s presented on the Fgure 1. The networ conssts of fve nodes (routers) and seven lns wth the throughput (pacet per second, 1/s) shown on the graph arcs. For frst flow: the source node s, destnaton node s Nodes 5. The rate of frst flow s 80 1/s. For second flow: the source node s Node 2, destnaton node s Nodes 4. The rate of second flow s 60 1/s. Let us assume that wthn the gven example we mplement uncast routng wth mnmzaton of the number of hops ( c 1). It s needed to represent the scheme of protecton of the (1, 3) ln Node 2 60 Node 4 Fg-1: The example of MPLS-networ topology 346
5 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): а The prmary path for frst flow 60 b The prmary path for second flow Fg-2: Set of prmary paths for two flows Node 2 60 Node 4 Fg-3: The bacup path for frst flow wthout usng the condton (14) Node 2 Fg-4: The bacup path for frst flow usng the condton (14) Whle solvng a problem t was determned that prmary path for frst flow s consst of two hops whch nclude 135 nodes. The prmary path for second flow ncludes just one ln 24. In realzng the protecton scheme of the (1, 3) ln wthout condton (7) the bacup path for frst flow wll contan 3 hops and nclude 1245 nodes. But usng the ln (2, 4) by both frst and second flows wll cause ts overload due to addtve flow ntensty of 140 1/s. It s possble to avod the overload n the case of usng the overload preventon condton (7). Then the bacup path for frst flow wll consst of 1235 nodes wthout networ overload. Let us consder an example of mplementaton of the proposed schemes (10)-(14) whle solvng the problem of sngle path fault-tolerant multcast routng n the networ the topology of whch s presented n the Fgure 5. The networ conssts of sx nodes (routers) and eght lns wth the throughput (pacet per second, 1/s) shown on the graph arcs. For frst flow: the source node s, destnaton nodes are Nodes 3, 5 and 6. The rate of frst flow s 100 1/s. For second flow: the source node s Node 2, destnaton nodes are Nodes 4 and 6. The rate of second flow s 200 1/s. Let us assume that wthn the gven example we mplement multcast routng wth mnmzaton of the number of hops ( c 1). 347
6 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): Fg-5: The example of MPLS-networ topology Fg-6 shows an example of the problem-solvng for fault-tolerant routng n the networ wth (2, 4)-ln protecton. Then as the prmary path for frst flow we tae the soluton presented n Fgure 6 a), and the "length" of the gven path s mnmal and conssts of 3 hops. Then soluton for prmary path for second flow presented on Fgure 6 b), and the "length" of the gven path s mnmal and t conssts of 2 hops. а The prmary path for frst flow b The prmary path for second flow Fg-6: Set of prmary paths for two flows If only condtons (13) used for mplementaton of (2, 4) ln protecton scheme, the bacup path for second flow (Fgure 7 a) ncludes 3 hops and does not contan any ln (2, 4) n accordance wth the mplemented protecton scheme. 348
7 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): a The bacup path for second flow usng the condton (13) only b The bacup path for second flow usng condtons (14) only Fg-7: Implementaton of (2, 4)-ln protecton scheme Bacup path (Fgure 7 a) s shortest and conssts of 3 hops, but has throughput of 200 1/s, because of the (5,6)- ln throughput. Thus due to presence of two flows wth the rates of 100 and 200 1/s an overload wll occur n ths ln. Usng the condton (14) the soluton shown on Fgure 7 b wll be used as the desred bacup path. Ths bacup path (Fgure 7 b) has 4 hops,.e. overload does not occur, because shared lns (3, 5) and (5, 4) have throughput larger than 300 1/s. The above examples demonstrate the advantages of usng the proposed condtons (13) and (14) for the lns overload preventon. In the consdered case for multcast routng the fault of (2, 4)-ln has not caused a change n the transmsson route for frst flow. However, t s not a rule, sometmes n order to prevent networ overload under fault of one of ts elements (node, ln, or path) wthn the proposed soluton, reroute can smultaneously nclude several but not all flows wthn the networ. CONCLUSION The schemes for protecton of node, ln and path under fault-tolerant uncast, multcast, and broadcast routng are presented for a multflow case. The schemes demonstrate an approach proposed n [7,8], and they are based on a nonlnear flow model n whch the condtons for ln overload preventon (14) are modfed for the case when only some flows can swtch to bacup routes, but not all of them. Ths approach ncrease the effcency of practcal realzaton of solutons related to uncast, multcast and broadcast fault-tolerant routng n modern multservce networs and can be used n MPLS Fast ReRoute technology. Effcency of updatng routng nformaton ncreased by the proposed soluton, and allows reducng the tme of updatng to tens of mllseconds, whle current solutons suppose to have tmers of seconds. Functonalty of proposed bacup schemes s demonstrated by the numercal examples wth proven effectveness for the multflow case. REFERENCES 1. Haryawan MY; Comparson Analyss of Recovery Mechansm at MPLS Networ. Internatonal Journal of Electrcal and Computer Engneerng (IJECE), 2011; 1(2): Sundarrajan A, Ramasubramanan S; Fast Reroutng for IP Multcast Under Sngle Node Falures. Global Communcatons Conference (GLOBECOM 2013), 2013; 1: Tam AS-W, Kang X Chao HJ; A Fast Reroute Scheme for IP Multcast. Global Telecommuncatons Conference, 2009; 1:
8 Lemesho OV et al., Sch. J. Eng. Tech., 2015; 3(4A): Lee Y, Seo Y, Cho Y, Km C; A Constraned Multpath Traffc Engneerng Scheme for MPLS Networs. Proc. IEEE ICC 2002, 2002; 1: Lemesho AV, Evseeva OYu, Garusha SV; Research on Tensor Model of Multpath Routng n Telecommuncaton Networ wth Support of Servce Qualty by Greate Number of Indces. Telecommuncatons and RadoEngneerng, 2014; 73(15): Lemesho OV, Arous KM; The flow-based model of multcast routng. Mcrowave and Telecommuncaton Technology (CrMCo), 23rd Internatonal Crmean Conference, 2013; 1: Lemesho O, Romanyu A, Kozlova H; Desgn schemes for MPLS Fast ReRoute. XIIth Internatonal Conference the experence of desgnng and applcaton of cad systems n mcroelectroncs, Polyana-Svalyava, 2013; 1: Lemesho OV, Kozlova HV, Romanyu AA; Flow-based model of fault-tolerant routng n MPLS-networ. Mcrowave and Telecommuncaton Technology (CrMCo), rd Internatonal Crmean Conference, 2013; 1:
NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationAnnales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization
Annales Informatca AI 1 (2003) 277-284 Annales Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ Desgnng of multchannel optcal communcaton systems topologes crtera optmzaton Mrosław Hajder,
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationMultipath Routing Mathematical Model to Solve the Traffic Engineering in Multi-Protocol Label Switching Network
Journal of Computer and Communcatons, 2017, 5, 113-122 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 Multpath Routng Mathematcal Model to Solve the Traffc Engneerng n Mult-Protocol
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationEnhancing MPLS QoS routing algorithms by using the Network Protection Degree paradigm. *
Enhancng MPLS QoS routng algorthms by usng the Networ Protecton Degree paradgm. * Euseb Calle, Jose L Marzo, Anna Urra, Pere Vla Broadband Comm. and Dstrbuted Systems Insttut d Informàtca aplcacons (IA)
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationControl strategies for network efficiency and resilience with route choice
Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationQoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding
Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationOPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationMinimum Cost Optimization of Multicast Wireless Networks with Network Coding
Mnmum Cost Optmzaton of Multcast Wreless Networks wth Network Codng Chengyu Xong and Xaohua L Department of ECE, State Unversty of New York at Bnghamton, Bnghamton, NY 13902 Emal: {cxong1, xl}@bnghamton.edu
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationAvailable online at ScienceDirect. Procedia Computer Science 103 (2017 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Computer Scence 03 (207 ) 562 568 XIIth Internatonal Symposum «Intellgent Systems», INTELS 6, 5-7 October 206, Moscow, Russa Retral queueng systems
More informationA HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS
Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationHIERARCHICAL METHOD OF INTER-AREA FAST REROUTING
Transort and Telecommuncaton Vol. 8 no. 7 Transort and Telecommuncaton 7 volume 8 no. 55 67 Transort and Telecommuncaton Insttute Lomonosova Rga LV-9 Latva DOI.55/tt-7-5 HIRARCHICAL MTHOD OF INTR-ARA FAST
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationNeural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Neural Network Based Algorthm for Mult-Constraned Shortest Path Problem Jyang Dong 1,2, Junyng Zhang 2, and Zhong Chen 1 1 Department of Physcs, Fujan Engneerng Research Center for Sold-State Lghtng, Xamen
More informationIP mobility support is becoming very important as the
706 IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 6, JUNE 2003 A New Scheme for Reducng Lnk and Sgnalng Costs n Moble IP Young J. Lee and Ian F. Akyldz, Fellow, IEEE Abstract IP moblty support s provded
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationTuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques
Tunng of Fuzzy Inference Systems Through Unconstraned Optmzaton Technques ROGERIO ANDRADE FLAUZINO, IVAN NUNES DA SILVA Department of Electrcal Engneerng State Unversty of São Paulo UNESP CP 473, CEP 733-36,
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationAn Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network
Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh
More informationBIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING
An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College
More informationPerformance Analysis of a Managed Bandwidth Service for ATM Networks
Performance Analyss of a Managed Bandwdth Servce for ATM Networks Chrstos Bouras Chryss Chantz Vaggels Kapoulas Alexandros Panagopoulos Ioanna Sampraku Afrodte Sevast Research Academc Computer Technology
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationSpecifications in 2001
Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationTransit Networking in ATM/B-ISDN based on Service Category
Transt Networkng n ATM/B-ISDN based on Servce Category Young-Tak Km Dept. of Informaton and Communcaton Engneerng, College of Engneerng, YeungNam Unv. E-mal : ytkm@ynucc.yeungnam.ac.kr ABSTRACT The ATM
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationCost-Effective Lifetime Prediction Based Routing Protocol for Wireless Network
Cost-Effectve Lfetme Predcton Based Routng Protocol for Wreless Network ABU MD. ZAFOR ALAM, MUHAMMAD ARIFUR RAHMAN, MOHAMMED ABUL HASAN 2,M. LUTFAR RAHMAN Faculty of Scence and IT, Daffodl Internatonal
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationDecision Strategies for Rating Objects in Knowledge-Shared Research Networks
Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationCONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal
CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationOnline Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks
12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele
More informationEfficient Routing Algorithm Based on Decisionmaking Sequence in Wireless Mesh Networks
502 JOURNAL OF NETWORKS, VOL. 7, NO. 3, MARCH 2012 Effcent Routng Algorthm Based on Decsonmang Sequence n Wreless Mesh Networs Yngyng Qn, Rongbo Zhu * College of Computer Scence, South-Central Unversty
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationCOMPLEX METHODOLOGY FOR STUDY OF INTERCITY RAIL TRANSPORT
ENGINEERING FOR RURA DEVEOPMENT Jelgava 5.-7.05.06. COMPEX METHODOOGY FOR STUDY OF INTERCITY RAI TRANSPORT Svetla Stolova Radna Nkolova Techncal Unversty-Sofa Bulgara stolova@tu-sofa.bg r.nkolova@tu-sofa.bg
More informationAdaptive Network Resource Management in IEEE Wireless Random Access MAC
Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract
More informationInvestigation of Transformations and Landscapes for Combinatorial Optimization Problems
Investgaton of Transformatons and Landscapes for Combnatoral Optmzaton Problems Abstract - Ths paper deals wth an analyss of transformatons between combnatoral optmzaton problems and proposes an approach
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationQoS-aware energy-saving mechanism for hybrid optical-wireless broadband access networks
DOI.07/s117-017-0690-3 ORIGINAL PAPER QoS-aware energy-savng mechansm for hybrd optcal-wreless broadband access networks Ruyan Wang 1 Ale Lang 1 Chao Zhou 1 Dapeng Wu 1 Hong Zhang 1 Receved: 5 September
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationEnhancing Class-Based Service Architectures with Adaptive Rate Allocation and Dropping Mechanisms
Enhancng Class-Based Servce Archtectures wth Adaptve Rate Allocaton and Droppng Mechansms Ncolas Chrstn, Member, IEEE, Jörg Lebeherr, Senor Member, IEEE, and Tarek Abdelzaher, Member, IEEE Abstract Class-based
More informationTECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai
TECHNICAL REPORT AN OPTIMAL DISTRIUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION Jord Ros and We K Tsa Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne 1 AN OPTIMAL
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More information