Path Optimization for Inter-Switch Handoff in Wireless ATM Networks
|
|
- James Warren
- 5 years ago
- Views:
Transcription
1 Path Optimization for Inter-Switch Handoff in Wireless ATM Networks W. S. Vincent Wong, Henry C. B. Chan, and Victor C. M. Leung Department of Electrical and Computer Engineering University of British Columbia 2356 Main Mall, Vancouver BC, Canada V6T 24 { vincentw, chunc, Abstract Recently, a two-phase handoff protocol has been proposed to support inter-switch handoff in wireless ATM networks. It employs path extension for each inter-switch handoff, followed by path optimization if necessary. In this paper, we propose a number of path optimi,zation initiation schemes to facilitate the two-phase handoff protocol. The design objective is to determine the time to invoke path optimization such that the average cost per connection is minimized. Three path optimization schemes, namely: periodic, exponential, and Bernoulli, are proposed. A discrete-event simulation model is developed to compare their performance. Simulation results indicate that the Bernoulli path optimization scheme outperforms the other two schemes by providing a lower average cost per connection.. Introduction The phenomenal growth in cellular telephony over the past few years has stimulated active research in providing broadband multimedia to the mobile users. The advent of wireless ATM (Asynchronous Transfer Mode) [I] is intended to provide direct wireless extensions to the core ATM networks and services. In order to support mobility in ATM networks, a number of technical challenges need to be resolved [2]. Our work focuses on handoff control in wireless ATM networks. Handoff occurs when a mobile terminal moves from one base station to another. ATM handoff differs from traditional voice handoff in that a mobile user may have several active connections with different bandwidth requirements and quality-of-service (QoS) constraints. The handoff function should ensure that all these ongoing connections are rerouted to another access point in a seamless manner. In other words, the design goal is to prevent service disruptions and degradation during and after the handoff process. Recently, several connection rerouting protocols to facilitate inter-switch handoff have been proposed in the literature [3]-[8]. Two methods that are based upon partial re-establishment are the path extension and the path rerouting schemes. The rationale behind path extension is This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under a Postgraduate Scholarship and Grant OGP ; and by the Fessenden Postgraduate Scholarship from the Communications Research Centre, Industry Canada. to extend the original connection to the switch where the new base station is located. The switch to which the original base station is connected is usually referred to as the anchor switch, and the switch to which the new base station is connected is called the target switch [4]. The path extension method extends the connection from the anchor switch to the target switch during handoff. The minimum hop path is usually chosen as the extended path. The path extension scheme is fast and simple to implement. QoS degradations such as cell loss, duplicate cells, and mis-sequence cells do not occur. However, since the extended path is longer than the original one, certain QoS requirements, such as cell transfer delay and cell delay variation, may not be guaranteed after handoff. Path rerouting can be considered as a generalization of the path extension scheme. In path extension, the anchor switch extends the original connection to the target switch, while in path rerouting, any switch along the original connection can be selected to set up a branch connection to the target switch. The switch chosen to perform this function is usually referred to as the crossover switch [5] or the handofswitch [6]. Despite the fact that path rerouting has the potential of creating an optimal path, the time to determine the location of the crossover switch and the time for branch connection set up may exceed the stringent handoff delgy. Recently, a two-phase handoff protocol has been proposed [7] which combines the advantages of path extension and path rerouting schemes. It employs path extension to process handoff request immediately, followed by path optimization if necessary. The advantage of the two-phase handoff protocol is that path extension ensures a fast handoff while path optimization increases the network utilization by using a more efficient path. Since the mobile terminal is still communicating over the extended path via the current base station while path optimization takes place, this gives enough time for the network to perform the necessary functions while minimizing any service disruptions. To implement the two-phase handoff protocol, two important issues need to be addressed:. What are the procedures required for path optimization such that service disruptions are minimized? 2. When and how often should path optimization be performed? The first issue is concerned with network signaling to maintain ATM cells sequencing and minimize cell loss. Related work can be found in [9]. In this paper, we focus /98/$ EEE 65
2 Remote terminal Crossover the execution of path optimization, path extension can still be used to extend the connection to the target switch. Although path optimization can increase the network utilization by rerouting the connection to a more efficient route, transient QoS degradations such as ATM cell loss and an increase in cell delay variation may occur. In addition, path optimization increases the signaling load of the network. Thus, path optimization after each path extension may not be necessary or desirable. Mobile terminal Base station ATM switch OriginalVC PartialVC Optimal VC Figure. Two-Phase Handoff Protocol on the second issue by proposing a number of path optimization initiation schemes. These schemes provide the means of optimizing the frequency of path optimization with respect to the average cost per connection. The rest of the paper is organized as follows. Section 2 explains the two-phase handoff protocol in more detail. The proposed path optimization initiation schemes are described in Section 3. The simulation model employed for the comparisons of the schemes are presented in Section 4. Section 5 presents the simulation results. Conclusions and further research directions are given in Section 6. andoff Protocol The two-phase handoff protocol consists of two stages, namely: path extension and possible path optimization. Referring to Figure, when a mobile terminal moves to a new base station connecting to a different switch, an interswitch handoff request is generated. To maintain the call connectivity, in phase, path extension is used to establish a branch connection between the anchor switch and the target switch. Although path extension can be completed within a short time period, it may lengthen the path or increase the number of hops. In certain situations, loops can also be created. Therefore in the second phase, path optimization may be invoked to set up an optimal path between the source and the destination. In general, the major steps during path optimization execution involves:. Determining the location of the crossover switch; 2. Setting up a new branch connection; 3. Transferring the user information from the old branch connection to the new one; 4. Terminating the old branch connection. Notice that path optimization described above is not restricted to the two-phase handoff protocol, but it can also be applied to other connection rerouting protocols where the location of the crossover switch is not the optimal one. When the mobile terminal moves to another switch during 3. Path Optimization Schemes In general, path optimization can be grouped into four types, depending on how it is initiated. These schemes are explained below: 3. QoS-based As the name implies, QoS-based path optimization schemes trigger path optimization of each connection based on its current QoS measures. For example, path optimization can be initiated if the number of hops is greater than a certain number, or the end-to-end cell transfer delay bound is violated. To implement QoS-based path optimization schemes, information about the quality of the current path in terms of the defined QoS measure (e.g., hop count, current average delay) must be maintained by the network. 3.2 Network-based Network-based path optimization schemes trigger path optimizations for a group of connections based on the existing traffic load or the utilization of the network. For example, the edge switch can initiate path optimization for a group of mobile connections whenever the new call dropping probability of a certain traffic class reaches a certain threshold. 3.3 Time-based In this case, path optimization is triggered at time instants which are independent of the current QoS and the network load. The time instant can be deterministic or random. In this paper, we analyze two time-based schemes which are simple to implement.. Periodic path optimization scheme: The time to perform path optimization is periodic with period T. 2. Exponential path optimization scheme: The time to perform path optimization is modeled as an exponentially distributed random variable with mean /v. The periodic scheme has been proposed within the ATM Forum wireless ATh4 working group to facilitate the backward handoff protocol [lo]. Both the periodic and the exponential schemes trigger path optimization independent of whether or not there is an inter-switch handoff. Thus, unnecessary path optimizations may be performed for stationary mobile connections. 3.4 Random-based Random-based path optimization schemes trigger path optimization for each mobile connection based on some 6 6
3 00 I I Table : Summary of parameters used in simulation : 0 item symbol value number of nodes in the network N size of the rectangular coordinate grid 00 x 00 maximum queueing delay (ms) 6max 00 time between inter-switch handoff (min) /h 5 average call duration (minutes) /cl 2 I signaling cost per path extension CPE signaling cost per path optimization ; C vm:,le link cost per unit time per link Clink 0.2- path optimization rate path optimization period (minutes) variable Horizontal Distance path optimization probability variable - Figure 2. A -node random graph with node degree of 4; minimum distance between any two nodes is 5. random processes after each inter-switch handoff. In this paper, we also analyze the following scheme: 0 Bernoulli path optimization scheme: After each path extension, there is a probability p, 0 I p I, such that path optimization is performed. For the Bernoulli scheme, a path optimization may only occur on the condition that there is an inter-switch handoff. Thus, no path optimization is triggered after each handoff when p = 0. On the other hand, path optimization is performed after each path extension when p =. In the remaining of this paper, we will compare the performance of the periodic, exponential, and the Bernoulli path optimization schemes, and determine how to assign the optimal values for V, T and p given a set of call and mobility parameters. 4. Simulation Model In this section, we present the framework of the simulation model for the comparisons of different path optimization initiation schemes for the two-phase handoff protocol. An ATM network is modeled as a random graph based on the minimum spanning tree. The generation of the random graph consists of the following steps [ll]:. N nodes are randomly distributed over a rectangular coordinate grid. Each node is placed at a location with integer coordinates. A node can be rejected if it is too close to another node. The Euclidean metric is then used to determine the distance d(i, j ) between each pair of nodes (i, j). 2. A fully connected graph is constructed with the link weight equals to the Euclidean distance. 3. Based on the fully connected graph, a minimum spanning tree is constructed. To achieve a specified average node degree of the graph, edges are added one at a time with increasing distance. If node i and j are connected, then the link delay, denote as d.., is equal to: J dij = d(i, j) + 6 () where 6 is a uniformly distributed random variable in the range 0 I 6, I, a,. In equation. (l), the first term can be interpreted as the propagation delay of the link, and the second term as the queueing delay of the link. Note that if the second term is removed, then for any pair of nodes, the shortest delay path and the minimum hop path are the same. For the simulation, a -node random graph is generated from the above model. The size of the rectangular coordinate grid is 00 x 00. The average node degree of the graph is 4. For equation (l), 6,,, is set to be equal to 00. The network model is shown in Figure 2. Each node represents an ATM switch and each edge represents a physical link connecting the two switches. For each simulation run, two nodes are chosen randomly as the source node and the destination node. Dijskstra s algorithm [ 2 is used to compute the shortest delay path between these two nodes. The source node is assumed to be stationary. The destination node becomes the anchor switch of the mobile connection. The call duration and the time between inter-switch handoffs are modeled as exponentially distributed random variables with mean /p and / h, respectively. During each inter-switch handoff, the target switch is restricted to be one of the neighboring switches of the current anchor switch. Path extension is used to extend the connection from the anchor switch to the target switch. Subsequent path optimizations may be triggered based on different initiation schemes described in Section 3. The performance metric is the average cost of the call, which is defined as the sum of the link cost and the signaling cost due to inter-switch handoff. We let: Clink denote the link cost per unit time per link, CPE denote the signaling cost for each path extension event,, C, denote the signaling cost for each path optimization event. 6 7
4 60 c 0" k 00 % 80 El 60 c,, = _... c 0" 00 a, Path Optimization Period Figure 3. Periodic path optimization scheme The cost of the call is defined as: Cost = npecpe + npocpo + m i= where npe and npo denote the number of path extension and path optimization, respectively; m is the number of events per call; 2, denotes the elapsed time between event i - and i; and, denotes the number of links between two end nodes during 2,. The total link cost of the call, which captures the amount network resources used per connection, is a function of time and the number of links. The total signaling cost due to path extension and path optimization captures the processing complexity at the base station and sktches to perform those functions. Since we are only interested in the relative performance between different path optimization schemes, other signaling cost including the cost for call setup and termination, as well as the cost for location update and intra-switch handoff are not considered in this paper. In general, path optimization is more complex than path extension, so that the cost to perform path optimization is higher than the cost to perform path extension. Thus, it is reasonable to assume that Cpo >> CPE. In addition, for convenience, Clink and Cpo are normalized with respect to CpE. The simulation model described above can be extended to handle other network topologies (e.g., star, ring, and hierarchical), as well as other statistical distributions for the call duration and the time between interswitch handoff. The baseline simulation parameters are summarized in Table. Figures 3-5 show the simulation results for the periodic, exponential, and the Bernoulli path optimization schemes, respectively. For each scheme, given a link cost I Path Optimization Rate Figure 4. Exponential path optimization scheme Clink, there exists an optimal value or a range of values of T, v, or p, such that the average cost per connection is minimized. For example, in Figure 3, when Clrnk =, the optimal path optimization period Tis 8 minutes. These optimal values or the range of optimal values are the operating points or operating interval of that particular path optimization scheme. Results also show that the average cost per connection is sensitive to the changes in link cost Clrnk. This indicates that the last term in equation (2) is the dominant term of the average cost per connection. Figure 6 shows the performance comparisons between different path optimization schemes. The Bernoulli scheme for p = 0 and p = are also included for comparisons. For each path optimization scheme, its optimal value of T, v, or p, is chosen to give minimum average cost per connection. As shown Figure 6, the average cost per connection for the Bernoulli p = 0 case is much higher than the other schemes once Clink This justifies the importance of using path optimization. In general, the exponential scheme has a higher cost than both periodic and Bernoulli schemes. On the whole, the performance between the periodic and the Bernoulli schemes are very close. The Bernoulli scheme slightly outperforms the periodic scheme when Clink 2 0.8, The performances of the optimal- p and p = Bernoulli schemes are almost the same once Clink 2 0.6, which indicates that the optimal p value for the Bernoulli scheme is. Other simulations results for different values of h and p also indicate that the Bernoulli scheme has a better performance over other schemes. 6. Conclusions In this paper, we have proposed a number of path optimization initiation schemes and analyzed three schemes in particular (namely: exponential, periodic, and Bernoulli) to facilitate the two-phase handoff protocol. The design objective is to determine the time to invoke 6 8
5 60 I 60 Bernoulli (p = 0) Exponential Periodic c 0 & 00 s 9 80 a I Path Optimization Probability Figure 5. Bernoulli path optimization scheme path optimization such that the average cost of the connection is minimized. A discrete event simulation model has been developed to compare the performance of these schemes. Simulation results indicate that the Bernoulli path optimization scheme outperforms the other two schemes by providing a lower average cost per connection. Analytical work for the three path optimization schemes is in progress. Given the call and mobility parameters as well as the network costs, we believe there exists an optimal strategy to trigger path optimization after each path extension. Further work will include analyzing some other QoS-based and network-based path optimization schemes, as well as formulating the path optimization initiation problem as a stochastic optimization problem. References [l] D. Raychaudhuri and N. D. Wilson, ATM-Based Transport Architecture for Multiservices Wireless Personal Communication Networks, IEEE Journal on Selected Areas in Communications, vol. 2, no. 8, pp. -44, October 994. [2] IEEE Communications Magazine, Special Issue on Introduction to Mobile and Wireless ATM, vol. 35, no., November 997. [3] A. S. Acampora and M. Naghshineh, An Architecture and Methodology for Mobile-Executed Hand-off in Cellular ATM Networks, IEEE Journal on Selected Areas in Communications, vol. 2, no. 8, pp , October 994. [4] B. A. Akyol and D. C. Cox, Signaling Alternatives in a Wireless ATM Network, IEEE Journal on SelectedAreas in Communications, vol. 5, no., pp , January 997. n Clink Figure 6. Comparisons between different path optimization schemes C.-K. Toh, Performance Evaluation of Crossover Switch Discovery Algorithms for Wireless ATM LANs, Proceedings of IEEE INFOCOM 96, San Francisco, CA, pp , 996. R. Yuan, S. K. Biswas, and D. Raychaudhuri, A Signaling and Control Architecture for Mobility Support in Wireless ATM Networks, Proceedings of IEEE ICC 96, Dallas, Texas, pp , 996. M. Veeraraghavan, M. Karol, and K. Y. Eng, A Combined Handoff Scheme for Mobile ATM Networks, ATM Forum Contribution , December 996. B. A. J. Banh, G. J. Anido, and E. Dutkiewicz, Handover Re-routing Schemes for Connection Oriented Services in Mobile ATM Networks, Proceedings of IEEE INFOCOM 98, San Francisco, CA, pp , 998. W. S. V. Wong and V. C. M. Leung, A Path Optimization Signaling Protocol for Inter-Switch Handoff in Wireless ATM Networks, Proceedings of st International Workshop on Wireless Mobile ATM Implementation (wmatm 98), Hangzhou, China, pp , April 998. [lo] The ATM Forum Wireless ATM Working Group, Baseline Text for Wireless ATM Specifications, BTD- WATM-0.07, April 998. [ll] M. B. Doar, A Better Model for Generating Test Networks, Proceedings of IEEE GLOBECOM 96, London, UK, pp , 996. [ 2 D. Bertsekas and R. Gallager, Data Networks, second edition, Englewood Cliffs, NJ: Prentice Hall,
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract
More informationArtificial Intelligence Breadth-First Search and Heuristic
Artificial Intelligence Breadth-First Search and Heuristic Chung-Ang University, Jaesung Lee The original version of this content is came from MIT OCW of MIT Electrical Engineering and Computer Science
More informationAbstract. 1 Introduction
Intermodal transportation in urban framework: a discrete-events simulative approach A. Di Febbraro", V. Recagno* & S. Sacone" ^Department of Communications, Computer, and System Sciences Dipartimento di
More informationRailroad Yard Location Optimization Using A Genetic Algorithm
Railroad Yard Location Optimization Using A Genetic Algorithm AVIJIT MAJI Office of Traffic and Safety Maryland State Highway Administration 7491 Connelley Drive, Hanover, MD 2176 USA avit.maji@gmail.com
More informationLOAD SHARING IN HETEROGENEOUS DISTRIBUTED SYSTEMS
Proceedings of the 2 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowdon, and J. M. Charnes, eds. LOAD SHARING IN HETEROGENEOUS DISTRIBUTED SYSTEMS Helen D. Karatza Department of Informatics
More informationSUPPORT FOR applications requiring quality-of-service
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 6, NO. 6, DECEMBER 1998 811 Real-Time Estimation and Dynamic Renegotiation of UPC Parameters for Arbitrary Traffic Sources in ATM Networks Brian L. Mark, Member,
More informationSOCIAL MEDIA MINING. Behavior Analytics
SOCIAL MEDIA MINING Behavior Analytics Dear instructors/users of these slides: Please feel free to include these slides in your own material, or modify them as you see fit. If you decide to incorporate
More informationPaper 30 Centralized versus Market-based Task Allocation in the Presence of Uncertainty
Paper 30 Centralized versus Market-based Task Allocation in the Presence of Uncertainty Abstract While there have been some efforts to compare centralized versus market based approaches to general task
More informationJob Communication Characterization and its Impact on Meta-scheduling Co-allocated Jobs in a Mini-grid
Job Communication Characterization and its Impact on Meta-scheduling Co-allocated Jobs in a Mini-grid William M. Jones Louis W. Pang Dan Stanzione Walter B. Ligon III 864-656-7367 864-656-7367 703-292-8121
More informationMetaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics
Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,
More informationProceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds.
Proceedings of the Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. DYNAMIC ADJUSTMENT OF REPLENISHMENT PARAMETERS USING OPTIMUM- SEEKING SIMULATION
More informationClairvoyant Site Allocation of Jobs with Highly Variable Service Demands in a Computational Grid
Clairvoyant Site Allocation of Jobs with Highly Variable Service Demands in a Computational Grid Stylianos Zikos and Helen Karatza Department of Informatics Aristotle University of Thessaloniki 54124 Thessaloniki,
More informationSimultaneous Perspective-Based Mixed-Model Assembly Line Balancing Problem
Tamkang Journal of Science and Engineering, Vol. 13, No. 3, pp. 327 336 (2010) 327 Simultaneous Perspective-Based Mixed-Model Assembly Line Balancing Problem Horng-Jinh Chang 1 and Tung-Meng Chang 1,2
More informationState-Dependent Pricing and Its Economic Implications 1
Telecommunication Systems Journal, Vol. 18, No. 4, pp. 315-29, Dec. 2001 State-Dependent Pricing and Its Economic Implications 1 Qiong Wang 2 and Jon Peha 3 Abstract: In a packet-switched integrated-services
More informationAnt Colony Optimization
Ant Colony Optimization Part 2: Simple Ant Colony Optimization Fall 2009 Instructor: Dr. Masoud Yaghini Outline Ant Colony Optimization: Part 2 Simple Ant Colony Optimization (S-ACO) Experiments with S-ACO
More informationAn Adaptive Pricing Scheme for Content Delivery Systems
An Adaptive Pricing Scheme for Content Delivery Systems Srinivasan Jagannathan & Kevin C. Almeroth Department of Computer Science University of California Santa Barbara, CA 936-5 fjsrini,almerothg@cs.ucsb.edu
More informationMulti-objective Evolutionary Optimization of Cloud Service Provider Selection Problems
Multi-objective Evolutionary Optimization of Cloud Service Provider Selection Problems Cheng-Yuan Lin Dept of Computer Science and Information Engineering Chung-Hua University Hsin-Chu, Taiwan m09902021@chu.edu.tw
More informationRouting Optimization of Fourth Party Logistics with Reliability Constraints based on Messy GA
Journal of Industrial Engineering and Management JIEM, 2014 7(5) : 1097-1111 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.1126 Routing Optimization of Fourth Party Logistics
More informationUSING SIMULATION MODELING TO ASSESS RAIL TRACK INFRASTRUCTURE IN DENSELY TRAFFICKED METROPOLITAN AREAS
Proceedings of the 22 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowdon, and J. M. Charnes, eds USING SIMULATION MODELING TO ASSESS RAIL TRACK INFRASTRUCTURE IN DENSELY TRAFFICKED METROPOLITAN
More informationResource Allocation Strategies in a 2-level Hierarchical Grid System
st Annual Simulation Symposium Resource Allocation Strategies in a -level Hierarchical Grid System Stylianos Zikos and Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5
More informationDual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems.
Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems Robert Davis Real-Time Systems Research Group, Department of Computer Science, University of York, Y1 5DD, England Email:
More informationIncreasing Wireless Revenue with Service Differentiation
Increasing Wireless Revenue with Service Differentiation SIAMAK AYANI and JEAN WALRAND Department of Electrical Engineering and Computer Sciences University of California at Berkeley, Berkeley, CA 94720,
More informationA multi-train movement simulator with moving
A multi-train movement simulator with moving block signalling Mark T.K. Ho Department of Electrical Engineering Hong Kong Polytechnic University Hung Horn, Kowloon, Hong Kong Email: eetkho@polyu.edu. hk
More informationPredicting the Operational Effectiveness of Aircraft Survivability Equipment Suite
2012 World Conference on Science and Engineering (WCSE 2012) IPCSIT Press, Singapore Predicting the Operational Effectiveness of Aircraft Survivability Equipment Suite Sanguk Noh 1 and Chaetaek Choi 2
More informationCELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING. February 22, Randolph Hall Boontariga Kaseemson
CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING February 22, 2005 Randolph Hall Boontariga Kaseemson Department of Industrial and Systems Engineering University of Southern California Los
More informationABSTRACT. Timetable, Urban bus network, Stochastic demand, Variable demand, Simulation ISSN:
International Journal of Industrial Engineering & Production Research (09) pp. 83-91 December 09, Volume, Number 3 International Journal of Industrial Engineering & Production Research ISSN: 08-4889 Journal
More information1. For s, a, initialize Q ( s,
Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS
More informationWHEN THE SMART GRID MEETS ENERGY-EFFICIENT COMMUNICATIONS: GREEN WIRELESS CELLULAR NETWORKS POWERED BY THE SMART GRID
WHEN THE SMART GRID MEETS ENERGY-EFFICIENT COMMUNICATIONS: GREEN WIRELESS CELLULAR NETWORKS POWERED BY THE SMART GRID Authors S. Bu, F. R. Yu, Y. Cai, and X. P. Liu IEEE Transactions on Wireless Communications,
More informationDetermining the Effectiveness of Specialized Bank Tellers
Proceedings of the 2009 Industrial Engineering Research Conference I. Dhillon, D. Hamilton, and B. Rumao, eds. Determining the Effectiveness of Specialized Bank Tellers Inder S. Dhillon, David C. Hamilton,
More informationWebShipCost - Quantifying Risk in Intermodal Transportation
WebShipCost - Quantifying Risk in Intermodal Transportation Zhe Li, Heather Nachtmann, and Manuel D. Rossetti Department of Industrial Engineering University of Arkansas Fayetteville, AR 72701, USA Abstract
More informationTHE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS
THE VALUE OF DISCRETE-EVENT SIMULATION IN COMPUTER-AIDED PROCESS OPERATIONS Foundations of Computer Aided Process Operations Conference Ricki G. Ingalls, PhD Texas State University Diamond Head Associates,
More informationClock-Driven Scheduling
NOTATIONS AND ASSUMPTIONS: UNIT-2 Clock-Driven Scheduling The clock-driven approach to scheduling is applicable only when the system is by and large deterministic, except for a few aperiodic and sporadic
More informationSIDT 2015 Transport Systems Methods and Technologies POLITECNICO DI TORINO SEPTEMBER 14-15, 2015
Transport Systems Methods and Technologies POLITECNICO DI TORINO SEPTEMBER 14-15, SESSION 6: Methods and models for data analysis on transport demand and supply A Transportation Network Design Model with
More informationNumerical investigation of tradeoffs in production-inventory control policies with advance demand information
Numerical investigation of tradeoffs in production-inventory control policies with advance demand information George Liberopoulos and telios oukoumialos University of Thessaly, Department of Mechanical
More informationOPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03
OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves
More informationIntegrating New Cost Model into HMA-Based Grid Resource Scheduling
Integrating New Cost Model into HMA-Based Grid Resource Scheduling Jun-yan Zhang, Fan Min, and Guo-wei Yang College of Computer Science and Engineering, University of Electronic Science and Technology
More informationLOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS
Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department
More informationPricing with Bandwidth Guarantees for Clients with multi-isp Connections
Pricing with Bandwidth Guarantees for Clients with multi-isp Connections Rohit Tripathi and Gautam Barua Department of Computer Science and Engineering Indian Institute of Technology, Guwahati Guwahati-78039,
More information/00/$10.00 (C) 2000 IEEE
Synthesis of Self-Replication Cellular Automata using Genetic Algorithms Hiroshi Kajisha and Toshimichi Saito EEE Dept., HOSEI Univ., Tokyo, 184-8584, JAPAN Abstract: This paper presents an efficient searching
More informationPricing for Market Segmentation in Data Networks
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 1996 Proceedings Americas Conference on Information Systems (AMCIS) 8-16-1996 Pricing for Market Segmentation in Data Networks Philipp
More informationScalability Investigations on Communication Traffic in Distributed Routing of Autonomous Logistic Objects
Scalability Investigations on Communication Traffic in Distributed Routing of Autonomous Logistic Objects Bernd-Ludwig Wenning Communication Networks University of Bremen Otto-Hahn-Allee, 28359 Bremen,
More informationA simulation-based risk analysis technique to determine critical assets in a logistics plan
19th International Congress on Modelling and Simulation, Perth, Australia, 12 16 December 2011 http://mssanz.org.au/modsim2011 A simulation-based risk analysis technique to determine critical assets in
More informationAnalysis and Modelling of Flexible Manufacturing System
Analysis and Modelling of Flexible Manufacturing System Swetapadma Mishra 1, Biswabihari Rath 2, Aravind Tripathy 3 1,2,3Gandhi Institute For Technology,Bhubaneswar, Odisha, India --------------------------------------------------------------------***----------------------------------------------------------------------
More informationUniversity Question Paper Two Marks
University Question Paper Two Marks 1. List the application of Operations Research in functional areas of management. Answer: Finance, Budgeting and Investment Marketing Physical distribution Purchasing,
More informationWorkload Engineering: Optimising WAN and DC Resources Through RL-based Workload Placement
Workload Engineering: Optimising WAN and Resources Through RL-based Workload Placement Ruoyang Xiu Google rxiu@google.com John Evans Cisco john.evans@cisco.com ABSTRACT With the rise in data centre virtualization,
More informationC. Wohlin, P. Runeson and A. Wesslén, "Software Reliability Estimations through Usage Analysis of Software Specifications and Designs", International
C. Wohlin, P. Runeson and A. Wesslén, "Software Reliability Estimations through Usage Analysis of Software Specifications and Designs", International Journal of Reliability, Quality and Safety Engineering,
More informationCooperation Techniques for A Cellular Internet of Unmanned Aerial Vehicles
1 Cooperation Techniques for A Cellular Internet of Unmanned Aerial Vehicles Hongliang Zhang, Lingyang Song, Zhu Han, and H. Vincent Poor School of Electrical Engineering and Computer Science, Peking University,
More informationAnt Colony Optimisation
Ant Colony Optimisation Alexander Mathews, Angeline Honggowarsito & Perry Brown 1 Image Source: http://baynature.org/articles/the-ants-go-marching-one-by-one/ Contents Introduction to Ant Colony Optimisation
More informationIntroduction. The Traditional Approach
A simplified approach to transportation system planning M. Galaverna, V. Recagno Dipartimento di Ingegneria Elettrica, University of Genova, Via air Opera Pia 11 a, 1-16145 Genova, Italy Introduction The
More informationHeuristic Algorithms for Simultaneously Accepting and Scheduling Advertisements on Broadcast Television
ISSN 1746-7659, England, UK Journal of Information and Computer Science Vol. 1, No. 4, 2006, pp. 245-251. Heuristic Algorithms for Simultaneously Accepting and Scheduling Advertisements on Broadcast Television
More informationIntroduction to Project Management
Introduction to Project Management Chapter 7 Managing Project Resources Information Systems Project Management: A Process and Team Approach, 1e Fuller/Valacich/George 2008 Prentice Hall 7-1 Project Resources
More informationA Improved Frame Slotted Aloha Protocol with Early End in Mobile RFID Systems
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com A Improved Frame Slotted Aloha Protocol with Early End in Mobile RFID Systems 1 Xiaowu Li, 2 Zhenjiang Wang, 3 Xin Ren, 4 Yuyan Liu, 5 Qing
More informationToward Effective Multi-capacity Resource Allocation in Distributed Real-time and Embedded Systems
Toward Effective Multi-capacity Resource Allocation in Distributed Real-time and Embedded Systems Nilabja Roy, John S. Kinnebrew, Nishanth Shankaran, Gautam Biswas, and Douglas C. Schmidt Department of
More informationA Queuing Approach for Energy Supply in Manufacturing Facilities
A Queuing Approach for Energy Supply in Manufacturing Facilities Lucio Zavanella, Ivan Ferretti, Simone Zanoni, and Laura Bettoni Department of Mechanical and Industrial Engineering Università degli Studi
More informationProceedings of the 2017 Winter Simulation Conference W. K. V. Chan, A. D'Ambrogio, G. Zacharewicz, N. Mustafee, G. Wainer, and E. Page, eds.
Proceedings of the 2017 Winter Simulation Conference W. K. V. Chan, A. D'Ambrogio, G. Zacharewicz, N. Mustafee, G. Wainer, and E. Page, eds. DESIGN AND SIMULATION ANALYSIS OF : A MULTIPLE-LOAD AUTOMATED
More informationSeparation Assurance in the Future Air Traffic System
ENRI International Workshop on ATM/CNS. Tokyo, Japan. (EIWAC 2009). Separation Assurance in the Future Air Traffic System H. Erzberger Adjunct Professor of Electrical Engineering University of California,
More informationEvolutionary Algorithms
Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or
More informationPaying for QoS: An Optimal Distributed Algorithm for Pricing Network Resources
Proceedings of the Sixth International Workshop on Quality of Service, pages 75-84, 1998 Paying for QoS: An Optimal Distributed Algorithm for Pricing Network Resources Errin W Fulp, Maximilian Ott, Daniel
More informationStation in Smart Grid Environment
Adaptive Power Management for Wireless Base 1 Station in Smart Grid Environment Dusit Niyato, Xiao Lu, and Ping Wang School of Computer Engineering, Nanyang Technological University, Singapore. arxiv:1401.7141v1
More informationFactory Operations Research Center (FORCe II)
Factory Operations Research Center (FORCe II) SRC/ISMT 2004-OJ-1214 Configuration, monitoring and control of semiconductor supply chains Jan. 7, 2005 Shi-Chung Chang (task 1) Argon Chen (task 2) Yon Chou
More informationPERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS
PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS N. VISWANADHAM Department of Computer Science and Automation Indian Institute of Science Y NARAHARI Department of Computer Science and Automation
More informationweather monitoring, forest fire detection, traffic control, emergency search and rescue A.y. 2018/19
UAVs are flying vehicles able to autonomously decide their route (different from drones, that are remotely piloted) Historically, used in the military, mainly deployed in hostile territory to reduce pilot
More informationAn Adaptive Pricing Scheme for Content Delivery Systems
An Adaptive Pricing Scheme for Content Delivery Systems Srinivasan Jagannathan & Kevin C. Almeroth Department of Computer Science University of California Santa Barbara, CA 936-5 jsrini,almeroth @cs.ucsb.edu
More informationTowards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems
Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems Mehdi Sliem 1(B), Nabila Salmi 1,2, and Malika Ioualalen 1 1 MOVEP Laboratory, USTHB, Algiers, Algeria {msliem,nsalmi,mioualalen}@usthb.dz
More informationIntegrated Stochastic Network Model for a Reliability Assessment of the NEES. Esteban Gil Iowa State University August 30 th, 2005
Integrated Stochastic Network Model for a Reliability Assessment of the NEES Esteban Gil Iowa State University August 30 th, 2005 Outline Motivation. Integrated stochastic network model Modeling challenges.
More informationCHAPTER 6 DYNAMIC SERVICE LEVEL AGREEMENT FOR GRID RESOURCE ALLOCATION
158 CHAPTER 6 DYNAMIC SERVICE LEVEL AGREEMENT FOR GRID RESOURCE ALLOCATION 6.1 INTRODUCTION In a dynamic and heterogeneous Grid environment providing guaranteed quality of service for user s job is fundamentally
More informationProceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds.
Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds. SIMULATION-BASED CONTROL FOR GREEN TRANSPORTATION WITH HIGH DELIVERY SERVICE
More informationMetaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example.
Metaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example Amina Lamghari COSMO Stochastic Mine Planning Laboratory! Department
More informationInternational Journal of Advanced Engineering Technology E-ISSN
International Journal of Advanced Engineering Technology E-ISSN 976-3945 Research Paper A SIMULATION STUDY AND ANALYSIS OF JOB RELEASE POLICIES IN SCHEDULING A DYNAMIC FLEXIBLE JOB SHOP PRODUCTION SYSTEM
More informationNew Solution Deployment: Best Practices White Paper
New Solution Deployment: Best Practices White Paper Document ID: 15113 Contents Introduction High Level Process Flow for Deploying New Solutions Solution Requirements Required Features or Services Performance
More informationRehandling Strategies for Container Retrieval
Rehandling Strategies for Container Retrieval Tonguç Ünlüyurt and Cenk Aydin Sabanci University, Faculty of Engineering and Natural Sciences e-mail: tonguc@sabanciuniv.edu 1 Introduction In this work,
More informationDesigning Guest Flow and Operations Logistics for the Dolphin Tales
Designing Guest Flow and Operations Logistics for the Dolphin Tales The Team The Aquarium Joseph Handy Alex Desiderio Ruth Lopez Brian Davis Georgia Tech Eva K Lee Chien Hung Chen Niquelle Brown Tsung
More informationAutomatic Neighboring BS List Generation Scheme for Femtocell Network
Automatic Neighboring BS List Generation Scheme for Femtocell Network Kwanghun Han, Seungmin Woo, Duho Kang, and Sunghyun Choi School of Electrical Engineering and INMC, Seoul National University, Seoul,
More informationLIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY
LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY .r ALFRED P. WORKING PAPER SLOAN SCHOOL OF MANAGEMENT STOCHASTIC CONSUMER MODELS SOME EMPIRICAL RESULTS* DAVID B. 339-68 MONTGOMERY** MASS. inst. AUG
More informationMidterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 2003
Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 003 The midterm is open book/open notes. Total value is 100 points (30% of course grade). All questions are equally
More informationChapter 6: CPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. CPU Scheduler. Dispatcher. Alternating Sequence of CPU And I/O Bursts
Chapter 6: CPU Scheduling Basic Concepts Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Maximum CPU utilization obtained
More informationGlobal Journal of Advance Engineering Technology and Sciences
Global Journal of Advanced Engineering Technologies and Sciences AN IMPROVED MODEL FOR ATM IN A WIRELESS COMMUNICATION NETWORK USING QUEUING TECHNIQUE Orji Hope Ekpereamaka *1, Udeh Ikemefuna James 2,
More informationSIMULATION OF CONSTRUCTION OPERATION WITH DIRECT INPUTS OF PHYSICAL FACTORS Simulation with first-order factors
SIMULATION OF CONSTRUCTION OPERATION WITH DIRECT INPUTS OF PHYSICAL FACTORS Simulation with first-order factors L.C. CHAO School of Building and Real Estate, National University of Singapore, Singapore
More informationGenerational and steady state genetic algorithms for generator maintenance scheduling problems
Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.
More informationMultiUAV2 Agent Swarming for Distributed ATR Simulation
University of Arkansas, Fayetteville ScholarWorks@UARK Computer Science and Computer Engineering Undergraduate Honors Theses Computer Science and Computer Engineering 5-2008 MultiUAV2 Agent Swarming for
More informationA SAT Approach for Solving the Staff Transfer Problem
A SAT Approach for Solving the Staff Transfer Problem S. Acharyya, A. Bagchi, Abstract An important issue in Human Resource Management is the assignment of transfer postings to employees in a large organization
More informationA Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems
A Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems André Scholz Gerhard Wäscher Otto-von-Guericke University Magdeburg, Germany Faculty of Economics
More informationSYSTEM splitting, also called controlled system islanding,
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 20, NO. 1, FEBRUARY 2005 389 A Simulation Study of OBDD-Based Proper Splitting Strategies for Power Systems Under Consideration of Transient Stability Kai Sun,
More informationWE consider the dynamic pickup and delivery problem
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 53, NO. 6, JULY 2008 1419 A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints Holly A. Waisanen, Devavrat Shah, and Munther
More informationTactical Planning using Heuristics
Tactical Planning using Heuristics Roman van der Krogt a Leon Aronson a Nico Roos b Cees Witteveen a Jonne Zutt a a Delft University of Technology, Faculty of Information Technology and Systems, P.O. Box
More informationOptimizing the supply chain configuration with supply disruptions
Lecture Notes in Management Science (2014) Vol. 6: 176 184 6 th International Conference on Applied Operational Research, Proceedings Tadbir Operational Research Group Ltd. All rights reserved. www.tadbir.ca
More informationForward and Reverse message encoding for bacteria nanonetworks
Forward and Reverse message encoding for bacteria nanonetworks Vitaly Petrov 1, Sasitharan Balasubramaniam 1, Yevgeni Koucheryavy 1, Mikael Skurnik 2 Nano Communications Center (TUT-NCC) 1 Tampere University
More informationService Proveider s Optimal Pricing for PVC and SVC Service
The University of Kansas Technical Report Service Proveider s Optimal Pricing for PVC and SVC Service Yuhong Liu and David W. Petr ITTC-FY2000-TR-18836-02 December 1999 Project Sponsor: Sprint Corporation
More informationCE 191: Civil and Environmental Engineering Systems Analysis. LEC 06 : Integer Programming
CE 191: Civil and Environmental Engineering Systems Analysis LEC 06 : Integer Programming Professor Scott Moura Civil & Environmental Engineering University of California, Berkeley Fall 2014 Prof. Moura
More informationGroup #2 Project Final Report: Information Flows on Twitter
Group #2 Project Final Report: Information Flows on Twitter Huang-Wei Chang, Te-Yuan Huang 1 Introduction Twitter has become a very popular microblog website and had attracted millions of users up to 2009.
More informationAn-Najah National University Faculty of Engineering Industrial Engineering Department. System Dynamics. Instructor: Eng.
An-Najah National University Faculty of Engineering Industrial Engineering Department System Dynamics Instructor: Eng. Tamer Haddad Introduction Knowing how the elements of a system interact & how overall
More informationDetermination of Smart Inverter Control Settings to Improve Distribution System Performance
21, rue d Artois, F-75008 PARIS CIGRE US National Committee http : //www.cigre.org 2014 Grid of the Future Symposium Determination of Smart Inverter Control Settings to Improve Distribution System Performance
More informationFlexible Provisioning of Service Workflows
Flexible Provisioning of Service Workflows Sebastian Stein and Nicholas R. Jennings and Terry R. Payne 1 Abstract. Service-oriented computing is a promising paradigm for highly distributed and complex
More informationWelcome to the Eastwood Harris Pty Ltd Primavera P6 Versions 8.2 EPPM Web Tool 2 day training course Enterprise Portfolio Project Management
Welcome to the Eastwood Harris Pty Ltd Primavera P6 Versions 8.2 EPPM Web Tool 2 day training course Enterprise Portfolio Project Management Page 2 Copyright Eastwood Harris Pty Ltd IMPORTANT POINTS FOR
More informationNAS-Wide Performance: Impact of Select Uncertainty Factors and Implications for Experimental Design
Approved for Public Release: 12-0370. Distribution Unlimited. NAS-Wide Performance: Impact of Select Uncertainty Factors and Implications for Experimental Design Gareth O. Coville, MITRE Corporation Billy
More informationModeling Heterogeneous User. Churn and Local Resilience of Unstructured P2P Networks
Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks Zhongmei Yao Joint work with Derek Leonard, Xiaoming Wang, and Dmitri Loguinov Internet Research Lab Department of Computer
More informationADAPTIVE RESOURCES PROVISIONING FOR GRID APPLICATIONS AND SERVICES
ADAPTIVE RESOURCES PROVISIONING FOR GRID APPLICATIONS AND SERVICES A. Filali and A. S. Hafid Network Research Lab University of Montreal, Canada Email {afilali, ahafid}@iro.umontreal.ca Abstract - Applications
More informationWe consider a distribution problem in which a set of products has to be shipped from
in an Inventory Routing Problem Luca Bertazzi Giuseppe Paletta M. Grazia Speranza Dip. di Metodi Quantitativi, Università di Brescia, Italy Dip. di Economia Politica, Università della Calabria, Italy Dip.
More informationWorkflow Management Business (Re)Engineering
Workflow Management Business (Re)Engineering Workflows and Web Services Kapitel 7 1 The Notion of Business (Re)Engineering Business Reengineering = The fundamental rethinking and radical redesign of business
More informationAirline Disruptions: Aircraft Recovery with Maintenance Constraints
1 Airline Disruptions: Aircraft Recovery with Maintenance Constraints Niklaus Eggenberg Dr. Matteo Salani and Prof. Michel Bierlaire In collaboration with APM Technologies Funded by CTI Switzerland 2 Dr.
More information