Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networks
|
|
- Gwen Owens
- 5 years ago
- Views:
Transcription
1 Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networs F. Mousavi Madani Departent of coputer engineering Alzahra University Tehran, Iran, Received: Septeber 23, 2013-Accepted: Noveber 21, 2014 Abstract A surge of interest toward design and ipleentation of green networs are eerging in recent years. One obvious trend to reduce energy consuption of ajor active networ coponents is to craft bacbone networ architecture that taes into consideration traffic grooing of low-rate IP traffic as well as power-aware virtual topology design schees and RWA. Previous research efforts developed design strategies which assued digital processing of incoing traffic flows at every node structure in the optical layer (DXCs). This architecture provides full wavelength conversion capability by the use of optical transponders (OEO convertors) thus reduces coplicated RWA proble to a siple routing proble at the cost of sacrificing lightpath transparency. Moreover, introduction of transponders give rise to extra sources of power consuption which contrasts over goal. In this paper, energyiniized design of IP over WDM networs based on optical cross connects (OXCs) is investigated. Integer linear prograing forulation as well as heuristics for two design strategies viz. ulti-hop lightpath and direct bypass have been developed and their perforance with regard to power consuption and relative bandwidth utilization are copared. Siulation results indicate superior perforance of the proposed strategies with regard to previous studies. Keywords-coponent; Energy-iniized design, ulti-hop lightpath, direct lightpath. I. INTRODUCTION Growing energy consuption of bacbone optical networs has recently aroused global attention toward planning energy efficient networs. With rapid expansion and processing speed of underlying equipent to support next-generation high-speed Internet services and cloud coputing has further strengthened the iportance of power saving trends. Soe researchers proposed power-aware routing and wavelength assignent (PA-RWA) algoriths that taes power consuption of traffic load into routing considerations [1, 2]. For IP over WDM networs, soe authors have focused their intention on traffic grooing and optical bypass as green provisioning strategies [3]. Also, sleep ode option for the optical devices (e.g., aplifiers, optical switches) installed for protection purposes have been considered in [4]. These devices can be put in sleep ode to reduce the networ power consuption, but they can be proptly waen up (if necessary) upon a failure occurrence. In this paper, novel MILP forulations for optiization of power consuption in the networ design architecture based on optical cross-connect switches (OXCs) and IP core routers have been introduced. The ulti-hop translucent odel provides siultaneously optial virtual topology design and RWA to iniize the nuber of ports in core routers. It supports traffic grooing and full wavelength conversion at interediate cross-connecting nodes while aintaining optical transparency on each lightpath. The direct bypass odel investigates design of energy iniized single-hop all optical networ.
2 We further developed energy-iniized oriented heuristics for the fore entioned design scenarios to overcoe processing burden of pure atheatical odels. The rest of the paper is organized as follows: section 2 presents scheatic of the bacbone networ. Detail atheatical forulations for design strategies are introduced in section 3. Section 4 provides heuristics as near optial solution. Section 5 represents siulation results and perforance coparison aong design strategies for three test networs. Finally, section 5 concludes the paper. II. CORE NETWORK MODEL The architecture shown in Fig. 1 is used for odeling IP over WDM bacbone networ. Specifically, every node is coposed of a core router which collects user s traffic fro access routers at the IP layer and connects aggregated traffic streas to optical cross connect (OXC) via short-reach interface. OXCs at the optical layer are interconnected by optical fiber lins that carries at ost W wavelengths each with a carrying capacity of B Gb/s. For ultiplexing/de-ultiplexing of wavelength channels at output/input ports of OXC, a pair of optical passive ultiplexer/deultiplexer are used for each fiber lin. Clearly, the odel represents circuit-switched ultifiber optical networ that ipleents a virtual lin at the IP layer with a transparent lightpath at the optical layer. So wavelength conversion is not available in nodes and wavelength continuity should be conserved through whole networ. In order to enable optical signals to traverse long distances, EDFA aplifiers are introduced at regular distances. Also shown in Fig. 1, three ajor source of energy consuption are networ line card of core router (E r), transponder (E t) and EDFA (E e) so total power consuption can be coputed fro the nuber and types of router ports, total nuber of fibers and geographic span of the networ. Here, without losing generality, three types of router line cards are considered, naely one-port, two-ports and four-ports line cards. Such a distinction was ade based on the presuption that an N-port line card consues less energy than N one-port line cards. Fro the networ design perspective, two different strategies can be eployed to design IP over WDM networs, ulti-hop transparent lightpath bypass (naely translucent) and direct lightpath bypass strategies. Under ulti-hop bypass strategy, each virtual lin at IP layer is apped onto several concatenated lightpaths at optical layer. Over each lightpath, all IP traffic passing through an interediate router are directly bypassed at the corresponding OXC. At the destination node of a virtual lin, however, traffic carried by all wavelength channels are dropped and forwarded to core router for electronic processing. Low-end routers Low-end routers IP layer Er Core router j N : i j C Er Core router i id / B dn, di Et Optical layer W OXC Ee EDFA fn OXC L n Fig. 1. Architecture of IP over WDM networ This allows traffic grooing at interconnections between virtual lins to attain benefits of traffic grooing for iproved bandwidth utilization. Such iproveent, of course, can be obtained only at the cost of sacrificing full lightpath transparency. In contrast, direct lightpath strategy achieves full wavelength transparency by deploying direct lightpath between every source-destination pair at the cost of issing the benefits of traffic grooing. The perforance of these two scenarios in ters of energy consuption and relative BW utilization will be contrasted in the later section. We have also included ulti-hop opaque lightpath bypass scenario discussed in [5] where a cobination of O-E-O transponders and DXCs allow for ipleentation of full wavelength conversion at each node. It relieves wavelength continuity constraint and reduces the coplex RWA proble to a siple routing proble. For the sae of bencharing results with an ideal lower band and upper band liits, the LP-relaxed version of the odel and Non-bypass design schees are taen into consideration, respectively.
3 III. ENERGY-MINIMIZED MATHEMATICAL MODELS In the so-called ulti-hop lightpath bypass and direct lightpath bypass strategies, the proble of designing an IP over WDM networ with iniu power consuption can be forulated as a ixed integer linear prograing (MILP) odel. Our objective is to find energy-iniized design subject to 1) serving all traffic deands, 2) a fixed axiu nuber of wavelengths per fiber. No liit on the nuber of fibers in each physical lin was set to accoodate required carrying capacity. Input paraeters: : A physical topology which consists of a set of nodes N and lins L. The node set corresponds to networ nodes, of which each consists of an IP router and an OXC. The lin set consists of physical fiber lins in underlying networ topology. G( N, E ) N : The set of neighboring nodes of node in the physical topology. T: set of router line card types. We assue three types of one-port, two-port and four-port types of line cards. : Traffic deand between each node pair (s, d). We further assue a syetric traffic deand atrix, i.e. =. E r ds : Power consuption of th type of router line card. E t: Power consuption of a transponder. E e: Power consuption of an EDFA. L n: Distance between node and node n in physical topology. A n: The nuber of EDFAs that should be placed in line on each physical lin (, n). Specifically, An L n / S 1 2, where S is the span distance between two adjacent EDFAs (the value of 80 is coon in practice and used in siulations). 2 counts for post- and preaplifiers at fiber ends. Δ i: The nuber of ports used to aggregate low-rate traffic fro low-end routers at node I (see figure. 1). P : The nuber of ports contained in the th type of router line card. W: Maxiu nuber of wavelengths per fiber. B: Bit rate per wavelength channel. Scenario I: ulti-hop lightpath bypass strategy Decision variables: : The aount of traffic deand between node pair (s, d) that traverses virtual lin (i, j). w n, w : The aount of traffic flow (nuber of wavelengths) between node pair (i, j) at wavelength w that traverses physical lin (, n). C w : Traffic flow (nuber of wavelengths) passing through virtual lin (i, j) at wavelength w. C : Total traffic flow passing through virtual lin (i, j). f n : Nuber of fibers on physical lin (, n). Y i : Nuber of th type of router line cards deployed at node i. Objective: Miniize Subject to: Er Yi Et C i N T i N j N : i j E A f e n n N nn (1) P Yi i C i N (2) T j N : i j j i j N : i j j N : i j if i s if i d s, d, i N : s d 0 otherwise sn dn : (3) C B, i j N : i j (4) nn w n, w wn, w nn Cw if i Cw if j, i j, N, w W : i j 0 otherwise i N j N : i j n, w n,, (5) w f N n N ww (6) Cw C, i j N : i j (7) ww
4 Objective (1) is defined to iniize the overall networ power consuption. The first ter coputes total power consuption by IP routers. The second ter sus up power consuption of all transponders connected to OXCs and the last ter calculates total power consuption of pre-, post- and inline optical aplifiers. Constraint (2) ensures that router line cards at each node have sufficient ports to accoodate IP traffic. Constraint (3) reflects traffic flow conservation at each node. Constraint (4) is included to dedicate enough virtual lin capacity to support all traffic deands that use the lin. Constraint (5) aintains flow conservation and wavelength continuity over a lightpath at optical layer. Constraint (6) prevents fro wavelength channel collision at every fiber lin. Finally, constraint (7) counts total aount of traffic flow over each virtual lin. Scenario II: direct lightpath bypass strategy Decision variables: C : Nuber of wavelength channels between node pair (s, d) that carry traffic deand. C w : Nuber of wavelength channels between node pair (s, d) on wavelength w. C n, w : Nuber of wavelength channels between node pair (s, d) on wavelength w that traverses physical lin (, n). f n Y i : Nuber of fibers on physical lin (, n). : Nuber of th type of router line cards deployed at node i. Objective: Miniize Subject to: nn Er Yi Et C i N T sn dn : E A f e n n N nn (8) P Yi i C i N (9) T j N : i j C B s, dn : s d (10) C n, w Cn, w nn Cw if s Cw if d s, d, N, w W : s d 0 otherwise sn dn : n, w n,, C f N n N w W (12) Cw C s, d N : s d (13) ww Constraint (9) is siilar to constrain (2). Constraint (10) is included to dedicate enough wavelength capacity at every node to support all traffic deands of that node. Constraint (11) aintains wavelength flow conservation and continuity over a lightpath between a pair of source-destination node. Constraint (12) prevents fro wavelength channel collision at every fiber lin. Finally, constraint (13) counts total nuber of wavelengths between an (s, d) pair. IV. HEURISTIC ALGORITHMS The preceding ILP forulation becoes coputationally intractable even for ediu-sized networs when fiber channel capacity grows beyond 4 ~ 8 wavelengths. Heuristic algoriths have been extensively studied to tacle VTD and RWA optiization probles. For the case in hand, two heuristics corresponding to the above design schees were developed toward iniizing energy consuing coponents. Flowchart of the ulti-hop bypass design schee is shown in Fig. 2. First, the sub-wavelength part of every traffic deand is extracted and stored for traffic grooing in the latter stage. Since wavelength granular part of every deand pair cannot be aggregated with other traffic deands, we try to carry it in a single-hop direct lightpath fashion in the first round. This proceeds as an attept to eliinate interediate optical regenerators thereby iniizing router line cards which are the ajor energy consuing coponents. The RWA heuristic was constructed based on -shortest path routing cobined with First-Fit wavelength assignent in an effort to iniize both nuber of inline aplifiers as well as required nuber of fibers per physical lin for a given W. The next round was crafted to exploit benefit of traffic grooing capability over ulti-hop virtual lins. For each reaining sub-wavelength traffic deand, it tries to find virtual path with iniu axial traffic load to enhance load balancing thus iproving resource utilization. As the new traffic pattern was developed after the copletion of VTD design stage, RWA heuristic is invoed again to decide optial physical resource allocation. The devised algorith wors for direct bypass strategy as well where whole traffic deand volue of every node pair is copletely processed in the first round without any concern to other deands. So every request was ipleented as ultiple direct lightpaths over a single virtual in. (11)
5 V. SIMULATION RESULTS To evaluate the perforance of the fore entioned design scenarios, three test networs were considered as shown in Fig. 3. The first one is conventionally chosen as a typical topology referred in any papers. The second one is a 15-node 21-lin NSFNET networ and the third one is 24-node 43-lin USA bacbone IP networ (USNET in short). The physical length of every lin is indicated just close to it in iloeters unit. Additionally, the following inputs were supplied to the odel: 1) The traffic deand between each pair of nodes was randoly generated with unifor distribution over the range [0, 2X] Gb/s where the average deand was taen fro preset values X {20, 40,...,140}. 2) The axiu nuber of wavelength channels in each fiber is taen fro the set W {2, 4,8,16} depending on the purpose of study and transission capacity of each wavelength channel is 40 Gb/s. 3) The energy consuption of each type of router line card is taen fro [6] to be: L_TYPE1 = 580 W, L_TYPE2 = 1000 W, and L_TYPE4 = 2000 W. Moreover, according to [7] each WDM transponder consues around 70 W, and each EDFA consues 10 W. Fig. 2. Flowchart of translucent design schee (a) n6s (b) NSFNET (c) USNET Fig. 3. Test networs
6 Fig. 4(a) shows the variation of iniu power consuption of n6s8 networ versus average traffic intensity for different design strategies when the axiu nuber of wavelengths per fiber is set to 8. Fig. 4(b) and (c) depict the sae plot for the NSFNET and USNET networs respectively. In the first two cases we notice better energy perforance of the proposed ulti-hop translucent design copared to the reference opaque ulti-hop lightpath bypass odel. Energy saving is slightly higher for heavy loads and as expected ainly stes fro significant reduction in the nuber of transponders for passing by channels due to the replaceent of DXC with OXC. However, in considering bandwidth utilization of these two schees, it ay be postulated that higher resource requireents for aintaining transparency in the translucent design schee leads inevitably to sacrifice in BW utilization. Relative BW utilization of test networs for different average traffic loads are illustrated in Fig. 5 (a) to (c). For each case, the BW utilization of single-channel direct-bypass networ was taen as a reference and was calculated as ratio of overall networ throughput to total wavelength capacity. Apparently, in both n6s8 and NSFNET networs, relative BW utilization of the proposed ulti-hop translucent design shows alost the sae quantity or even better than the opaque design for all traffic loads. Higher energy consuptions and inferior BW utilization of the direct bypass design schee refers bac to the fact that it requires ore wavelength channels at each node for a given traffic deand owing to the lac of traffic grooing capability and wavelength continuity constraint. As a result higher nuber of IP router ports and inline aplifiers (due to the scarcity of available wavelengths to route a lightpath thus iposing an increase in fiber strands) translates into poor energy perforance. This is the price we should pay to aintain full transparency over whole networ. The above conclusions can be extended to the larger USNET networ since results fro heuristic analysis of the ulti-hop translucent design provide just an upper estiation to exact optial values. In addition, the total nuber of fiber segents which was calculated fro heuristics turned to be an upper approxiation to the optial one thereby values of relative BW utilization of the ulti-hop translucent design in Fig. 5 (c) should be lower than actual ones. Fig.4. Coparison of total power consuption of different design strategies Fig. 5. Coparison of relative BW utilization of different design strategies
7 As a conclusion, the proposed heuristic for the calculation of power consuption of the ulti-hop translucent design obtained satisfactory estiation within 5~7% accuracy and nearly exact results for the case of direct bypass design schee. Perforance of ulti-hop translucent design rendered superior than ulti-hop opaque design when considering both energy-consuption and BW utility factors. The variation of total power consuption with the growing scale of wavelength channel capacity per each fiber strand for an average traffic load of 120 erlangs is depicted in Fig. 6. Although none of ajor energy consuing coponents are directly affected by expanding transission capacity, slow decay of power consuption is attributed to noticeable saving in total nuber of EDFAs which is acquired by scaling down the required fiber strands. Fig. 6. Variation of total power consuption with wavelength capacity expansion for different design schees VI. CONCLUDING REMARKS Design of green optical networs have recently attracted enorous research attitude due to rapid expansion and exclusive role of these networ as the bacbone of next generation Internet. In this paper two design strategies to deploy IP over WDM optical networ based on optical cross-connect switches were introduced and atheatical odels to optiize their energy consuption perforance and proper heuristic algoriths were developed. Energy consuptions for different traffic loads were copared with those of a siilar odel where digital cross-connect switches were eployed instead. Siulation results showed that the proposed ulti-hop translucent lightpath bypass approach achieved better energy perforance than the opaque lightpath bypass design under the sae traffic loads. Direct bypass design approach could also achieve good energy perforance and acceptable BW utilization at higher traffic loads. REFERENCES [1] A. Coiro, M. Listanti, and A. Valenti, "Dynaic poweraware routing and wavelength assignent for green WDM optical networs," in Counications (ICC), 2011 IEEE International Conference on, 2011, pp [2] Y. Wu, L. Chiaraviglio, M. Mellia, and F. Neri, "Poweraware routing and wavelength assignent in optical networs," in Optical Counication, ECOC'09. 35th European Conference on, 2009, pp [3] M. Xia, M. Tornatore, Y. Zhang, P. Chowdhury, C. Martel, and B. Muherjee, "Greening the optical bacbone networ: A traffic engineering approach," in Counications (ICC), 2010 IEEE International Conference on, 2010, pp [4] A. Muhaad, P. Monti, I. Cerutti, L. Wosinsa, P. Castoldi, and A. Tzanaai, "Energy-efficient WDM networ planning with dedicated protection resources in sleep ode," in Global Telecounications Conference (GLOBECOM 2010), 2010 IEEE, 2010, pp [5] Y. Lui, G. Shen, and W. Shao, "Energy-Miniized Design for IP over WDM Networs under Modular Router Line Cards." [6] F. Musueci, M. Tornatore, and A. Pattavina, "A power consuption analysis for IP-over-WDM core networ
8 architectures," Journal of Optical Counications and Networing, vol. 4, pp , [7] G. Shen and R. S. Tucer, "Energy-iniized design for IP over WDM networs," Optical Counications and Networing, IEEE/OSA Journal of, vol. 1, pp , Fariborz Mousavi Madani was born in Shiraz, Iran, on August 23, He received his the B.Sc. degree in electrical engineering fro Shiraz University, Shiraz, Iran in 1987 and his the M.Sc. degree in telecounications fro Sharif University of Technology (SUT), Tehran, Iran in He received his Ph.D. degree in electrical engineering fro University of Toyo, Toyo, Japan in He is currently woring with Departent of Coputer Engineering as a full-tie Assistant Professor at Alzahra University. His research interests are in the areas of Optical Networ Virtualization, Design and Optiization of Elastic Optical Networs, Next-Generation Passive Optical Networs,and Fi-Wi networs as well.
Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationMultipath Selection and Channel Assignment in Wireless Mesh Networks
Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationA Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium
1 A Distributed Multi-service Resource Allocation Algorith in Heterogeneous Wireless Access Mediu Muhaad Isail, Student Meber, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract In this paper, radio resource
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationAn Ad Hoc Adaptive Hashing Technique for Non-Uniformly Distributed IP Address Lookup in Computer Networks
An Ad Hoc Adaptive Hashing Technique for Non-Uniforly Distributed IP Address Lookup in Coputer Networks Christopher Martinez Departent of Electrical and Coputer Engineering The University of Texas at San
More informationSecure Wireless Multihop Transmissions by Intentional Collisions with Noise Wireless Signals
Int'l Conf. Wireless etworks ICW'16 51 Secure Wireless Multihop Transissions by Intentional Collisions with oise Wireless Signals Isau Shiada 1 and Hiroaki Higaki 1 1 Tokyo Denki University, Japan Abstract
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationAdaptive Holistic Scheduling for In-Network Sensor Query Processing
Adaptive Holistic Scheduling for In-Network Sensor Query Processing Hejun Wu and Qiong Luo Departent of Coputer Science and Engineering Hong Kong University of Science & Technology Clear Water Bay, Kowloon,
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationIntegrating fast mobility in the OLSR routing protocol
Integrating fast obility in the OLSR routing protocol Mounir BENZAID 1,2, Pascale MINET 1 and Khaldoun AL AGHA 1,2 1 INRIA, Doaine de Voluceau - B.P.105, 78153 Le Chesnay Cedex, FRANCE ounir.benzaid, pascale.inet@inria.fr
More informationAn Adaptive and Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive and Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationFair Energy-Efficient Sensing Task Allocation in Participatory Sensing with Smartphones
Advance Access publication on 24 February 2017 The British Coputer Society 2017. All rights reserved. For Perissions, please eail: journals.perissions@oup.co doi:10.1093/cojnl/bxx015 Fair Energy-Efficient
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationAn Adaptive Low-latency Power Management Protocol for Wireless Sensor Networks
An Adaptive Low-latency Power Manageent Protocol for Wireless Sensor Networks Giuseppe Anastasi, Marco Conti*, Mario Di Francesco, Andrea Passarella* Pervasive Coputing & Networking Lab. (PerLab) Departent
More informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationHandling Indivisibilities. Notes for AGEC 622. Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University
Notes for AGEC 6 Bruce McCarl Regents Professor of Agricultural Econoics Texas A&M University All or None -- Integer Prograing McCarl and Spreen Chapter 5 Many investent and probles involve cases where
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationVirtual source-based minimum interference path multicast routing in optical virtual private networks
Photon Netw Coun (2007) 13:19 30 DOI 10.1007/s11107-006-0012-7 ORIGINAL ARTICLE Virtual source-based iniu interference path ulticast routing in optical virtual private networks Jun-Mo Jo Suk-Jin Lee Kyung-Dong
More informationRECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS
RECONFIGURABLE AND MODULAR BASED SYNTHESIS OF CYCLIC DSP DATA FLOW GRAPHS AWNI ITRADAT Assistant Professor, Departent of Coputer Engineering, Faculty of Engineering, Hasheite University, P.O. Box 15459,
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationIN many interactive multimedia streaming applications, such
840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationDistributed Multicast Tree Construction in Wireless Sensor Networks
Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,
More informationResource Optimization for Web Service Composition
Resource Optiization for Web Coposition Xia Gao, Ravi Jain, Zulfikar Razan, Ulas Kozat Abstract coposition recently eerged as a costeffective way to quickly create new services within a network. Soe research
More informationEnd-to-End QoS Provisioning for Real-Time Video Streaming over SP-Driven P2P Networks Using Admission Control
This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 29 proceedings End-to-End QoS Provisioning for Real-Tie Video
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationJoint Measurement- and Traffic Descriptor-based Admission Control at Real-Time Traffic Aggregation Points
Joint Measureent- and Traffic Descriptor-based Adission Control at Real-Tie Traffic Aggregation Points Stylianos Georgoulas, Panos Triintzios and George Pavlou Centre for Counication Systes Research, University
More informationRelocation of Gateway for Enhanced Timeliness in Wireless Sensor Networks Abstract 1. Introduction
Relocation of ateway for Enhanced Tieliness in Wireless Sensor Networks Keal Akkaya and Mohaed Younis Departent of oputer Science and Electrical Engineering University of Maryland, altiore ounty altiore,
More informationDYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION
www.arpnjournals.co DYNAMIC ESTIMATION OF BDP IN MANETS FOR EFFECTIVE NEXT NODE SELECTION N. Snehalatha 1 and Paul Rodrigues 2 1 School of Coputing, SRM University, Chennai, Tail Nadu, India 2 Departent
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationA Generic Architecture for Programmable Trac. Shaper for High Speed Networks. Krishnan K. Kailas y Ashok K. Agrawala z. fkrish,
A Generic Architecture for Prograable Trac Shaper for High Speed Networks Krishnan K. Kailas y Ashok K. Agrawala z fkrish, agrawalag@cs.ud.edu y Departent of Electrical Engineering z Departent of Coputer
More informationAdaptive Parameter Estimation Based Congestion Avoidance Strategy for DTN
Proceedings of the nd International onference on oputer Science and Electronics Engineering (ISEE 3) Adaptive Paraeter Estiation Based ongestion Avoidance Strategy for DTN Qicai Yang, Futong Qin, Jianquan
More informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More informationDesign Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems
Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationA Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada
More informationA Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationCOLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS
International Journal of Coputer Science and Counication Vol. 3, No. 1, January-June 2012, pp. 181-185 COLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS A.H. Karode 1, S.R. Suralkar 2, Manoj Bagde
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationControl Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols
Control Message Reduction Techniques in Backward Learning Ad Hoc Routing Protocols Navodaya Garepalli Kartik Gopalan Ping Yang Coputer Science, Binghaton University (State University of New York) Contact:
More informationRedundancy Level Impact of the Mean Time to Failure on Wireless Sensor Network
(IJACSA) International Journal of Advanced Coputer Science and Applications Vol. 8, No. 1, 217 Redundancy Level Ipact of the Mean Tie to Failure on Wireless Sensor Network Alaa E. S. Ahed 1 College of
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationBP-MAC: A High Reliable Backoff Preamble MAC Protocol for Wireless Sensor Networks
BP-MAC: A High Reliable Backoff Preable MAC Protocol for Wireless Sensor Networks Alexander Klein* Jirka Klaue Josef Schalk EADS Innovation Works, Gerany *Eail: klein@inforatik.uni-wuerzburg.de ABSTRACT:
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationDeterministic Voting in Distributed Systems Using Error-Correcting Codes
IEEE TRASACTIOS O PARALLEL AD DISTRIBUTED SYSTEMS, VOL. 9, O. 8, AUGUST 1998 813 Deterinistic Voting in Distributed Systes Using Error-Correcting Codes Lihao Xu and Jehoshua Bruck, Senior Meber, IEEE Abstract
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationCOMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT
COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More informationMulti Packet Reception and Network Coding
The 2010 Military Counications Conference - Unclassified Progra - etworking Protocols and Perforance Track Multi Packet Reception and etwork Coding Aran Rezaee Research Laboratory of Electronics Massachusetts
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationA Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction
MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao
More informationPERFORMANCE ANALYSIS OF THE UMTS SYSTEM FOR PACKET DATA TRANSFER OVER DEDICATED CHANNELS
PERFORMACE AALSIS OF THE MTS SSTEM FOR PACKET DATA TRASFER OVER DEDICATED CHAELS Manju Sarvagya, Ratna V. Raja Kuar Departent of Electronics and Electrical Counication Engineering Indian Institute of Technology,
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationImprove Peer Cooperation using Social Networks
Iprove Peer Cooperation using Social Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Noveber 5, 2007 Corresponding
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationTHE problem of transferring a data file or data stream. Reliable Point-to-point Underwater Acoustic Data Transfer: To Juggle or Not to Juggle?
1 Reliable Point-to-point Underwater Acoustic Data Transfer: To Juggle or Not to Juggle? Mandar Chitre, Senior Meber, IEEE, and Wee-Seng Soh, Meber, IEEE Abstract Reliable data transfer speeds using underwater
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationScheduling Parallel Task Graphs on (Almost) Homogeneous Multi-cluster Platforms
1 Scheduling Parallel Task Graphs on (Alost) Hoogeneous Multi-cluster Platfors Pierre-François Dutot, Tchiou N Takpé, Frédéric Suter and Henri Casanova Abstract Applications structured as parallel task
More informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationEquation Based Congestion Control for Video Transmission over WCDMA Networks
Equation Based Congestion Control for Video Transission over WCDMA Networks Antonios Alexiou, Diitrios Antonellis and Christos Bouras Research Acadeic Coputer Technology Institute, Greece and Coputer Engineering
More informationData-driven Hybrid Caching in Hierarchical Edge Cache Networks
Data-driven Hybrid Caching in Hierarchical Edge Cache Networks Abstract Hierarchical cache networks are increasingly deployed to facilitate high-throughput and low-latency content delivery to end users.
More informationEvaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS
Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.
More informationContent-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks
Content-Centric Multicast Beaforing in Cache-Enabled Cloud Radio Access Networks Hao Zhou, Meixia Tao, Erkai Chen, Wei Yu *Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationRavine Streams: Persistent Data Streams in Disruptive Sensor Networks
Ravine Streas: Persistent Data Streas in Disruptive Sensor Networks Mingsen Xu, Wen-Zhan Song Departent of Coputer Science, Georgia State University Atlanta, Georgia 333, USA Eail: {xu4@student.gsu.edu,
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationFinding Optimal Allocation of Constrained Cloud Capacity Using Hyperbolic Voronoi Diagrams on the Sphere
Intelligent Inforation Manageent 4 9-5 http://dxdoiorg/46/ii455 Published Online October (http://wwwciporg/ournal/ii) Finding Optial Allocation of Constrained Cloud Capacity Using Hyperbolic Voronoi Diagras
More informationA High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Membership Functions *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 21, 607-626 (2005) A High-Speed VLSI Fuzzy Inference Processor for Trapezoid-Shaped Mebership Functions * SHIH-HSU HUANG AND JIAN-YUAN LAI + Departent of
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationPrivacy-preserving String-Matching With PRAM Algorithms
Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationMinimax Sensor Location in the Plane
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location in the Plane To M. Cavalier The Pennsylvania State University University Par, PA 680 Enrique del Castillo The Pennsylvania
More informationA CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER
A CRYPTANALYTIC ATTACK ON RC4 STREAM CIPHER VIOLETA TOMAŠEVIĆ, SLOBODAN BOJANIĆ 2 and OCTAVIO NIETO-TALADRIZ 2 The Mihajlo Pupin Institute, Volgina 5, 000 Belgrade, SERBIA AND MONTENEGRO 2 Technical University
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationACNS: Adaptive Complementary Neighbor Selection in BitTorrent-like Applications
ACNS: Adaptive Copleentary Neighbor Selection in BitTorrent-like Applications Zhenbao Zhou 1, 2, Zhenyu Li 1, 2, Gaogang Xie 1 1 Institute of Coputing Technology, Chinese Acadey of Sciences, Beijing 100190,
More informationOptimal Route Queries with Arbitrary Order Constraints
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL.?, NO.?,? 20?? 1 Optial Route Queries with Arbitrary Order Constraints Jing Li, Yin Yang, Nikos Maoulis Abstract Given a set of spatial points DS,
More informationEffects of Interleaving on RTP Header Compression
Effects of Interleaving on RTP Header Copression Colin Perkins Jon Crowcroft Departent of Coputer Science University College London Gower Street London WCE 6BT Abstract We discuss the use of interleaving
More informationApproaching the Skyline in Z Order
Approaching the Skyline in Z Order KenC.K.Lee Baihua Zheng Huajing Li Wang-Chien Lee cklee@cse.psu.edu bhzheng@su.edu.sg huali@cse.psu.edu wlee@cse.psu.edu Pennsylvania State University, University Park,
More information2. PROBLEM DEFINITION AND APPLICATIONS 2.. The Scheduling and Wavelength Assignent (SWA) Proble We consider a set M of processors and a set J of n; n
On Scheduling Probles with Applications to Packet-Switched Optical WDM Networks Λ Evripidis Bapis George N. Rouskas LaMI, CNRS EP738 Departent of Coputer Science Université d'evry Val d'essonne Box 7534
More informationMAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer
MAPPING THE DATA FLOW MODEL OF COMPUTATION INTO AN ENHANCED VON NEUMANN PROCESSOR * Peter M. Maurer Departent of Coputer Science and Engineering University of South Florida Tapa, FL 33620 Abstract -- The
More informationQoS and Sensible Routing Decisions
QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of
More informationDynamical Topology Analysis of VANET Based on Complex Networks Theory
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volue 14, Special Issue Sofia 014 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.478/cait-014-0053 Dynaical Topology Analysis
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S
COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes
More information