• Title/Summary/Keyword: delay constraints

Search Result 240, Processing Time 0.022 seconds

Multi-Objective Handover in LTE Macro/Femto-Cell Networks

  • Roy, Abhishek;Shin, Jitae;Saxena, Navrati
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.578-587
    • /
    • 2012
  • One of the key elements in the emerging, packet-based long term evolution (LTE) cellular systems is the deployment of multiple femtocells for the improvement of coverage and data rate. However, arbitrary overlaps in the coverage of these femtocells make the handover operation more complex and challenging. As the existing handover strategy of LTE systems considers only carrier to interference plus noise ratio (CINR), it often suffers from resource constraints in the target femtocell, thereby leading to handover failure. In this paper, we propose a new efficient, multi-objective handover solution for LTE cellular systems. The proposed solution considers multiple parameters like signal strength and available bandwidth in the selection of the optimal target cell. This results in a significant increase in the handover success rate, thereby reducing the blocking of handover and new sessions. The overall handover process is modeled and analyzed by a three-dimensional Markov chain. The analytical results for the major performance metrics closely resemble the simulation results. The simulation results show that the proposed multi-objective handover offers considerable improvement in the session blocking rates, session queuing delay, handover latency, and goodput during handover.

The Operational Optimization of Semiconductor Research and Development Fabs by FAB-wide Scheduling (FAB-Wide 스케줄링을 통한 반도체 연구라인의 운용 최적화)

  • Kim, Young-Ho;Lee, Jee-Hyong;Sun, Dong-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.692-699
    • /
    • 2008
  • Semiconductor research and development(R&D) fabs are very different than production fabs in many ways such as the scales of production, job priority, production methods, and performance measures. Efficient operations of R&D fabs are very important to the development of new product, process stability, high yield, and ultimately company competitiveness. This paper proposes the fab-wide scheduling method for operational optimization of the R&D fabs. Most scheduling systems of semiconductor fabs have only focused on maximizing throughput of each separated areas without considering WIP(works in process) flows of entire fab. In this paper, we proposes the a fab-wide scheduling system which schedules all lots to entire fab equipment at once. We develop the MIP(mixed integer programing) model which allocates the lots to production equipment considering many constraints of all processes and the CP(constraint programming) model which determines the sequences of the lots in the production equipment. The proposed FAB-wide scheduling model is applied to the newly constructed R&D fab. As a result, we have accomplished the system based automated job reservation, decrease of the hot lot delay, increase of the queue time satisfaction, the high throughput by maximizing the batch sizes, decrease of the WIP TAT(Turn Around Time).

Determination of the Tooth Modification Amounts for Minimizing the Vibration of Helical Gear (헬리컬 치차의 진동최소화를 위한 치면 수정량의 결정)

  • Chong, Tae-Hyong;Myong, Jae-Hyong;Kim, Ki-Tae
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.11
    • /
    • pp.199-205
    • /
    • 2000
  • The vibration and noise of gears is due to the vibration exciting force caused by the tooth stiffness which changes periodically as the mesh of teeth proceeds and by the transmission error, that is, the rotation delay between driving gear and driven gear caused by manufacturing error and alignment error in assembly and so on. The purpose of this study is to develop how to calculate simultaneously the optimum amounts of tooth profile modification, end relief and crowning by minimizing the vibration exciting force of helical gears. We estimate the vibration exciting force by the mesh analysis of gears. The constraints of this problem consist of contact ratio and strengths of gear teeth such as tooth fillet stress, surface durability and scoring. ADS(Automated Design Synthesis) is used as an optimization tool. And, since the aspect ratio is an important parameter of tooth modification, we investigate the relation between it and the optimum values of tooth modification. The proposed method can calculate the optimum amount of tooth modification automatically and is to be utilized to resolve the problem of vibration of helical gears.

  • PDF

Preserving Mobile QoS during Handover via Predictive Scheduling in IMT Advanced System (IMT Advanced 시스템에서 예측 스케줄링을 통한 핸드오버시 모바일 QoS 보존 방법)

  • Poudyal, Neeraj;Lee, Byung-Seub
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.6
    • /
    • pp.865-873
    • /
    • 2010
  • In this paper, a novel schedulability criteria is developed to provide handover calls with Quality of Service (QoS) guarantees in terms of both minimum available bandwidth, maximum tolerated packet delay, and other additive QoS constraints as required by the real-time mobile traffic. This requires prediction of the handover time using mobility trends on the mobile station, which is used as input to this work. After the handover time and the QoS are negotiated, the destination base station makes attempts to give priority to handover calls over new calls, and pre-reserves resources that will have more chance of being available during the actual handover.

Characteristics of a Megajournal: A Bibliometric Case Study

  • Burns, C. Sean
    • Journal of Information Science Theory and Practice
    • /
    • v.3 no.2
    • /
    • pp.16-30
    • /
    • 2015
  • The term megajournal is used to describe publication platforms, like PLOS ONE, that claim to incorporate peer review processes and web technologies that allow fast review and publishing. These platforms also publish without the constraints of periodic issues and instead publish daily. We conducted a yearlong bibliometric profile of a sample of articles published in the first several months after the launch of PeerJ, a peer reviewed, open access publishing platform in the medical and biological sciences. The profile included a study of author characteristics, peer review characteristics, usage and social metrics, and a citation analysis. We found that about 43% of the articles are collaborated on by authors from different nations. Publication delay averaged 68 days, based on the median. Almost 74% of the articles were coauthored by males and females, but less than a third were first authored by females. Usage and social metrics tended to be high after publication but declined sharply over the course of a year. Citations increased as social metrics declined. Google Scholar and Scopus citation counts were highly correlated after the first year of data collection (Spearman rho = 0.86). An analysis of reference lists indicated that articles tended to include unique journal titles. The purpose of the study is not to generalize to other journals but to chart the origin of PeerJ in order to compare to future analyses of other megajournals, which may play increasingly substantial roles in science communication.

Design and Evaluation of a Quorum-Based Adaptive Dissemination Algorithm for Critical Data in IoTs (IoT에서 중요한 데이터를 위한 쿼럼 기반 적응적 전파 알고리즘의 설계 및 평가)

  • Bae, Ihn Han;Noh, Heung Tae
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.8
    • /
    • pp.913-922
    • /
    • 2019
  • The Internet of Things (IoT) envisions smart objects collecting and sharing data at a massive scale via the Internet. One challenging issue is how to disseminate data to relevant data consuming objects efficiently. In such a massive IoT network, Mission critical data dissemination imposes constraints on the message transfer delay between objects. Due to the low power and communication range of IoT objects, data is relayed over multi-hops before arriving at the destination. In this paper, we propose a quorum-based adaptive dissemination algorithm (QADA) for the critical data in the monitoring-based applications of massive IoTs. To design QADA, we first design a new stepped-triangular grid structures (sT-grid) that support data dissemination, then construct a triangular grid overlay in the fog layer on the lower IoT layer and propose the data dissemination algorithm of the publish/subscribe model that adaptively uses triangle grid (T-grid) and sT-grid quorums depending on the mission critical in the overlay constructed to disseminate the critical data, and evaluate its performance as an analytical model.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

A Study on the Digitalization of User Research Tool for Service Design (서비스 디자인을 위한 사용자 조사 도구의 디지털화에 대한 연구)

  • Koo, Do Hee;Chon, Woo Jeong
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.3
    • /
    • pp.494-507
    • /
    • 2021
  • As service design becomes more common, various user research methods and tools such as cultural probes and contextual inquiry are being used to grasp the user's experience and needs. These methodologies have the advantage of being able to derive various insights through direct observation and investigation, but have disadvantages in that problems such as time and space constraints, cost occurrence, and delay in the service development process may occur. In addition, it is difficult to conduct actual observations, face-to-face investigations, and interviews due to COVID-19, which has recently spread rapidly around the world. Accordingly, prior to the digitization of cultural probes, I would like to suggest the direction of digital tools. First, after grasping the concept of service design and user research through literature research, the necessity of user research in service design was confirmed. After that, the necessity of digitalizing user research was confirmed by extracting functional elements that could be understood and digitalized about the cultural probes methodology, and analyzing previous studies using existing mobile-based survey techniques. Finally, we confirmed the direction of digital tools through user interviews through cultural probes.

Toward Energy-Efficient Task Offloading Schemes in Fog Computing: A Survey

  • Alasmari, Moteb K.;Alwakeel, Sami S.;Alohali, Yousef
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.163-172
    • /
    • 2022
  • The interconnection of an enormous number of devices into the Internet at a massive scale is a consequence of the Internet of Things (IoT). As a result, tasks offloading from these IoT devices to remote cloud data centers become expensive and inefficient as their number and amount of its emitted data increase exponentially. It is also a challenge to optimize IoT device energy consumption while meeting its application time deadline and data delivery constraints. Consequently, Fog Computing was proposed to support efficient IoT tasks processing as it has a feature of lower service delay, being adjacent to IoT nodes. However, cloud task offloading is still performed frequently as Fog computing has less resources compared to remote cloud. Thus, optimized schemes are required to correctly characterize and distribute IoT devices tasks offloading in a hybrid IoT, Fog, and cloud paradigm. In this paper, we present a detailed survey and classification of of recently published research articles that address the energy efficiency of task offloading schemes in IoT-Fog-Cloud paradigm. Moreover, we also developed a taxonomy for the classification of these schemes and provided a comparative study of different schemes: by identifying achieved advantage and disadvantage of each scheme, as well its related drawbacks and limitations. Moreover, we also state open research issues in the development of energy efficient, scalable, optimized task offloading schemes for Fog computing.

Be it unresolved: Measuring time delays from unresolved light curves

  • Bag, Satadru;Kim, Alex G.;Linder, Eric V.;Shafieloo, Arman
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.47.4-48
    • /
    • 2021
  • Gravitationally lensed Type Ia supernovae may be the next frontier in cosmic probes, able to deliver independent constraints on dark energy, spatial curvature, and the Hubble constant. Measurements of time delays between the multiple images become more incisive due to the standardized candle nature of the source, monitoring for months rather than years, and partial immunity to microlensing. While currently extremely rare, hundreds of such systems should be detected by upcoming time-domain surveys. Others will have the images spatially unresolved, with the observed lightcurve a superposition of time delayed image fluxes. We investigate whether unresolved images can be recognized as lensed sources given only lightcurve information and whether time delays can be extracted robustly. We develop a method that we show can identify these systems for the case of lensed Type Ia supernovae with two images and time delays exceeding ten days. When tested on such an ensemble the method achieves a false positive rate of ≲5%, and measures the time delays with the completeness of ≳93% and with a bias of ≲0.5% for time delay ≳10 days. Since the method does not assume a template of any particular type of SN, the method has the potential to work on other types of lensed SNe systems and possibly on other transients.

  • PDF