专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09871611B2 Method of introducing an outstation into an optical network and outstation therefor 有权
公开(公告)号：US09871611B2
公开(公告)日：2018-01-16
申请号：US12295117
申请日：2007-03-07
申请人： Albert Rafel , Derek Nesset , Mark E Scopes , Alan M Hill
发明人： Albert Rafel , Derek Nesset , Mark E Scopes , Alan M Hill
IPC分类号： H04J3/16 , H04J3/06 , H04L12/24 , H04L29/12
CPC分类号： H04J3/1694 , H04J3/0682 , H04L29/12207 , H04L41/0896 , H04L61/20
摘要： The present invention relates to the introduction of an outstation into an optical network. The optical network has a central station, and a plurality of previously introduced outstations which are optically connected to the central station. The network is operable in: a normal operating state in which data traffic is received from previously introduced outstations at a normal data rate; and, a set-up state in which the transmission of data traffic from the previously introduced outstations is restricted relative to the normal state, the method including the step of: when the network is in the set-up state, performing a set-up operation for introducing the outstation into the optical network, the set-up operation involving the transmission of set-up data from the outstation being introduced, wherein the set-up data is transmitted at a reduced rate relative to the normal operating rate.

2. 发明申请

US20090263132A1 METHOD OF INTRODUCING AN OUTSTATION INTO AN OPTICAL NETWORK AND OUTSTATION THEREFOR 有权
标题翻译：将展示引入光网络及其展示的方法
公开(公告)号：US20090263132A1
公开(公告)日：2009-10-22
申请号：US12295117
申请日：2007-03-07
申请人： Albert Rafel , Derek Nesset , Mark E Scopes , Alan M Hill
发明人： Albert Rafel , Derek Nesset , Mark E Scopes , Alan M Hill
IPC分类号： H04J14/00
CPC分类号： H04J3/1694 , H04J3/0682 , H04L29/12207 , H04L41/0896 , H04L61/20
摘要： The present invention relates to the introduction of an outstation into an optical network. The optical network has a central station, and a plurality of previously introduced outstations which are optically connected to the central station. The network is operable in: a normal operating state in which data traffic is received from previously introduced outstations at a normal data rate; and, a set-up state in which the transmission of data traffic from the previously introduced outstations is restricted relative to the normal state, the method including the step of: when the network is in the set-up state, performing a set-up operation for introducing the outstation into the optical network, the set-up operation involving the transmission of set-up data from the outstation being introduced, wherein the set-up data is transmitted at a reduced rate relative to the normal operating rate.
摘要翻译：本发明涉及在光网络中引入外站。光网络具有中心站和多个先前引入的外站，其光连接到中心站。该网络可操作于：正常操作状态，其中以正常数据速率从先前引入的外站接收数据业务; 所述方法包括以下步骤：当所述网络处于建立状态时，执行建立状态，所述建立状态是从所述先前引入的外部站点的数据流量的传输相对于所述正常状态而被限制的，将分站引入光网络的操作，涉及从外站传输建立数据的建立操作，其中以相对于正常工作速率降低的速率发送建立数据。

3. 发明申请

US20070030845A1 Channel assignment process 审中-公开
标题翻译：频道分配过程
公开(公告)号：US20070030845A1
公开(公告)日：2007-02-08
申请号：US10573250
申请日：2004-09-29
申请人： Alan Hill , Albert Rafel , Terence Hodgkinson
发明人： Alan Hill , Albert Rafel , Terence Hodgkinson
IPC分类号： H04Q11/00
CPC分类号： H04Q11/06 , H04L49/15 , H04L49/253 , H04L49/3018 , H04Q3/68
摘要： A channel assignment process for a multi-stage switch arrangement having a plurality of inputs arranged in a plurality of logical associations and a plurality of outputs, wherein time-slotted traffic is received by each logical association of inputs is operated on by one or more switching stages arranged to operate only on traffic provided by the respective logical association of inputs, the channel assignment process comprising: for each logical association, aggregating the time-slots carrying traffic from the inputs forming said logical association to form a channel comprising a plurality of logically associated time-slots; determining a path through a spatial switching stage of the switch arrangement arranged to receive a said channel from each of said logical associations of inputs of the switch arrangement; determining a path for each time-slot within each logical association such that a plurality of end-to-end time-space channels are provided for one or more inputs of the switch arrangement to their requested output via said channel through said spatial switching stage of the switch arrangement.
摘要翻译：一种用于多级开关装置的信道分配过程，其具有以多个逻辑关联布置的多个输入和多个输出，其中每个输入的逻辑关联接收时隙业务，其中一个或多个切换阶段，其被设置为仅操作由相应的输入的逻辑关联提供的业务，所述信道分配过程包括：对于每个逻辑关联，聚合从形成所述逻辑关联的输入中携带业务的时隙，以形成包括多个逻辑关系的信道关联时隙确定通过所述开关装置的空间切换级的路径，布置成从所述开关装置的所述输入的所述逻辑关联中的每一个接收所述通道; 确定每个逻辑关联内的每个时隙的路径，使得经由所述信道经由所述空间切换级提供多个端到端时空信道用于交换机装置的一个或多个输入到其请求的输出开关装置。

4. 发明申请

US20060285548A1 Matching process 审中-公开
标题翻译：匹配过程
公开(公告)号：US20060285548A1
公开(公告)日：2006-12-21
申请号：US10573154
申请日：2004-09-29
申请人： Alan Hill , Albert Rafel , Terrence Hoogkinson
发明人： Alan Hill , Albert Rafel , Terrence Hoogkinson
IPC分类号： H04L12/56
CPC分类号： H04L12/5601 , H04L49/1553 , H04L49/3045 , H04L2012/5679 , H04L2012/5681 , H04Q3/68
摘要： A matching method for a multi-stage switch arrangement having a plurality of logically associated inputs and a plurality of outputs, wherein the matching method comprises the steps of: for each logical association of inputs, aggregating service requests from every one of the inputs which form said logical association; resolving contention for said aggregated service requests between all of the logical associations to the outputs of the switch arrangement; and repeating the above steps in the matching method within each logical association for a subset of the inputs forming each said logical association until contention is resolved between the individual inputs of the switch arrangement and the outputs of the switch arrangement.
摘要翻译：一种用于具有多个逻辑关联输入和多个输出的多级开关装置的匹配方法，其中所述匹配方法包括以下步骤：对于输入的每个逻辑关联，聚合来自形成的每个输入的服务请求说逻辑关联; 解决与所述交换机装置的输出的所有逻辑关联之间的所述聚合服务请求的争用; 并且在形成每个所述逻辑关联的输入的子集的每个逻辑关联内的所述匹配方法中重复上述步骤，直到在所述开关装置的各个输入和所述开关装置的输出之间解决争用。

5. 发明申请

US20060062231A1 Packet switching system 审中-公开
标题翻译：分组交换系统
公开(公告)号：US20060062231A1
公开(公告)日：2006-03-23
申请号：US10522729
申请日：2003-08-06
申请人： Andrea Bianco , Fabio Neri , Mirko Franceschinis , Emilio Leonardi , Stefano Ghisolfi , Alan Hill , Terrence Hodgkinson , Albert Rafel
发明人： Andrea Bianco , Fabio Neri , Mirko Franceschinis , Emilio Leonardi , Stefano Ghisolfi , Alan Hill , Terrence Hodgkinson , Albert Rafel
IPC分类号： H04L12/56
CPC分类号： H04L49/3045 , H04L2012/5679 , H04L2012/5681
摘要： Switch requests within a packet switch are allocated by processing switch request data for each input port to generate request data for each input port-output port pairing; and generating an allocation plan by sorting the request data relating to each of the input/output pairs in terms of their queue length, and for each such pair, considered in the sorted order, allocating as many of the requests in the queue as can be accommodated in the remaining time slots.
摘要翻译：分组交换机内的切换请求通过处理每个输入端口的切换请求数据来分配，以生成每个输入端口 - 输出端口配对的请求数据; 并且根据其队列长度对与每个输入/输出对相关的请求数据进行排序来生成分配计划，并且对于按照排序顺序考虑的每个这样的对，分配队列中的多个请求，如可以容纳在剩余的时间段。

6. 发明申请

US20050271046A1 Packet switching system 审中-公开
标题翻译：分组交换系统
公开(公告)号：US20050271046A1
公开(公告)日：2005-12-08
申请号：US10522730
申请日：2003-08-06
申请人： Andrea Bianco , Fabio Neri , Mirko Franceschinis , Emilio Leonardi , Stefano Ghisolfi , Alan Hill , Terrence Hodgkinson , Albert Rafel
发明人： Andrea Bianco , Fabio Neri , Mirko Franceschinis , Emilio Leonardi , Stefano Ghisolfi , Alan Hill , Terrence Hodgkinson , Albert Rafel
IPC分类号： H04L12/70 , H04L12/935 , H04L12/56
CPC分类号： H04L49/3045 , H04L2012/5679 , H04L2012/5681
摘要： In a packet switch, a switch request allocation plan is generated by reducing the number of queue requests VOQ relating to each of one or both sets of ports I1 .IN, O1 .ON, by a value such that the number of requests relating to each member of the set or sets of ports is no greater than the number of requests (frame value F) that can be handled by the switch (10). This reduction may be individually done for each queue. Alternatively all queues relating to a given port, or to any port, may have their length reduced by a single value determined by the size of the longest queue. A further stage may then apply other allocation rules to allocate requests remaining unallocated by the previous stage.
摘要翻译：在分组交换机中，通过减少与一个或两组端口I1.1IN，O1，ON中的每一个相关的队列请求VOQ的数量，生成切换请求分配计划，使得与每个一组或多组端口的成员不大于可由交换机（10）处理的请求数（帧值F）。每个队列可以单独进行这种减少。或者，与给定端口或任何端口相关的所有队列可以将其长度减小由最长队列的大小确定的单个值。然后，另一阶段可以应用其他分配规则来分配由前一阶段未分配的请求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式