GB2478397B - A scalable flow transport and delivery network and associated methods and systems - Google Patents

A scalable flow transport and delivery network and associated methods and systems

Info

Publication number
GB2478397B
GB2478397B GB1102875.0A GB201102875A GB2478397B GB 2478397 B GB2478397 B GB 2478397B GB 201102875 A GB201102875 A GB 201102875A GB 2478397 B GB2478397 B GB 2478397B
Authority
GB
United Kingdom
Prior art keywords
delivery network
systems
associated methods
flow transport
overlay
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
GB1102875.0A
Other versions
GB2478397A (en
GB201102875D0 (en
GB2478397A8 (en
Inventor
Yair Amir
Michal Miskin-Amir
Yousef Javadi
Malik Khan
Jonathan Stanton
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LiveTimeNet Inc
Original Assignee
LiveTimeNet Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by LiveTimeNet Inc filed Critical LiveTimeNet Inc
Publication of GB201102875D0 publication Critical patent/GB201102875D0/en
Publication of GB2478397A publication Critical patent/GB2478397A/en
Publication of GB2478397A8 publication Critical patent/GB2478397A8/en
Application granted granted Critical
Publication of GB2478397B publication Critical patent/GB2478397B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/24—Multipath
    • H04L45/243—Multipath using M+N parallel active paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/801—Real time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
    • H04L67/1076—Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A Flow Transport and Delivery Network (FTDN) supports delivery and transport of flows to destination nodes over parallel overlay networks. Overlay nodes executing overlay processes create and maintain one or more overlay networks. A plurality of sites are connected to each other via the parallel overlay networks with each site comprising one or more transit routers that route the flows to the destination nodes.
GB1102875.0A 2008-07-21 2009-07-21 A scalable flow transport and delivery network and associated methods and systems Active GB2478397B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US8227008P 2008-07-21 2008-07-21
PCT/US2009/051279 WO2010011668A1 (en) 2008-07-21 2009-07-21 A scalable flow transport and delivery network and associated methods and systems

Publications (4)

Publication Number Publication Date
GB201102875D0 GB201102875D0 (en) 2011-04-06
GB2478397A GB2478397A (en) 2011-09-07
GB2478397A8 GB2478397A8 (en) 2012-02-22
GB2478397B true GB2478397B (en) 2012-10-10

Family

ID=41570571

Family Applications (1)

Application Number Title Priority Date Filing Date
GB1102875.0A Active GB2478397B (en) 2008-07-21 2009-07-21 A scalable flow transport and delivery network and associated methods and systems

Country Status (3)

Country Link
GB (1) GB2478397B (en)
HK (1) HK1156447A1 (en)
WO (1) WO2010011668A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8619775B2 (en) 2008-07-21 2013-12-31 Ltn Global Communications, Inc. Scalable flow transport and delivery network and associated methods and systems

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2478687B (en) 2008-12-22 2014-05-21 Ltn Global Communications Inc A system and method for recovery of packets in overlay networks
US9106569B2 (en) 2009-03-29 2015-08-11 Ltn Global Communications, Inc. System and method that routes flows via multicast flow transport for groups
US8599851B2 (en) 2009-04-03 2013-12-03 Ltn Global Communications, Inc. System and method that routes flows via multicast flow transport for groups
CN114461392B (en) * 2022-01-25 2023-03-31 西南交通大学 Bandwidth-aware selective data multicast method

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060167784A1 (en) * 2004-09-10 2006-07-27 Hoffberg Steven M Game theoretic prioritization scheme for mobile ad hoc networks permitting hierarchal deference
US7133928B2 (en) * 1999-01-11 2006-11-07 Yahoo! Inc. Performing multicast communication in computer networks by using overlay routing
US7289520B2 (en) * 2002-11-20 2007-10-30 Hewlett-Packard Development Company, L.P. Method, apparatus, and system for expressway routing among peers
US20080140653A1 (en) * 2006-12-08 2008-06-12 Matzke Douglas J Identifying Relationships Among Database Records

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008043092A1 (en) * 2006-10-05 2008-04-10 Bittorrent, Inc. Peer-to-peer streaming of non-live content

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7133928B2 (en) * 1999-01-11 2006-11-07 Yahoo! Inc. Performing multicast communication in computer networks by using overlay routing
US7289520B2 (en) * 2002-11-20 2007-10-30 Hewlett-Packard Development Company, L.P. Method, apparatus, and system for expressway routing among peers
US20060167784A1 (en) * 2004-09-10 2006-07-27 Hoffberg Steven M Game theoretic prioritization scheme for mobile ad hoc networks permitting hierarchal deference
US20080140653A1 (en) * 2006-12-08 2008-06-12 Matzke Douglas J Identifying Relationships Among Database Records

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
AMIR et al. "Reliabile Communication in Overlay Networks", IEEE Transactions on Multimedia, 8(6), pp 1250-1262, http://www.dsn.jhu.edu/publications.html *
To et al, "Parallel overlays for high data-rate multicast data transfer, Comuter Networks, Volume 51, Issue 1 May 2006, pp 31-42 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8619775B2 (en) 2008-07-21 2013-12-31 Ltn Global Communications, Inc. Scalable flow transport and delivery network and associated methods and systems

Also Published As

Publication number Publication date
GB2478397A (en) 2011-09-07
GB201102875D0 (en) 2011-04-06
HK1156447A1 (en) 2012-06-08
WO2010011668A1 (en) 2010-01-28
GB2478397A8 (en) 2012-02-22

Similar Documents

Publication Publication Date Title
HK1156447A1 (en) A scalable flow transport and delivery network and associated methods and systems
CL2018001768A1 (en) Multi-way transport design
CL2008002402A1 (en) Method for programming the delay for each node in a communication system that has a plurality of nodes connected to each other by means of a plurality of links.
WO2010056582A3 (en) Service instance applied to mpls networks
GB2489376A (en) Network data congestion management system
GB2472527A (en) Method and apparatus for hierarchical routing in multiprocessor mesh-based systems
ATE520220T1 (en) SYSTEM, METHOD AND PROGRAM FOR DETERMINING FAILURE ROUTERS IN A NETWORK
EP4293935A3 (en) Passive optical-based data center networks
EP3128438A3 (en) Table-driven routing in a dragonfly processor interconnect network
GB2525134A (en) Quantized congestion notification in a virtual networking system
ATE554568T1 (en) CALCULATION OF THE SHORTEST TE-LSP BETWEEN DOMAINS IN MULTIPLE AUTONOMOUS SYSTEMS
PH12015502220A1 (en) Packet-level splitting for data transmission via multiple carriers
AR083103A1 (en) A METHOD, A PRODUCT AND A SYSTEM TO PROVIDE VIRTUAL NETWORKS USING RETRANSMISSIONS OF MULTIPLE OWNERS
EP2117166A4 (en) Method, equipment and system for updating routing table after node failure in peer-to-peer network
GB201017919D0 (en) Forwarding and routing in sensor networks
PH12014501867A1 (en) Method and apparatus for managing network resources used by multimedia streams in a virtual pipe
MX2010001063A (en) Method and system of routing in a utility smart-grid network.
ATE453988T1 (en) METHOD AND NETWORK NODES FOR ROUTING DATA PACKETS IN COMMUNICATION NETWORKS
ATE522072T1 (en) CONTENT BASED ROUTING
EP2663924A4 (en) Method and apparatus for low-latency interconnection networks using hierarchical rings
WO2009026019A3 (en) Fast computation of alternative packet routes
DE602007008765D1 (en) Method and apparatus for implementing multicast routing
WO2009113106A3 (en) Network communication
IN2014MN01490A (en)
DE502007004246D1 (en) ASI network for hazardous areas

Legal Events

Date Code Title Description
REG Reference to a national code

Ref country code: HK

Ref legal event code: DE

Ref document number: 1156447

Country of ref document: HK

REG Reference to a national code

Ref country code: HK

Ref legal event code: GR

Ref document number: 1156447

Country of ref document: HK