• Title/Summary/Keyword: communication scheduling

Search Result 715, Processing Time 0.027 seconds

Scheduling with Heterogeneous QoS Provisioning for Indoor Visible-light Communication

  • Dong, Xiaoli;Chi, Xuefen;Sun, Hongliang;Zhu, Yuhong
    • Current Optics and Photonics
    • /
    • v.2 no.1
    • /
    • pp.39-46
    • /
    • 2018
  • Visible-light communication (VLC) combined with advanced illumination can be expected to become an integral part of next-generation communication networks. One of the major concerns in VLC implementation is developing resource-allocation schemes in a multi-user scenario. However, the scheduling for heterogeneous quality of service (QoS) traffic has not been studied so far, for the indoor VLC downlink system. In this paper, we creatively introduce effective-bandwidth and effective-capacity theory into the multi-user scheduling (MUS) problem, to guarantee the user's statistical delay QoS. We also take account of the aggregate interference (AI) in the indoor VLC downlink system, and analyze its impact on the user-centric MUS problem for the first time. Simulations show that the AI has a nonnegligible influence on the scheduling result, and that the proposed scheduling scheme could guarantee the user's QoS requirement under the premise of ensuring sum capacity.

Design of a Coordinating Mechanism for Multi-Level Scheduling Systems in Supply Chain

  • Lee, Jung-Seung;Kim, Soo
    • Journal of Information Technology Applications and Management
    • /
    • v.19 no.1
    • /
    • pp.37-46
    • /
    • 2012
  • The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly-plant-scheduling agents, and a meta-level coordination agent. A series of experiment using the real-world data will be performed to examine this mechanism.

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Preventing Communication Disruption in the Urban Environment Using RRPS (RSU Request Priority Scheduling) (도심환경에서 통신 단절 예방을 위한 RRPS(RSU Request Priority Scheduling)설계)

  • Park, Seok-Gyu;Ahn, Heui-Hak;Jeuong, Yi-Na
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.584-590
    • /
    • 2016
  • This paper proposed "Priority Scheduling and MultiPath Routing Protocol (RRPS) for preventing communication disruption in the urban environment" to minimize the disconnection or disruption of V2I and V2V communication in the urban environment where communication is frequently disconnected according to density. The flow of the RRPS is explained as follows. RSU Request Priority Scheduling (RRPS) is used to apply the priority of the request message prior to reaching the end line by using the Start Line and End Line, which are the management areas of the RSU). This paper also proposed MPRP (Multi Path Routing Protocol) design to set up the multipath to the destination. As a result, the proposed RRPS improves the processing efficiency of V2I by applying priority scheduling to the message of the vehicle requesting the information in the RSU, and can prevent the communication disconnection. Thereby, it is improved the transmission success probability.

Efficient Channel State Feedback Scheme for Opportunistic Scheduling in OFDMA Systems by Scheduling Probability Prediction

  • Ko, Soomin;Lee, Jungsu;Lee, Byeong Gi;Park, Daeyoung
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.589-600
    • /
    • 2013
  • In this paper, we propose a new feedback scheme called mode selection-based feedback by scheduling probability prediction (SPP-MF) for channel state feedback in OFDMA downlink system. We design the scheme such that it determines the more desirable feedback mode among selective feedback by scheduling probability prediction (SPP-SF) mode and bitmap feedback by scheduling probability prediction (SPP-BF) mode, by calculating and comparing the throughputs of the two modes. In both feedback modes, each user first calculates the scheduling probability of each subchannel (i.e., the probability that a user wins the scheduling competition for a subchannel) and then forms a feedback message based on the scheduling probability. Specifically, in the SPP-SF mode, each user reports the modulation and coding scheme (MCS) levels and indices of its best S subchannels in terms of the scheduling probability. In the SPP-BF mode, each user determines its scheduling probability threshold. Then, it forms a bitmap for the subchannels according to the scheduling probability threshold and sends the bitmap along with the threshold. Numerical results reveal that the proposed SPP-MF scheme achieves significant performance gain over the existing feedback schemes.

Dynamic Task Scheduling Via Policy Iteration Scheduling Approach for Cloud Computing

  • Hu, Bin;Xie, Ning;Zhao, Tingting;Zhang, Xiaotong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1265-1278
    • /
    • 2017
  • Dynamic task scheduling is one of the most popular research topics in the cloud computing field. The cloud scheduler dynamically provides VM resources to variable cloud tasks with different scheduling strategies in cloud computing. In this study, we utilized a valid model to describe the dynamic changes of both computing facilities (such as hardware updating) and request task queuing. We built a novel approach called Policy Iteration Scheduling (PIS) to globally optimize the independent task scheduling scheme and minimize the total execution time of priority tasks. We performed experiments with randomly generated cloud task sets and varied the performance of VM resources using Poisson distributions. The results show that PIS outperforms other popular schedulers in a typical cloud computing environment.

Efficient Duplication Based Task Scheduling with Communication Cost in Heterogeneous Systems (이질 시스템에서 통신 시간을 고려한 효율적인 복제 기반 태스크 스케줄링)

  • Yoon, Wan-Oh;Baek, Jueng-Kuy;Shin, Kwang-Sik;Cheong, Jin-Ha;Choi, Sang-Bang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3C
    • /
    • pp.219-233
    • /
    • 2008
  • Optimal scheduling of parallel tasks with some precedence relationship, onto a parallel machine is known to be NP-complete. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, where the processors in the network may not be identical and take different amounts of time to execute the same task. This paper introduces a Duplication based Task Scheduling with Communication Cost in Heterogeneous Systems (DTSC), which provides optimal results for applications represented by Directed Acyclic Graphs (DAGs), provided a simple set of conditions on task computation and network communication time could be satisfied. Results from an extensive simulation show significant performance improvement from the proposed techniques over the Task duplication-based scheduling Algorithm for Network of Heterogeneous systems(TANH) and General Dynamic Level(GDL) scheduling algorithm.

Vertex Coloring based Slot Reuse Scheduling for Power Line Communications

  • Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.5
    • /
    • pp.2135-2141
    • /
    • 2015
  • Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

DEVELOPMENT OF AN INTEGRATED MODEL OF 3D CAD OBJECT AND AUTOMATIC SCHEDULING PROCESS

  • Je-Seung Ryu;Kyung-Hwan Kim
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1468-1473
    • /
    • 2009
  • Efficient communication of construction information has been critical for successful project performance. Building Information Modeling (BIM) has appeared as a tool for efficient communication. Through 3D CAD objects, it is possible to check interception and collisions of each object in advance. In addition, 4D simulation based on 3D objects integrated with time information makes it realize to go over scheduling and to perceive potential errors in scheduling. However, current scheduling simulation is still at a stage of animation due to manual integration of 3D objects and scheduling data. Accordingly, this study aims to develop an integrated model of 3D CAD objects that automatically creates scheduling information.

  • PDF

Programming Interface for DAG-based Co-scheduling of GirdRPC (GridRPC의 DAG 기반 Co-scheduling을 위한 프로그래밍 인터페이스)

  • Choi, Ji-Hyun;Lee, Dong-Woo;Kim, Mi-Ok;Ramakrishna, R.S.
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.189-192
    • /
    • 2003
  • 이 논문에서는 그리드환경에서 Remote Procedure Call(RPC) 프로그래밍 인터페이스를 위한 메커니즘인 GridRPC 의 성능향상을 위해 DAG 기반의 Co-scheduling API 를 제안한다. 네트워크 상의 통신횟수를 줄임으로써 GridRPC call 의 최적화를 도모하기 위한 프로그래밍 인터페이스와 이를 가능하게 하는 서버구조를 제안한다. DAG 기반의 co-scheduling 은 서버-클라이언트간의 연산에 사용되는 입력값과 출력값들의 흐름을 분석하여 사용자로 하여금 DAG(Directed Acyclic Graph)로 GridRPC call 들을 구성하고 이를 기반으로 GridRPC call 들을 최적화하는 방법이다. 또한, GridRPC가 Client Interface 이기 때문에 생기는 문제점인 서버간의 지원의 문제점을 SOAP 서버의 Wrapping 을 통해 해결한다.

  • PDF