首页> 外国专利> HIGH SPEED FAIR PACKET SCHEDULING METHOD FOR MULTIMEDIA SERVICE IN HIGH SPEED PACKET COMMUNICATION NETWORK, CONCERNED WITH GUARANTEEING TRANSFER RATE ALLOCATED TO EACH FLOW FOR PLURAL FLOWS REQUESTING TO TRANSMIT PACKET TO THE SAME LINK

HIGH SPEED FAIR PACKET SCHEDULING METHOD FOR MULTIMEDIA SERVICE IN HIGH SPEED PACKET COMMUNICATION NETWORK, CONCERNED WITH GUARANTEEING TRANSFER RATE ALLOCATED TO EACH FLOW FOR PLURAL FLOWS REQUESTING TO TRANSMIT PACKET TO THE SAME LINK

机译:高速分组通信网络中用于多媒体服务的高速公平分组调度方法,考虑到为每个请求分配分组到同一链路的多个流的保证传输率

摘要

PURPOSE: A high speed fair packet scheduling method for a multimedia service in a high speed packet communication network is provided to guarantee a transfer rate allocated to each flow and fairly distribute link resources to each flow. CONSTITUTION: When a new packet reaches(210), a packet input processor calculates a server virtual time at the arrival point of the new packet(220). The packet input processor calculates a start tag signifying a virtual time at the point when the first bit of the arrived packet is transmitted to an output link, attaches it as a time stamp to the packet, and stores it in the queue of the corresponding flow.(230). The packet input processor updates a termination tag register of a flow 'i' with a value obtained by adding the normalized length value of the packet to the start tag of the packet(240).
机译:目的:提供一种用于高速分组通信网络中的多媒体服务的高速公平分组调度方法,以确保分配给每个流的传输速率并公平地向每个流分配链路资源。构成:当新的分组到达(210)时,分组输入处理器计算在新分组的到达点处的服务器虚拟时间(220)。数据包输入处理器计算一个开始标记,该标记表示到达的数据包的第一位传输到输出链路时的虚拟时间,将其作为时间戳附加到数据包,并将其存储在相应流的队列中(230)。分组输入处理器用通过将分组的标准化长度值加到分组的开始标签而获得的值来更新流“ i”的终止标签寄存器(240)。

著录项

  • 公开/公告号KR20040076248A

    专利类型

  • 公开/公告日2004-08-31

    原文格式PDF

  • 申请/专利权人 KIM TAE JOON;

    申请/专利号KR20040063696

  • 发明设计人 KIM TAE JOON;

    申请日2004-08-13

  • 分类号H04L12/28;H04L12/56;

  • 国家 KR

  • 入库时间 2022-08-21 22:48:07

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号