版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Department of Electronics and Computer Science Koszalin University of Technology Sniadeckich 2 Koszalin Poland Institute of Computer Engineering Control and Robotics Wrocław University of Technology Wroclaw Poland Department of Business Informatics Warsaw University of Technology Narbutta 85 02-524 Warsaw Poland
出 版 物:《Procedia Computer Science》
年 卷 期:2014年第35卷
页 面:1567-1576页
主 题:cyclic scheduling multimodal networks constraint programming structures composition
摘 要:The paper introduces the concept of a crystalline-like model of a computer communication network (CCN) composed of routers forming a repeating or periodic arrangement. The considered homogenous network assumes the same routers servicing the same number of transmissions form an array. In such a network several isomorphic sub-networks encompassing packet transmission processes serviced by each router, interact each other as to provide a variety of demand-responsive host-server transmission services. In that context, a crystalline-like layout of physically different, however functionally identical, routers provides a homogenous array supporting computer network flows. In turn, packet transmission flows are treated as multimodal processes encompassing arbitrarily given inter-computer communications. Assuming the packets passing their origin-destination routes are synchronized by the same mechanism of packet transmission the problem boils down to a communication processes scheduling. Since concurrent transmission flows are processed along the same presumed routes, hence the schedules sought are cyclic ones. In general case, cycles of multimodal processes depend on CNN s periodicity. That objective to develop conditions allowing one to calculate the cyclic schedule of whole CCN while taking into account only periodicity of its repeating isomorphic structure.