• 제목/요약/키워드: scheduling internet

검색결과 406건 처리시간 0.027초

Demand Response Based Optimal Microgrid Scheduling Problem Using A Multi-swarm Sine Cosine Algorithm

  • Chenye Qiu;Huixing Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권8호
    • /
    • pp.2157-2177
    • /
    • 2024
  • Demand response (DR) refers to the customers' active reaction with respect to the changes of market pricing or incentive policies. DR plays an important role in improving network reliability, minimizing operational cost and increasing end users' benefits. Hence, the integration of DR in the microgrid (MG) management is gaining increasing popularity nowadays. This paper proposes a day-ahead MG scheduling framework in conjunction with DR and investigates the impact of DR in optimizing load profile and reducing overall power generation costs. A linear responsive model considering time of use (TOU) price and incentive is developed to model the active reaction of customers' consumption behaviors. Thereafter, a novel multi-swarm sine cosine algorithm (MSCA) is proposed to optimize the total power generation costs in the framework. In the proposed MSCA, several sub-swarms search for better solutions simultaneously which is beneficial for improving the population diversity. A cooperative learning scheme is developed to realize knowledge dissemination in the population and a competitive substitution strategy is proposed to prevent local optima stagnation. The simulation results obtained by the proposed MSCA are compared with other meta-heuristic algorithms to show its effectiveness in reducing overall generation costs. The outcomes with and without DR suggest that the DR program can effectively reduce the total generation costs and improve the stability of the MG network.

An Enhanced Response Time Mechanism in Grid Systems

  • Lee, Seong-Hoon
    • International Journal of Contents
    • /
    • 제6권2호
    • /
    • pp.10-13
    • /
    • 2010
  • For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, or with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an intelligent load distribution algorithm to minimize communications traffic and distance of the communications using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

전자상거래 보안을 위한 YK2 암호시스템의 구현 (An Implementation of YK2 Cipher System for Electronic Commerce Security)

  • 서장원
    • 한국전자거래학회지
    • /
    • 제6권1호
    • /
    • pp.17-33
    • /
    • 2001
  • EC(Electronic Commerce) which is done on the virtual space through Internet has strong point like independence from time and space. On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet, Therefore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solutions is the implementation of strong cipher system. YK2(Young Ku King) cipher system proposed in this paper is good solution for the EC security and it overcome the limit of current block cipher system using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is designed for the increase of time complexity by adapting more complex design for key scheduling algorithm regarded as one of important element effected to encryption.

  • PDF

On the Fairness of the Multiuser Eigenmode Transmission System

  • Xu, Jinghua;Zhou, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권6호
    • /
    • pp.1101-1112
    • /
    • 2011
  • The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

Multi-level Scheduling Algorithm Based on Storm

  • Wang, Jie;Hang, Siguang;Liu, Jiwei;Chen, Weihao;Hou, Gang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1091-1110
    • /
    • 2016
  • Hybrid deployment under current cloud data centers is a combination of online and offline services, which improves the utilization of the cluster resources. However, the performance of the cluster is often affected by the online services in the hybrid deployment environment. To improve the response time of online service (e.g. search engine), an effective scheduling algorithm based on Storm is proposed. At the component level, the algorithm dispatches the component with more influence to the optimal performance node. Inside the component, a reasonable resource allocation strategy is used. By searching the compressed index first and then filtering the complete index, the execution speed of the component is improved with similar accuracy. Experiments show that our algorithm can guarantee search accuracy of 95.94%, while increasing the response speed by 68.03%.

A Genetic Approach for Joint Link Scheduling and Power Control in SIC-enable Wireless Networks

  • Wang, Xiaodong;Shen, Hu;Lv, Shaohe;Zhou, Xingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1679-1691
    • /
    • 2016
  • Successive interference cancellation (SIC) is an effective means of multi-packet reception to combat interference at the physical layer. We investigate the joint optimization issue of channel access and power control for capacity maximization in SIC-enabled wireless networks. We propose a new interference model to characterize the sequential detection nature of SIC. Afterward, we formulize the joint optimization problem, prove it to be a nondeterministic polynomial-time-hard problem, and propose a novel approximation approach based on the genetic algorithm (GA). Finally, we discuss the design and parameter setting of the GA approach and validate its performance through extensive simulations.

Capacity aware Scalable Video Coding in P2P on Demand Streaming Systems

  • Xing, Changyou;Chen, Ming;Hu, Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권9호
    • /
    • pp.2268-2283
    • /
    • 2013
  • Scalable video coding can handle peer heterogeneity of P2P streaming applications, but there is still a lack of comprehensive studies on how to use it to improve video playback quality. In this paper we propose a capacity aware scalable video coding mechanism for P2P on demand streaming system. The proposed mechanism includes capacity based neighbor selection, adaptive data scheduling and streaming layer adjustment, and can enable each peer to select appropriate streaming layers and acquire streaming chunks with proper sequence, along with choosing specific peers to provide them. Simulation results show that the presented mechanism can decrease the system's startup and playback delay, and increase the video playback quality as well as playback continuity, and thus it provides a better quality of experience for users.

WDM 단일홉 방송망에서 멀티캐스트 서비스를 위한 PGM 기법의 제안 및 성능분석 (PGM Method for Multicast Service in WDM Single-hop Broadcast Networks)

  • 진교홍
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2002년도 춘계종합학술대회
    • /
    • pp.86-89
    • /
    • 2002
  • 최근 들어 인터넷은 화상회의, 인터넷방송, 네트워크게임 등과 같은 광대역, 멀티미디어 서비스가 요구되는 멀티캐스트 서비스로 발전되고 있다. 이러한 광대역의 서비스를 제공하기 위해서는 많은 대역폭이 요구되므로 현재 망의 대안으로 WDM 방송망이 대두되고 있다. 이에 따라 본 논문에서 WDM 방송망 구조에서 멀티캐스트 서비스를 제공하기 위한 스케줄링 알고리즘을 제안하였다. 제안된 알고리즘은 컴퓨터 시뮬레이션을 이용하여 기존의 스케줄링 알고리즘에 비해 적은 수의 서브 그룹수와 짧은 지연시간을 보임을 확인하였다.

  • PDF

Priority-based Scheduling Policy for OpenFlow Control Plane

  • Kasabai, Piyawad;Djemame, Karim;Puangpronpitag, Somnuk
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.733-750
    • /
    • 2019
  • Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

Study on Data Processing of the IOT Sensor Network Based on a Hadoop Cloud Platform and a TWLGA Scheduling Algorithm

  • Li, Guoyu;Yang, Kang
    • Journal of Information Processing Systems
    • /
    • 제17권6호
    • /
    • pp.1035-1043
    • /
    • 2021
  • An Internet of Things (IOT) sensor network is an effective solution for monitoring environmental conditions. However, IOT sensor networks generate massive data such that the abilities of massive data storage, processing, and query become technical challenges. To solve the problem, a Hadoop cloud platform is proposed. Using the time and workload genetic algorithm (TWLGA), the data processing platform enables the work of one node to be shared with other nodes, which not only raises efficiency of one single node but also provides the compatibility support to reduce the possible risk of software and hardware. In this experiment, a Hadoop cluster platform with TWLGA scheduling algorithm is developed, and the performance of the platform is tested. The results show that the Hadoop cloud platform is suitable for big data processing requirements of IOT sensor networks.