-
1.
公开(公告)号:US20150188625A1
公开(公告)日:2015-07-02
申请号:US14583273
申请日:2014-12-26
Inventor: Chan Sung PARK , Dae Ub KIM , Sun Me KIM , Tae IL KIM , Jong Seok LEE , Jong Hyun LEE
IPC: H04B10/032 , H04Q11/00 , H04B10/27
CPC classification number: H04B10/032 , H04B10/27 , H04Q11/0062 , H04Q2011/0081
Abstract: Provided herein is a method for realizing time reduction in shared mesh protection, the method including, in a protection path node, in response to a resource being used for a first protection path by a node, receiving a resource use request for setting a second protection path from another node; activating a protection switch through comparison of priorities of protection paths at the resource use request received; and transmitting, by the activation of a protection switch, to a next protection path node a first shared mesh protection message where a revert (RT) message for the first protection path and a protection switch (SF) message for setting a second protection path are multiplexed.
Abstract translation: 这里提供了一种用于实现共享网格保护的时间减少的方法,该方法包括在保护路径节点中响应于节点用于第一保护路径的资源,接收用于设置第二保护的资源使用请求 从另一个节点的路径; 通过比较接收的资源使用请求中保护路径的优先级来激活保护交换机; 以及通过激活保护交换机向第二保护路径节点发送第一共享网格保护消息,其中用于所述第一保护路径的恢复(RT)消息和用于设置第二保护路径的保护交换机(SF)消息) 多路复用
-
公开(公告)号:US20190182173A1
公开(公告)日:2019-06-13
申请号:US16122200
申请日:2018-09-05
Inventor: Kyeong Eun HAN , Dae Ub KIM , Chan Sung PARK , Jong Tae SONG , Kwang Joon KIM , Joon Ki LEE
IPC: H04L12/863 , H04L12/841 , H04L12/935
Abstract: A parallel scheduling apparatus includes an information managing unit generating a first request information for scheduling, a first scheduling unit performing first scheduling and then generating first matching information on the basis of the first request information, and a second scheduling unit performing second scheduling on the basis of the first request information and the first matching information. The parallel scheduling has an advantage of improving the scheduling performance and lowering the implementation complexity, ensuring low delay and transmission fairness among VOQs at low input traffic, being applied to all scheduling algorithms that perform existing multi-iterations, and providing efficient scheduling in a packet switch having a long RTT time or having a very short time slot or cell size, such as an optical switch.
-