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

1. 发明授权

US08774627B2 Network restoration under link or node failure using preconfigured virtual cycles 有权
标题翻译：使用预配置的虚拟周期在链路或节点故障下进行网络恢复
公开(公告)号：US08774627B2
公开(公告)日：2014-07-08
申请号：US13587495
申请日：2012-08-16
申请人： Hanan Luss , Martin Eiger , David Shallcross
发明人： Hanan Luss , Martin Eiger , David Shallcross
IPC分类号： H04J14/02
CPC分类号： H04J14/0257 , H04J14/0267 , H04J14/0268 , H04J14/0284
摘要： The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.
摘要翻译：电信网络的设计使得在网络中的单个链路或节点故障下为多个需求提供端到端路径保护。在预配置的虚拟循环（PVC）上提供恢复路由，其中每个需求在一个周期的段上分配一个恢复路由和特定恢复波长。多个需求可以共享恢复波长，并且恢复波长的数量可以在PVC链路之间变化。首先，生成多个候选PVC，其中每个需求可被分配给多个候选。在某些情况下，允许使用普通故障情况分配同一个PVC。接下来，从候选人中选出一组PVC，同时最大限度地减少总保留恢复能力，并确保所有要求得到保护。下一个重复的分配被删除。最后，波长分配的冲突得到解决。本发明主要侧重于光网络。

2. 发明授权

US08275260B2 Network restoration under link or node failure using preconfigured virtual cycles 有权
标题翻译：使用预配置的虚拟周期在链路或节点故障下进行网络恢复
公开(公告)号：US08275260B2
公开(公告)日：2012-09-25
申请号：US12388981
申请日：2009-02-19
申请人： Hanan Luss , Martin Eiger , David Shallcross
发明人： Hanan Luss , Martin Eiger , David Shallcross
IPC分类号： H04B10/24
CPC分类号： H04J14/0257 , H04J14/0267 , H04J14/0268 , H04J14/0284
摘要： The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.
摘要翻译：电信网络的设计使得在网络中的单个链路或节点故障下为多个需求提供端到端路径保护。在预配置的虚拟循环（PVC）上提供恢复路由，其中每个需求在一个周期的段上分配一个恢复路由和特定恢复波长。多个需求可以共享恢复波长，并且恢复波长的数量可以在PVC链路之间变化。首先，生成多个候选PVC，其中每个需求可被分配给多个候选。在某些情况下，允许使用普通故障情况分配同一个PVC。接下来，从候选人中选出一组PVC，同时最大限度地减少总保留恢复能力，并确保所有要求得到保护。下一个重复的分配被删除。最后，波长分配的冲突得到解决。本发明主要侧重于光网络。

3. 发明申请

US20100209099A1 Network Restoration Under Link or Node Failure Using Preconfigured Virtual Cycles 有权
标题翻译：使用预配置的虚拟周期在链路或节点故障下进行网络恢复
公开(公告)号：US20100209099A1
公开(公告)日：2010-08-19
申请号：US12388981
申请日：2009-02-19
申请人： Martin Eiger , Hanan Luss , David Shallcross
发明人： Martin Eiger , Hanan Luss , David Shallcross
IPC分类号： H04B10/00
CPC分类号： H04J14/0257 , H04J14/0267 , H04J14/0268 , H04J14/0284
摘要： The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.
摘要翻译：电信网络的设计使得在网络中的单个链路或节点故障下为多个需求提供端到端路径保护。在预配置的虚拟循环（PVC）上提供恢复路由，其中每个需求在一个周期的段上分配一个恢复路由和特定恢复波长。多个需求可以共享恢复波长，并且恢复波长的数量可以在PVC链路之间变化。首先，生成多个候选PVC，其中每个需求可被分配给多个候选。在某些情况下，允许使用普通故障情况分配同一个PVC。接下来，从候选人中选出一组PVC，同时最大限度地减少总保留恢复能力，并确保所有要求得到保护。下一个重复的分配被删除。最后，波长分配的冲突得到解决。本发明主要侧重于光网络。

4. 发明授权

US07463892B2 Latency-aware service opportunity window-based (LASO) scheduling 有权
标题翻译：基于延迟的服务机会窗口（LASO）调度
公开(公告)号：US07463892B2
公开(公告)日：2008-12-09
申请号：US11161709
申请日：2005-08-12
申请人： Martin Eiger , Moncef Elaoud , Raquel Morera
发明人： Martin Eiger , Moncef Elaoud , Raquel Morera
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04W72/1221 , H04L47/10 , H04L47/14 , H04L47/50 , H04L47/564
摘要： Traffic flows of data packets from respective packet queues in wireless stations to a shared transmission medium of a wireless network are scheduled in accordance with Hybrid Controlled Channel Access (HCCA) and Enhanced Distributed Channel Access (EDCA). HCCA is applied by eliminating from consideration for HCCA access flows for which the sum of a desired minimum age of an oldest data packet in the respective packet queue and the time of creation of the oldest data packet is greater than the present time. For flows that are not eliminated from consideration, HCCA access is granted to the flow having a smallest sum of the desired maximum age of the oldest data packet and the time of creation of the oldest data packet. When all traffic flows are eliminated from consideration for HCCA access, EDCA is applied so that traffic flows compete for access to the medium.
摘要翻译：根据混合控制信道接入（HCCA）和增强分布式信道接入（EDCA）调度数据分组从无线站中的相应分组队列到无线网络的共享传输介质的业务流。通过消除对HCCA访问流的考虑来应用HCCA，对于HCCA访问流，相应分组队列中期望最小数据分组的期望最小年龄的和与最旧数据分组的创建时间之和大于当前时间。对于没有从考虑中消除的流，HCCA访问被授予具有最旧数据分组的期望最大年龄的最小和和最早数据分组的创建时间的流。当从HCCA接入考虑中消除所有业务流时，应用EDCA，以便流量竞争访问媒体。

5. 发明申请

US20070036116A1 LATENCY-AWARE SERVICE OPPORTUNITY WINDOW-BASED (LASO) SCHEDULING 有权
标题翻译： LATENCY-AWARE服务机会窗口（LASO）调度
公开(公告)号：US20070036116A1
公开(公告)日：2007-02-15
申请号：US11161709
申请日：2005-08-12
申请人： Martin Eiger , Moncef Elaoud , Raquel Morera
发明人： Martin Eiger , Moncef Elaoud , Raquel Morera
IPC分类号： H04Q7/24
CPC分类号： H04W72/1221 , H04L47/10 , H04L47/14 , H04L47/50 , H04L47/564
摘要： Traffic flows of data packets from respective packet queues in wireless stations to a shared transmission medium of a wireless network are scheduled in accordance with Hybrid Controlled Channel Access (HCCA) and Enhanced Distributed Channel Access (EDCA). HCCA is applied by eliminating from consideration for HCCA access flows for which the sum of a desired minimum age of an oldest data packet in the respective packet queue and the time of creation of the oldest data packet is greater than the present time. For flows that are not eliminated from consideration, HCCA access is granted to the flow having a smallest sum of the desired maximum age of the oldest data packet and the time of creation of the oldest data packet. When all traffic flows are eliminated from consideration for HCCA access, EDCA is applied so that traffic flows compete for access to the medium.
摘要翻译：根据混合控制信道接入（HCCA）和增强分布式信道接入（EDCA）调度数据分组从无线站中的相应分组队列到无线网络的共享传输介质的业务流。通过消除对HCCA访问流的考虑来应用HCCA，对于HCCA访问流，相应分组队列中期望最小数据分组的期望最小年龄的和与最旧数据分组的创建时间之和大于当前时间。对于没有从考虑中消除的流，HCCA访问被授予具有最旧数据分组的期望最大年龄的最小和和最早数据分组的创建时间的流。当从HCCA接入考虑中消除所有业务流时，应用EDCA，以便流量竞争访问媒体。

6. 发明申请

US20120328282A1 Network Restoration Under Link or Node Failure Using Preconfigured Virtual Cycles 有权
标题翻译：使用预配置的虚拟周期在链路或节点故障下进行网络恢复
公开(公告)号：US20120328282A1
公开(公告)日：2012-12-27
申请号：US13587495
申请日：2012-08-16
申请人： Martin Eiger , Hanan Luss , David Shallcross
发明人： Martin Eiger , Hanan Luss , David Shallcross
IPC分类号： H04B10/20
CPC分类号： H04J14/0257 , H04J14/0267 , H04J14/0268 , H04J14/0284
摘要： The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks.
摘要翻译：电信网络的设计使得在网络中的单个链路或节点故障下为多个需求提供端到端路径保护。在预配置的虚拟循环（PVC）上提供恢复路由，其中每个需求在一个周期的段上分配一个恢复路由和特定恢复波长。多个需求可以共享恢复波长，并且恢复波长的数量可以在PVC链路之间变化。首先，生成多个候选PVC，其中每个需求可被分配给多个候选。在某些情况下，允许使用普通故障情况分配同一个PVC。接下来，从候选人中选出一组PVC，同时最大限度地减少总保留恢复能力，并确保所有要求得到保护。下一个重复的分配被删除。最后，波长分配的冲突得到解决。本发明主要侧重于光网络。

7. 发明授权

US07082401B2 Digital subscriber line network deployment method 有权
标题翻译：数字用户线网络部署方式
公开(公告)号：US07082401B2
公开(公告)日：2006-07-25
申请号：US09816035
申请日：2001-03-23
申请人： Clifford Allen Behrens , Tamra Carpenter , Martin Eiger , Hanan Luss , George Seymour , Paul Seymour
发明人： Clifford Allen Behrens , Tamra Carpenter , Martin Eiger , Hanan Luss , George Seymour , Paul Seymour
IPC分类号： H04M3/42 , G06F17/60
CPC分类号： H04Q3/0083 , G06Q10/06315 , G06Q30/0202 , G06Q30/0204
摘要： A method for placing equipment in a network begins with a baseline network on which demographic data is analyzed statistically to produce a demographically-driven driven demand forecast model. The demand forecast model yields a predicted demand for each census block group. This can be visualized as one map layer with a GIS. The layout method takes the predicted demands as input and produces new attribute information for network nodes, the central office and cross-connects. By the layout method the cost of placing equipment at available placement sites or nodes is minimized based on various constraints, e.g., the capacity of the equipment to be placed, the distance a user is located from a potential node. Once the minimum cost for a given set of placement sites, subscribers, equipment capacity, and other known constraints is determined the equipment are then placed at these sites. These include the number and type of DSLAMs assigned to each node. These can be visualized with the GIS by clicking-on a node to expose the equipment deployed there.
摘要翻译：将设备放置在网络中的方法是从基线网络开始，统计分析人口统计数据，以产生人口统计驱动的需求预测模型。需求预测模型产生了每个人口普查块组的预测需求。这可以被视为一个具有GIS的地图层。布局方法将预测需求作为输入，为网络节点，中心局和交叉连接产生新的属性信息。通过布局方法，基于各种约束（例如，要放置的设备的容量，用户位于潜在节点的距离），将设备放置在可用放置位置或节点处的成本最小化。一旦给定的一组放置位置，订户，设备容量和其他已知约束的最小成本被确定，则将设备放置在这些位置。这些包括分配给每个节点的DSLAM的数量和类型。这些可以通过点击一个节点来显露部署在那里的设备，用GIS进行可视化。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式