会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明公开
    • VIRTUAL BROADCAST NETWORK FOR INTER-DOMAIN COMMUNICATIONS
    • 维多利亚州
    • EP1766559A4
    • 2013-01-09
    • EP05756714
    • 2005-06-16
    • NOKIA INC
    • NGUYEN TUYEN
    • G06F13/00H04L12/46
    • H04L45/00H04L12/467H04L45/586H04L49/70
    • An apparatus for a multi-domain computer system includes multiple virtual system domains, each having an associated, independent routing instance. A virtual switch is created to forward packets between the domains. The virtual switch is configured to operate substantially as if it were a physical layer- 2 switch. The virtual switch and the virtual domains are connected together by virtual interfaces, where the virtual switch, the virtual domains, and the virtual interfaces are all created in software. Further, protocols such as ARP, IP, and/or IPv6 operate over the virtual interfaces in substantially the same way that they would over Ethernet. Also, each domain has a software driver that behaves like an Ethernet driver, and has a 48-bit Ethernet-like address that is used for the physical address.
    • 一种用于多域计算机系统的装置包括多个虚拟系统域,每个虚拟系统域具有相关联的独立路由实例。 创建虚拟交换机以在域之间转发数据包。 虚拟交换机被配置为基本上操作为物理层-2交换机。 虚拟交换机和虚拟域通过虚拟接口连接在一起,虚拟交换机,虚拟域和虚拟接口均以软件创建。 此外,诸如ARP,IP和/或IPv6的协议以与以太网基本相同的方式在虚拟接口上操作。 此外,每个域都有一个软件驱动程序,其行为类似于以太网驱动程序,并且具有用于物理地址的48位类似以太网的地址。
    • 6. 发明授权
    • LOST PACKET RECOVERY IN VOICE OVER INTERNET PROTOCOL BASED ON TIME DOMAIN INTERPOLATION
    • 回收VoIP协议信息丢失包,以使用时间范围插值的
    • EP1226691B1
    • 2011-09-07
    • EP00976873.0
    • 2000-11-03
    • Nokia Inc.
    • PARTALO, Momir
    • G10L19/00
    • G10L19/005H04L12/6418H04L2012/6467H04L2012/6472H04L2012/6481
    • A lost packet recovery device, method and computer program for use in a VoIP system in which lost packets containing voice information are replaced using time domain interpolation techniques. These time domain interpolation techniques employ two different approaches to interpolate missing data packets. The first approach relies on time domain harmonic scaling to interpolate a replacement frame for a missing frame using the frames that come before and after the missing frame. The second approach replicates a frame immediately prior to the missing frame. This replicated frame then has an energy reduction function applied to it to gradually reduce the energy output level of the data samples in the frame. This replicated frame is then used to replace the missing frame. In the second approach, the process of duplicating the prior frame and reducing its energy levels using an energy reduction function is repeated until no further missing frames are detected. Once no further missing frames are detected, an energy restoration function is applied to the next available frame to gradually increase its energy level and provide for a smooth transition. Using these techniques, missing frames of voice data may be replaced to mask the effects of missing frames to a listener.
    • 8. 发明授权
    • A PROTOCOL FOR NEIGHBORHOOD-ESTABLISHED TRANSMISSION SCHEDULING
    • 协议流控制邻里内置转拨
    • EP1249101B1
    • 2011-08-10
    • EP00986792.0
    • 2000-10-16
    • Nokia Inc.
    • GARCIA-LUNA-ACEVES, J., JoaquinFULLMER, Chane, L.BEYER, David, A.
    • H04W74/04
    • H04W74/04H04L45/02H04L45/44
    • Scheduling packets are exchanged among neighboring nodes of a computer network. These scheduling packets include descriptions of a transmitting node's 2-hop neighborhood within the computer network, and nodes are able to determine transmission schedules from information received via said scheduling packets. Preferably, the computer network is a synchronized network in which time is dived into a number of frames, each of which are made up of a plurality of slots. In such cases, the exchange of scheduling packets should occur within a first number of the slots of each frame, preferably in a common communication channel. Transmission schedules may be determined, at least in part, because nodes advertise their availability using the scheduling packets. The above-mentioned descriptions may include an identification of received communication times and/or channels, an identification of requested communication times and/or channels and an identification of available communication times and/or channels. The requested communication times and/or channels should correspond to available times and/or channels advertised by one or more nodes of the computer network. In this scheme, the identification of reserved communication times and/or channels should be made after eliminating any conflicting scheduled transmissions for those communication times and/or channels.