TW200941233A - System and method for intelligently allocating client requests to server centers - Google Patents
System and method for intelligently allocating client requests to server centers Download PDFInfo
- Publication number
- TW200941233A TW200941233A TW097147251A TW97147251A TW200941233A TW 200941233 A TW200941233 A TW 200941233A TW 097147251 A TW097147251 A TW 097147251A TW 97147251 A TW97147251 A TW 97147251A TW 200941233 A TW200941233 A TW 200941233A
- Authority
- TW
- Taiwan
- Prior art keywords
- game
- video
- frame
- user
- server
- Prior art date
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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
-
- 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1012—Server selection for load balancing based on compliance of requirements or conditions with available server resources
-
- 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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1021—Server selection for load balancing based on client or server locations
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Information Transfer Between Computers (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Telephonic Communication Services (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
200941233 九、發明說明: 【發明所屬之技術領域】 本揭示案大體而言係關於改良使用者操縱及存取音訊及 視訊媒體之能力的資料處理系統之領域。 本申請案為2002年12月10曰申請之名為「用於無線視訊 遊戲之裝置及方法(Apparatus and Method fW wheless200941233 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The present disclosure is generally in the field of data processing systems that improve the user's ability to manipulate and access audio and video media. This application is entitled "Apparatus and Method fW wheless for the application of wireless video game" on December 10, 2002.
Video Gaming)」的第10/315,460號部分接續(CIp)申請案, 該案已讓與給本CIP申請案之受讓人。 Q 【先前技術】 自從托馬斯.愛迪生(Thomas Edison)時代以來,已記錄 之音訊及電影媒體已成為社會之一方面。在2〇世紀初期, 存在已記錄之音訊媒體(磁柱及唱片)及電影媒體(投幣式自 動點p曰機及電影)的廣泛發行,但兩種技術仍處於其起步 階段。在20世紀20年代後期,在暢銷基礎上將電影與音訊 組合’繼之將彩色電影與音訊組合。無線電廣播逐漸演變 成很大程度上支援廣告之形式的廣播暢銷音訊媒體。當在 〇 20世紀40年代中期建立電視(τν)廣播標準時,電視與無線 電以廣播暢銷媒體之形式接合,從而將先前已記錄的或現 場直播的電影帶入家庭中。 至20世紀中期為止,大部分美國家庭已具有用於播放已 °己錄之音讯媒體的唱片播放機(phonograph record Player)、用於接收現場直播之廣播音訊的無線電,及用於 播放現場直播之廣播音訊/視訊(A/V)媒體的電視機。常常 將此等3個「媒體播放機」(唱片播放機、無線電及TV)組 136720.doc 200941233 合於一共用公共揚聲器之櫥射,變成家庭之「媒體中 ^」儘B對於消費者而言媒體選擇有限,但媒體「生態 系統」非常穩定。大多數消費者知道如何使用「媒體播放 機」且能夠享受其能力之全部範圍。同時,媒體之出版商 (大夕為電影及電視工作室,及音樂公司)能夠將其媒體分 配給電影院與家庭兩者,而不遭受廣泛的盜版或「二次鎖 售」(亦即’已使用媒體的重新銷售)。通常,出版商不合 自二次銷售得到收入,且因此,二次銷售減少了出版商; G於新的銷售原本可自已使用媒體的購買者得到的收入。儘 管的確存在於20世紀中期期間出售的已使用之唱片,但該 等銷售不會對唱片出版商有大影響,因為不同於電影或視 訊節目(其通常被成年人觀看一次或僅數次),音樂曲目可 被收聽數百-人或甚至數千次。因此,音樂媒體遠比電影/ 視訊媒體「經久」(亦,對於成年消費者而言,其具有 持久價值)。一旦構買了唱片,若消費者喜歡該音樂,、則 消費者可能將其保持長時間。 0 自2G世紀巾期至當今’㈣生態线對㈣費者與出版 商之利益及損失而言皆已經歷了一系列根本改變。在音訊 記錄器(尤其是具有高品質立趙聲之盒式磁帶)之廣泛引入 ^情況下’的確存在較高程度之消費者便利。但其亦標链 著現在廣泛的消費者媒體實踐·盜版之開始。的確,許多 =費者純粹出於便利起見而使用盒式磁帶來錄製其自身的 唱片,但日益增加的消費者(例如,宿舍中準備存取彼此 之唱片收集的學生)將進行盜版複製。又,消費者將錄製 136720.doc 200941233 經由無線電播放之音樂,而非自出版商蹲買唱片或磁帶。 消費者vcr出現導致更多的消費者便利,因為現在 VCR可設定為記錄TV節目’其可在稱後時間觀看,且似 亦導致視訊租賃業之建立,其中電影以㈣節目設計可 在「按要求」基礎上進行存取。自2〇世紀8〇年代中期以來 的暢銷家庭媒體器件之快速開發已導致消者之空前的選 擇及便利織’且亦導致媒體出版市場之快速擴張。Video Gaming) No. 10/315, 460 part of the continuation (CIp) application, which has been given to the assignee of this CIP application. Q [Prior Art] Since the days of Thomas Edison, recorded audio and film media have become one aspect of society. In the early 2nd century, there were widespread distributions of recorded audio media (magnetic columns and records) and movie media (coin-operated automatic p-machines and movies), but the two technologies are still in their infancy. In the late 1920s, film and audio were combined on the basis of a bestseller, followed by a combination of color film and audio. Radio broadcasts have evolved into broadcast-selling audio media that largely support the form of advertising. When the television (τν) broadcast standard was established in the mid-1940s, television and radio were joined in the form of broadcast-selling media to bring previously recorded or live-lived movies to the home. By the middle of the 20th century, most American households had a phonograph record player for playing recorded audio media, a radio for receiving live broadcasts, and for live broadcasts. A television that broadcasts audio/video (A/V) media. Often the three "media players" (recorders, radios and TVs) group 136720.doc 200941233 are combined with a common public speaker cabinet, which becomes the "media in the media". Media choices are limited, but the media “ecosystem” is very stable. Most consumers know how to use the Media Player and enjoy the full range of capabilities. At the same time, publishers of the media (Daysday for film and television studios, and music companies) are able to distribute their media to both cinemas and families without extensive piracy or "secondary lock sales" (ie 'has Use media resale). Often, publishers do not receive revenue from secondary sales, and as a result, secondary sales reduce publishers; G's new sales can be derived from the purchasers who use the media themselves. Although there are indeed used records sold during the mid-20th century, such sales will not have a major impact on record publishers because they are different from movies or video shows (which are usually viewed once or only several times by adults). Music tracks can be listened to hundreds of people or even thousands of times. Therefore, music media is far more durable than film/video media (also, for adult consumers, it has lasting value). Once the record is purchased, if the consumer likes the music, the consumer may keep it for a long time. 0 A series of fundamental changes have been experienced since the 2G century towel period to today's (4) ecological line pair (4) fee and publisher's interests and losses. In the context of the widespread introduction of audio recorders (especially cassettes with high quality stereos), there is indeed a high degree of consumer convenience. But it also marks the beginning of a wide range of consumer media practices and piracy. Indeed, many of the payers use cassette tapes to record their own albums for convenience, but increasingly consumers (for example, students in the dorms who are ready to access each other's album collection) will pirate. Also, consumers will record 136720.doc 200941233 via radio, rather than buying a record or tape from a publisher. The emergence of consumer vcr has led to more consumer convenience, because now VCR can be set to record TV programs 'which can be viewed at a later time, and it seems to lead to the establishment of video rental industry, where the movie is designed to be Requests are based on access. The rapid development of popular home media devices since the mid-1980s has led to an unprecedented choice and convenience for consumers, and has also led to a rapid expansion of the media publishing market.
❹ 現今’消費者面臨過多媒體選擇以及過多媒體器件,其 中之許多者綁定至特定形式之媒體或特定出版商。熱衷的 媒體消費者可能將—堆器件連接至房屋各房間中的TV及 電腦’造成至一或多個電視機及/或個人電腦(PC)之「鼠窩 式」電纜以及一群遠端控制。(在本申請案之上下文中, 術語「個人電腦」或「PC」指代適合於在家庭或辦公室中 使用的任何種類之電腦),包括桌上型電腦、Macintosh® 或其他非Windows電腦、與Windows相容之器件、1;1^變 體膝上型電腦等)。此等器件可包括視訊遊戲控制台、 VCR、DVD播放機、音訊環繞音效處理器/放大器、衛星 機頂里、電纜TV機頂盒等。此外,對於熱衷的消費者, 可能由於相容性問題而存在多個類似功能之器件。舉例而 ^肖費者可此擁有HD-DVD與藍光(Blu-ray)DVD播放機 兩者,或Microsoft Xbox® 與 Sony Playstation® 視訊遊戲系 、、兩者實際上’由於一些遊戲跨越遊戲控制台之若干版 本的不相容性’消費者可能擁有XBox與稍後之版本(諸 如’ Xbox 3 60®)兩者。經常地’消費者對於使用哪個視訊 136720.doc 200941233 輸入端及哪個遠端感到迷惑。甚至在將光碟置放於正確播 放機(例如,DVD、HD-DVD、藍光、xb〇hlPlaystati〇n) 中、選擇用於彼器件之視訊及音訊輸入端且發現正確遠端 控制之後’消費者仍面臨技術挑戰。舉例而言,在寬榮幕 DVD之狀況下,使用者可能需要首先判定正確的縱橫比 (例如,4:3、完全、放大、寬放大、電影院寬等)且接著在 其TV或監視器螢幕上設定正確的縱橫比。類似地,使用 者可能需要首先判定正確的音訊環繞音效系統格式(例 © 如,ACJ、杜比數位、DTS等)且接著設定正確的音訊環 繞音效系統格式。時常地,消費者未意識到其可能未享受 到其電視或音訊系統之全部能力下的媒體内容(例如,觀 看以錯誤縱橫比擠壓之電影,或收聽立體聲之音訊而非環 繞音效之音訊)。 日益增加地,已將以網際網路為基礎之媒體器件添加至 器件之堆疊。類似Sonos®數位音樂系統之音訊器件使音訊 直接自網際網路串流。同樣地,類似SlingboxTM娛樂播放 機之器件記錄視訊且使其經由家庭網路串流或經由網際網 路串机而出,其中可在PC上於遠端觀看該視訊。且網際網 路協定電視(IPTV)服務經由數位用戶線(DSL)或其他家庭 網際網路連接而提供類似電纜TV之服務。近來亦存在將 多個媒體功能整合於單一器件(諸如,Mox^媒體中心及執 行Windows XP媒體中心版本之PC)中的努力。儘管此等器 件中之每一者對其執行之功能提供一點便利,但每一者缺 乏對大多數媒體之普遍且簡單的存取。另外,常常由於昂 136720.doc 200941233 貝處理及/或本端儲存之需要而使得該等器件經常花費數 百美凡來製造。另夕卜,此等現代消費者電子器件通常消耗 :量電力,甚至當閒置時亦消耗大量電力,此意謂其隨著 時間而昂貴且浪費能源。舉例而t,若消費者忘記將—器 件切斷或將其切換至不同視訊輸人端,則該器件可能繼續 操作。此外,因為該等器件當中沒有—者為完全解決方 案,所以必須將其與家庭中之其他器件堆疊整合,此仍對 使用者留下鼠窩式線及許多遠端控制。❹ Today's consumers are faced with multimedia choices and multimedia devices, many of which are tied to specific forms of media or to specific publishers. A keen media consumer may connect the stack of devices to the TVs and computers in each room of the house to create a "snake" cable to one or more televisions and/or personal computers (PCs) and a group of remote controls. (In the context of this application, the term "personal computer" or "PC" refers to any type of computer suitable for use in a home or office), including desktop computers, Macintosh® or other non-Windows computers, and Windows compatible devices, 1; 1^ variant laptops, etc.). Such devices may include video game consoles, VCRs, DVD players, audio surround sound processors/amplifiers, satellite tops, cable TV set-top boxes, and the like. In addition, for enthusiastic consumers, there may be multiple devices with similar functions due to compatibility issues. For example, you can have both HD-DVD and Blu-ray DVD players, or Microsoft Xbox® and Sony Playstation® video game systems, both of which are actually 'because some games cross the game console. Several versions of incompatibilities 'consumers may own both XBox and later versions (such as 'Xbox 3 60®'). Frequently, consumers are confused about which video 136720.doc 200941233 input and which remote end to use. Even after placing the disc in the correct player (eg DVD, HD-DVD, Blu-ray, xb〇hlPlaystati〇n), selecting the video and audio inputs for the device and finding the correct remote control, the consumer Still facing technical challenges. For example, in the case of a wide-screen DVD, the user may need to first determine the correct aspect ratio (eg, 4:3, full, zoom in, wide zoom, cinema wide, etc.) and then on their TV or monitor screen. Set the correct aspect ratio on the top. Similarly, the user may need to first determine the correct audio surround sound system format (eg, eg, ACJ, Dolby Digital, DTS, etc.) and then set the correct audio surround sound system format. Often, consumers are unaware that they may not have access to the media content of their television or audio system (for example, watching a movie that is squeezed in the wrong aspect ratio, or listening to stereo audio instead of surround sound) . Increasingly, Internet-based media devices have been added to the stack of devices. Audio devices like the Sonos® digital music system stream audio directly from the Internet. Similarly, devices like the SlingboxTM entertainment player record video and stream it over a home network or via an internetwork network, where the video can be viewed remotely on a PC. And Internet Protocol Television (IPTV) services provide cable TV-like services via digital subscriber line (DSL) or other home Internet connections. There have also been recent efforts to integrate multiple media functions into a single device, such as the Mox^ Media Center and the PC running the Windows XP Media Center version. While each of these devices provides a little convenience for the functions they perform, each lacks universal and simple access to most media. In addition, these devices are often costly manufactured for hundreds of dollars due to the need for processing and/or local storage of the 136720.doc 200941233. In addition, such modern consumer electronic devices typically consume: a large amount of power, even when idle, which consumes a large amount of power, which means that it is expensive and wastes energy over time. For example, if the consumer forgets to cut the device or switch it to a different video input, the device may continue to operate. In addition, because none of these devices is a complete solution, it must be integrated with other devices in the home, leaving the user with a mouse-line and many remote controls.
此外,當許多較新的以網際網路為基礎之器件適當地工 作時,其通常提供更一般形式(與其原本可能可用之形式 相比)之媒體。舉例而言,使視訊經由網際網路串流之器 件常常僅使視訊材料串流,而不能使常常伴隨dvd互動式 「額外計費項目」_流,如視訊之「製作」、遊戲或導演 評論。此係由於以下事實:互動式材料經常係以意欲用於 在本端處理互動性之特定器件的特定格式而製作。舉例而 s,DVD、HD-DVD及藍光光碟中之每一者具有其自身的 特定互動格式。任何家庭媒體器件或本端電腦(其可能經 開發以支援所有風行格式)將需要一定程度的失端性 (sophistication)及靈活性,其將可能對於消費者操作而言 過於昂貴及複雜。 使該問題加重,若稍後在將來引入新格式,則本端器件 可能不具有支援新格式之硬體能力,此將意謂消費者將必 須騰貝升級的本端媒體器件。舉例而言,若在務後之曰期 引入較局解析度之視訊或立體視訊(例如,每一隻眼一視 136720.doc •10· 200941233 訊流),則本端器件可能不具有解碼該視訊之計算能力, 或其可能不具有用於以新格式輸出該視訊的硬體(例如, 假定藉由與遮光眼鏡(shuttered gIassess)同步之l2〇 fps視 訊來達成立體視覺,其中將60印8遞送至每一隻眼,若消 費者之視訊硬體僅可支援60 fps視訊,則此選項在缺乏升 級的硬體購買之情況下將不可用)。 田》炎及尖端的互動式媒體(尤其是視訊遊戲)時,媒體器 件廢棄及複雜度之問題為一嚴重問題。 〇 現代視訊遊戲應用基本上劃分成四個主要非可攜式硬體 平台:Sony PlayStation® 1、2及 3(PS1、PS2,及 PS3);In addition, when many newer Internet-based devices work properly, they typically provide media in a more general form (compared to the form that would otherwise be available). For example, devices that stream video over the Internet often stream only video material, rather than being accompanied by dvd interactive "additional billing items", such as video "production", games, or director reviews. . This is due to the fact that interactive materials are often produced in a specific format intended for the specific device that handles interactivity at the local end. For example, each of DVD, HD-DVD, and Blu-ray Disc has its own specific interactive format. Any home media device or local computer (which may be developed to support all popular formats) will require some degree of sophistication and flexibility that would be too expensive and complicated for consumer operations. This problem is exacerbated. If a new format is introduced in the future, the local device may not have the hardware capability to support the new format, which means that the consumer will have to upgrade the local media device. For example, if a video or stereo video with a higher resolution is introduced in the later period (for example, each eye 136720.doc •10·200941233 stream), the local device may not have decoded the video. Computing power, or it may not have hardware for outputting the video in a new format (eg, assuming stereo vision is achieved by l2〇fps video synchronized with shuttered gIassess, where 60 impressions are delivered To each eye, if the consumer's video hardware can only support 60 fps video, this option will not be available in the absence of an upgraded hardware purchase). The problem of media device obsolescence and complexity is a serious problem when Tian Yan and cutting-edge interactive media (especially video games). 〇 Modern video game applications are basically divided into four main non-portable hardware platforms: Sony PlayStation® 1, 2 and 3 (PS1, PS2, and PS3);
Microsoft Xbo?^&Xb〇x 36〇⑧;及川射印如 Gamecube⑧及 以及以PC為基礎之遊戲。此等平台中之每一者不 同於其他者,使得經編寫以在一平台上執行之遊戲通常不 會在另-平台上執行。亦可能存在一代器件與下一代器件 之相容性問題。即使大多數軟體遊戲開發者建立獨立於特 冑平台而設計之軟體遊戲,為了在特定平台上執行特定遊 V 戲,亦需要專有軟體層(其經常被稱為「遊戲開發引擎」) 來調適遊戲以在特定平台上使用。每一平台以「控制台」 (亦即,附接至TV或監視器/揚聲器之獨立盒子)之形二」出 售給消費者或其本身為-PC。通常,視訊遊戲係在諸如藍 光_、DVD_R0M或CD_R〇M之光學媒體上出售,該光 學媒體含有體現為尖端的即時軟體應用程式之視訊遊戲。 隨著家庭寬頻帶速度增加,視訊遊戲正日益變得可用於下 載0 、 136720.doc -11 - 200941233 由於高階視訊遊戲之即時性及高計算要求而使得達成與 視訊遊戲軟體之平台相容性的特殊性要求㈣苛刻。舉例 而言’吾人可能期望自-代視訊遊戲至下—代視訊遊戲 (例如,自 XBox 至 XBox 360,或自 Playstati〇n 2 (「ps2」) 至PlayStation 3 ( rps3」))的完全遊戲相容性正如存在 自-pc至具有較快處理單元或核心之另一pc的生產力應 用程式(例如,Microsoft Word)之普遍相容性。然而,對於 視訊遊戲並非為此狀況。因為當發行一代視訊遊戲時,視 〇 tfl遊戲製造商通常尋求對於給定價格點之最高可能效能, 2以經常對系統進行動態架構改變,以使得經編寫以用於 前代系統之許多遊戲在稍後一代系統上不工作。舉例而 言,XBox係基於χ86系列處理器,而χΒ〇χ 36〇係基於 PowerPC系列。 可利用技術來模擬先前架構,但假定視訊遊戲為即時應 用程式,則在模擬中達成完全相同之行為常常不切實際。 Jt係對^費者、視訊遊戲控制台製造商及視訊遊戲軟體出 版商之知失。對於消費者而言,其意謂保持將舊的-代視 訊遊A戲控制台與新的-代視訊遊戲控制台兩者接通至τν 、便at*夠玩所有遊戲的必要性。對於控制台製造商而言, 其意°胃與新控制台之模擬及較緩慢採用相關聯的成本。且 對於出版商而言,其意謂可能必須發行新遊戲之多個版本 二便:蓋所有潛在的消費者-不僅發行用於視訊遊戲之每 商Μ例如’ XBox、Playstati〇n)的版本,而且常常發 用於給疋商標之每一版本(例如,PS2及PS3)的版本。舉例 136720.doc -12. 200941233 而言,開發電子藝術「瘋狂撖欖球〇8」之單獨版本以用於 XBox XBox 360、PS2、PS3、Gamecube、Wii及 PC平台 以及其他平台。 可攜式器件(諸如,蜂巢式電話及可攜式媒體播放機)亦 對遊戲開發商提出挑戰。曰益增加地,該等器件連接至無 線資料網路且能夠下載視訊遊戲。但是,市場中存在具有 多種不同顯不解析度及計算能力的多種蜂巢式電話及媒體 器件。又,因為該等器件通常具有電力消耗、成本及重量 G 約束,所以其通常缺乏類似圖形處理單元(「GPU」)之高 階圖形加速硬體(諸如,由CAiSanta Ciara之Nvidia製造 的器件)。因此,遊戲軟體開發商通常開發同時用於許多 不同類型之可攜式器件的給定遊戲標題。使用者可發現: 給定遊戲標題不可用#其特定蜂巢式電話或可攜式媒體播 放機。 在家庭遊戲控制台之狀況下,硬體平台製S商通常向軟 體遊戲開發商索要用於在其平台上發布遊戲之能力的版 w S。蜂巢式電話無線通信公司通常亦向遊戲出版商索要用 於將遊戲下載至蜂巢式電話中之版稅。在1>(:遊戲之狀況 下,不存在用於發布遊戲所支付之版稅,但由於用於支援 多種PC組態及可能引起的安裝問題的較高消費者服務負擔 而使得遊戲開發商通常面臨高成本。又,pc通常較少對遊 戲軟體之盜版提出障礙,因為其可由技術上博學之使用者 容易地重新帛式化且遊戲可更容易力被盜版且更容易地被 分配(例如,經由網際網路)。因此,對於軟體遊戲開發商 136720.doc 200941233 而言,在遊戲控制台、蜂巢式電話及pc上發現存在成本及 不利之處。 對於控制台及Pc軟體之遊戲出版商而言,成本不止於 此。為了經由零售通道分配遊戲,出版商向零售商索要低 於出售價格之批發價格以使零售商具有利潤率。出版商通 常亦必須支付製造及分配保存遊戲之實體媒體的成本。零 售商經常亦向出版商索要「價格保護費」以涵蓋可能的意 外費用(諸如,遊戲售不出,或遊戲之價格降低,或零售 © 商必須退還部分或所有批發價格及/或自購買者收回遊 戲)。另外’零售商通常亦向出版商索要用於幫助在廣告 傳單中銷售遊戲之費用。此外,零售商日益增加地自已完 成遊戲之使用者購買回遊戲,且接著將該等遊戲以已使用 之遊戲出售,通常不與遊戲出版商分享已使用遊戲之收 入。以下事實添加施加於遊戲出版商之成本負擔:遊戲常 常被經由網際網路盜版及分配以供使用者下載及進行免費 複製。 W 隨著網際網路寬頻帶速度增加且寬頻帶連接性在美國及 全世界變得更廣泛(特定言之,至家庭及至租赁連接網際 網路之PC的「網咖」),遊戲日益增加地被經由下載而分 配至PC或控制台。又,寬頻帶連接日益增加地用於玩多人 及大型多人線上遊戲(該兩者在本揭示案中藉由首字母縮 寫詞「MMOG」來指稱)^此等改變減輕了與零售分配相 關聯之一些成本及問題《下載線上遊戲解決了遊戲出版商 之一些不利之處,因為分配成本通常較小且存在較少或不 136720.doc •14- 200941233 存在未出售媒體之成本。但已下載的遊戲仍經受盜版,且 由於其大小(大小常常為許多個十億位元組)而使得其可能 花費非常長之時間來下載。另外,多個遊戲可填滿小磁碟 機,諸如連同可攜式電腦一起或連同視訊遊戲控制台一起 出售之彼等磁碟機。然而,就遊戲或MM〇G需要線上連接 以使得遊戲可玩之程度而言,盜版問題得以減輕,因為通 常需要使用者具有有效的使用者帳戶。不同於可藉由相機 拍攝顯示螢幕之視訊或藉由麥克風記錄來自揚聲器之音訊 0 |複製的線性媒體(例#,視訊及音樂)’每一視訊遊戲體 驗係唯一的,且不可使用簡單視訊/音訊記錄來複製。因 此,甚至在未強力執行版權法且盜版猖獗的區域中,亦可 保護MMOG免於被盜版且因此可支援商業。舉例而言,已 成功地部署Vivendi SA之「魔獸世界」MM〇G,而在全世 界未遭受盜版。且許多線上或MM〇G遊戲(諸如,Linden Lab之「第二人生」MM〇G)經由建置於遊戲中之經濟模型 _ 而產生遊戲運營商的收入,其中資產可使用線上工具而帶 來、出售且甚至建立。因此,可使用除習知遊戲軟體購買 或訂用之外的機制來為線上遊戲之使用付費。 儘管由於線上或MMOG之性質而使得常.常可減輕盜版, 但線上遊戲運營商仍面臨其餘挑戰。許多遊戲需要大量的 本端(亦即,家庭内)處理資源以供線上適當地工 作。若使用者具有低效能之本端電腦(例如,不具有Gpu 之電腦,諸如低端膝上型電腦),則其可能不能夠玩該遊 戲。另外,隨著遊戲控制台老化,其遠落後於目前技術狀 136720.doc -15· 200941233 態且可能不能夠處理更高階之遊戲。即使假定使用者之本 端pc能夠處理遊戲之計算要求,常常亦存在安裝複雜度。 I能存在驅動器不相容性(例如,若下載新遊戲,則可能 安裝新版本的圖形驅動器,其致使依賴於舊版本圖形驅動 器之先前已安裝之遊戲不可操作)。隨著下載更多遊戲, 控制台可能用完本端磁碟空間。當發現缺陷並修復時或若 對遊戲進行了修改(例如’若遊戲開發商發現遊戲之級別 太難玩或太容易玩),複雜遊戲通常隨著時間推移而自遊 〇 μ發商接收下載之修補程式(patch)。此等修補程式需要 新的下載。但有時並非所有使用者完成所有修補程式之下 載。在其他時候,τ载之修補程式引入其他相容性或磁碟 空間消耗問題。 又,在遊戲播放期間,可能需要大資料下載以將圖形或 行為資sfl提供至本端PC或控制台。舉例而言,若使用者進 入MMOG中之-房間中,且遭遇由圖形資料組成或具有在 使用者之本端機器上不可用之行為的場景或人物,則必須 下載彼場景或人物之資料。若網際網路連接不夠快,則此 可導致玩遊戲期間的實質延遲。此外,若所遭遇之場景或 人物需要超過本端PC或控制台之儲存空間或計算能力的儲 存空間或計算能力,則其可產生一情形:其中使用者不可 在遊戲中繼續,或必須以品質降低之圖形繼續。因此,線 上或MMOG遊戲常常限制其儲存及/或計算複雜度要求。 另外,其常常限制遊戲期間之資料傳送的量。線上或 MMOG遊戲亦可使可玩遊戲之使用者之市場變窄。 136720.doc -16 · 200941233 此外’技術上博學之使用者日益增加地反向卫程設計遊 狀本端複本且修改遊戲以使得其可作弊。作弊可能與進 灯比用人力可能的速度快的重複按紐按壓(例如,以便非 常I·夬速地射擊)_般簡單。在支援遊戲中資產交易之遊戲 I,作弊可達到導致欺騙性交易涉及具有實際經濟價值之 資產的欺砟程度。當線上或MMOG經濟模型係基於該等資 產交易時,此可導致對遊戲運營商之實質有害後果。 開發新遊戲之成本隨著似控制台能夠製作愈加尖端的 0 遊戲(例如’具有更逼真之圖形(諸如,即時光線追縱),及 更逼真之行為(諸如,即時物理學仿真))而增長。在視訊遊 戲業之早期,視訊遊戲開發係與應用程式軟體開發非常類 似之過程;亦即,大多數開發成本係在軟體之開發中(與 圖形、音訊及行為要素或「資產」之開發相對比),諸如 可經開發以用於具有廣泛特殊效果之電影的彼等軟體開 發。現今,許多尖端的視訊遊戲開發努力比軟體開發更類 ㈣富有特殊效果之電影開發。舉例而言,許多視訊遊戲 提供3-D世界之仿真,且產生日益真實(亦即,看似與攝影 拍攝的活人動作影像一般逼真的電腦圖形)的人物、道具 及% i兄。照片般逼真的遊戲開發之最具挑戰方面中之一者 為建立不能區別於活人動作人面的電腦產生之人面。面部 俘獲技術(諸如’由CA之San Francisco之Mova開發的 C〇ntourm真實性俘獲系統)俘獲表演者之面部之精確幾何 形狀並在表演者處於運動中時以高解析度追蹤表演者之面 部之精確幾何形狀。此技術允許在PC或遊戲控制台上再現 136720.doc 200941233 3D面部,該3D面部實際上不能區別於所俘獲的活人動作 〇Microsoft Xbo?^&Xb〇x 36〇8; and Sichuan prints such as Gamecube8 and PC-based games. Each of these platforms is different from the others, so that games written to be executed on one platform are typically not executed on another platform. There may also be compatibility issues between a generation of devices and next-generation devices. Even though most software game developers build software games designed to be independent of the special platform, in order to execute a specific game on a specific platform, a proprietary software layer (which is often referred to as the "game development engine") is needed to adapt. The game is used on a specific platform. Each platform is sold to the consumer or itself as a "console" (i.e., a separate box attached to the TV or monitor/speaker). Typically, video games are sold on optical media such as Blu-ray, DVD_R0M or CD_R〇M, which contain video games embodied in sophisticated real-time software applications. As home broadband speeds increase, video games are increasingly becoming available for download 0, 136720.doc -11 - 200941233 Due to the immediacy and high computing requirements of high-end video games, platform compatibility with video game software is achieved. Particular requirements (4) demanding. For example, 'we may expect a full game from a video game to a next video game (for example, from XBox to XBox 360, or from Playstati〇n 2 ("ps2") to PlayStation 3 (rps3)) Capacity is as universal as the productivity application (eg, Microsoft Word) from -pc to another pc with a faster processing unit or core. However, this is not the case for video games. Because when a generation of video games is released, video game makers often seek the highest possible performance for a given price point, 2 to frequently make dynamic architectural changes to the system so that many games written for use in previous generation systems are It won't work on a later generation system. For example, the XBox is based on the χ86 series processor, while the χΒ〇χ 36〇 is based on the PowerPC series. Techniques can be used to simulate the previous architecture, but assuming that the video game is an instant application, it is often impractical to achieve the exact same behavior in the simulation. Jt is aware of the loss of fees, video game console manufacturers and video game software publishers. For the consumer, it means keeping the old-to-one video game console and the new-generation video game console connected to τν, which is enough to play all games. For the console manufacturer, it means the cost associated with the simulation of the stomach and the new console and the slower adoption. And for publishers, it means that multiple versions of the new game may have to be released: cover all potential consumers - not only for each version of the video game, such as 'XBox, Playstati〇n'. It is also often used to give versions of each of the trademarks (for example, PS2 and PS3). For example, 136720.doc -12. 200941233 For the development of the separate version of the electronic art "Crazy 撖 〇 8" for XBox XBox 360, PS2, PS3, Gamecube, Wii and PC platforms and other platforms. Portable devices such as cellular phones and portable media players also challenge game developers. With increased benefits, these devices connect to the wireless data network and are able to download video games. However, there are a variety of cellular phones and media devices in the market that have a variety of different resolutions and computing powers. Also, because such devices typically have power consumption, cost, and weight G constraints, they typically lack high-level graphics acceleration hardware like a graphics processing unit ("GPU") (such as those manufactured by Nvidia of CAiSanta Ciara). Therefore, game software developers typically develop a given game title that is used for many different types of portable devices. The user can find: The given game title is not available #its specific cellular phone or portable media player. In the case of a home game console, the hardware platform S-seller typically asks the software game developer for the version of the game for publishing the game on its platform. Honeycomb telephony wireless communication companies often also ask game publishers for royalties to download games to cellular phones. In the case of 1> (: game, there is no royalties paid for publishing the game, but the game developers usually face due to the high consumer service burden for supporting multiple PC configurations and possible installation problems. High cost. In addition, pcs often have fewer obstacles to piracy of game software because they can be easily re-styled by technically savvy users and games can be more easily pirated and more easily distributed (eg, via Internet.) Therefore, for software game developers 136720.doc 200941233, there are costs and disadvantages found in game consoles, cellular phones and PCs. For console and Pc software game publishers In order to distribute the game through the retail channel, the publisher asks the retailer for a wholesale price below the sale price to give the retailer a profit margin. The publisher usually has to pay for the cost of manufacturing and distributing the physical media that holds the game. Retailers often ask publishers for "price protection fees" to cover possible accidental expenses (such as game sales). Out, or the price of the game is reduced, or the retailer must refund some or all of the wholesale price and/or withdraw the game from the buyer.) In addition, the retailer usually asks the publisher for the cost of selling the game in the flyer. In addition, retailers are increasingly buying back games from users who have completed the game, and then selling the games in the games they have used, usually not sharing the revenue of the used games with the game publisher. The following facts are added to the game. Publisher's cost burden: Games are often pirated and distributed via the Internet for users to download and copy for free. W As the Internet broadband speed increases and broadband connectivity becomes more widespread in the US and worldwide (Specifically, to the home and to the "Internet cafe" that rents a PC connected to the Internet), games are increasingly being distributed to PCs or consoles via downloads. Moreover, broadband connections are increasingly used to play multiple people. And large multiplayer online games (both of which are referred to in this disclosure by the acronym "MMOG") ^ such changes Lightening some of the costs and issues associated with retail distribution "Downloading online games solves some of the disadvantages of game publishers because distribution costs are usually small and there are fewer or no 136720.doc •14- 200941233 There are unsold media The cost of the game, but the downloaded game is still subject to piracy, and because of its size (often a large number of billions of bytes), it may take a very long time to download. In addition, multiple games can fill small magnetic A disk drive, such as a disk drive sold with a portable computer or with a video game console. However, the piracy problem is mitigated insofar as the game or MM〇G requires an online connection to make the game playable. Because it usually requires the user to have a valid user account. It is different from the video that can be used to capture the screen by the camera or to record the audio from the speaker by the microphone 0 | Copy the linear media (example #, video and music) 'each The video game experience is unique and cannot be copied using simple video/audio recordings. As a result, MMOGs can be protected from piracy and thus support commerce even in areas where copyright law is not enforced and pirated. For example, Vivendi SA's World of Warcraft MM〇G has been successfully deployed and has not been pirated throughout the world. And many online or MM〇G games (such as Linden Lab's "Second Life" MM〇G) generate revenue from game operators through the economic model built into the game, where assets can be brought using online tools. , sold and even established. Therefore, mechanisms other than the purchase or subscription of conventional game software can be used to pay for the use of online games. Although often due to the nature of online or MMOG, piracy can often be mitigated, online game operators still face the remaining challenges. Many games require a large number of local (i.e., in-home) processing resources to work properly on the line. If the user has a low-performance local computer (for example, a computer without a Gpu, such as a low-end laptop), it may not be able to play the game. In addition, as the game console ages, it lags far behind the current state of the art and may not be able to handle higher-order games. Even if it is assumed that the user's local PC can handle the calculation requirements of the game, there is often installation complexity. I can have drive incompatibility (for example, if a new game is downloaded, a new version of the graphics driver may be installed, which renders the previously installed game that is dependent on the old version of the graphics driver inoperable). As more games are downloaded, the console may run out of local disk space. When a defect is found and repaired, or if the game has been modified (eg 'If the game developer finds the level of the game too difficult to play or too easy to play), the complex game usually receives the download from the player during the time. Patch. These patches require a new download. But sometimes not all users complete all patch downloads. At other times, the tau fix introduces other compatibility or disk space consumption issues. Also, during game play, large data downloads may be required to provide graphics or behavioral sfl to the local PC or console. For example, if a user enters a room in a MMOG and encounters a scene or character that is composed of graphical material or has behavior that is not available on the user's home machine, then the material of the scene or character must be downloaded. If the internet connection is not fast enough, this can result in substantial delays during game play. In addition, if the scene or character encountered needs more than the storage space or computing power of the storage space or computing power of the local PC or console, it may generate a situation in which the user cannot continue in the game or must be of quality The reduced graphics continue. Therefore, online or MMOG games often limit their storage and/or computational complexity requirements. In addition, it often limits the amount of data transfer during the game. Online or MMOG games can also narrow the market for users of playable games. 136720.doc -16 · 200941233 In addition, 'technically erudite users are increasingly adding a reverse-process design to the native replica and modifying the game to make it cheating. Cheating may be as simple as pressing a flash with a repeating button that is faster than the human hand (for example, to shoot very quickly). In a game that supports asset trading in games, cheating can lead to a degree of deception that leads to fraudulent transactions involving assets of real economic value. When online or MMOG economic models are based on such asset transactions, this can lead to substantial harmful consequences for game operators. The cost of developing new games grows as consoles can produce increasingly sophisticated 0 games (such as 'having more realistic graphics (such as instant ray tracing), and more realistic behaviors (such as real-time physics simulation)) . In the early days of the video game industry, video game development was very similar to the development of application software; that is, most of the development costs were in the development of software (as opposed to the development of graphics, audio and behavioral elements or "assets"). ), such as their software development that can be developed for use in movies with a wide range of special effects. Today, many cutting-edge video game development efforts are more class-oriented than software development. (4) Film development with special effects. For example, many video games provide simulations of the 3-D world, and produce characters, props, and % i brothers that are increasingly realistic (i.e., computer graphics that appear to be realistic with live action images taken by photography). One of the most challenging aspects of photo-realistic game development is to create a human face that can't be distinguished from a living person's face. Facial capture techniques (such as 'C〇ntourm authenticity capture system developed by Mova of San Francisco, CA) capture the precise geometry of the performer's face and track the performer's face with high resolution while the performer is in motion Precise geometry. This technology allows the reproduction of the 136720.doc 200941233 3D face on a PC or game console. The 3D face can't actually be distinguished from the captured action.
面部。精確地俘獲及再現「照片般逼真的」人面在若干方 面有用。首先’高度可辨識之名人或運動員常常用於視訊 遊戲中(常常以尚成本雇用)’且不完美性可能對於使用者 而言顯而易見’從而使檢視體驗分心或令人不愉快。經常 地,需要高度細節來達成高度照片般逼真感-潛在地需要 再現大量多邊形及高解析度紋理(在多邊形及/或紋理在圖 框接圖框基礎上隨著面部移動而改變之情況下)。 當具有詳細紋理之高多邊形計數場景快速改變時,支援 遊戲之PC或遊戲控制台可能不具有足夠的RAM來儲存用 於遊戲片段中所產生的所需數目之動畫圖框的足夠多邊形 及紋理資料。另外,通常可用於15(:或遊戲控制台上之單一 光碟機或單-磁碟機通常比RAM緩慢得多,且通常不可跟 上GPU在再現多邊形及紋理中可接受的最大資料速率。當 前遊戲通常將大多數多邊形及紋理載人至^财,此意謂 給定場景在複雜度及持續時間上报大程度上受ram之容量 限制。在(例如)面部動畫製作之狀況下,此可能將%或遊 戲控制台限制於並無真實感之低解析度面部,或限制於僅 可在遊戲暫停且載人用於更多圖框之多邊形及紋理(及盆 他資料)之前在有限數目之圖框中製作成動畫的真實感面 當PC:控制台顯示類似於「正在載入...」之訊息時觀看 者=條越螢幕緩慢地移動由現今的複雜視訊遊戲之使用 者么認為内在缺點。下—個場景自磁碟(除非另外有條 136720.doc • 18 · 200941233 件’否則本文中之「磁碟」指代非揮發性光學媒體或磁性 媒體α及諸如半導體「快閃」記憶體之非磁碟媒體)載 入時之延遲可花費若干秒或甚至若干分鐘。此浪費時間且 可能使遊戲玩家相當受挫。如先前所論述,大量或所有延 遲可能係由於來自磁碟之多邊形、紋理或其他資料之載入 時間,但亦可能係以下狀況:當PC或控制台中之處理器及/ 或GPU準備用於場景之資料時,花費一部分載入時間。舉 例而言,英式足球視訊遊戲可允許玩家在大量玩家、小 〇 ,组、運動場及天氣條件當中選擇。因此,取決於選擇何特 疋、’且Π 了知*需要用於場景之不同多邊形、紋理及其他資 料(統稱「物件」)(例如,不同小組在其制服上具有不同色 彩及圖案)。有可能列舉各種排列中之許多或所有者且提 前預先計算物件中之許多或所有者並將物件儲存於用於儲 存遊戲之磁碟上。但是,若排列之數目大,則所有物件所 需之儲存量可能過大以致不能安裝在磁碟上(或太不切實 Q 際以致不能下載)。因此,現存之PC及控制台系統通常在 給定場景之複雜度與播放持續時間兩者上受約束且對於複 雜場景遭受長載入時間。 先前技術視訊遊戲系統及應用程式軟體系統之另一顯著 限制在於:其日益增加地使用(例如)3D物件之大資料庫 (諸如,多邊形及纹理),該等大資料庫需要被载入至pc或 遊戲控制台中以用於處理。如上所述,當將該等資料庫在 本端儲存於磁碟上時,該等資料庫可花費長時間來载入。 然而’若資料庫係儲存於遠端位置且經由網際網路來存 136720.doc •19- 200941233 取’則載人時間通常嚴重得多。在此種情形下,下載大次 料庫可能花費幾分鐘、幾小時或甚至幾天。另夕卜該等二 料庫常常產生大量費用(例如,用於遊戲、電影或歷史記 錄片中的詳細的高有桅帆船之3D模型)且意欲用於銷售給 本端終端使用者。然而,—旦資料庫被下載至本端㈣ 者’其就有被盜版之風險。在許多狀況下,使用者僅出於 估計資料庫以查看其是否適合使用者之需要(例如,當使 〇Face. Accurately capturing and reproducing "photo-realistic" faces is useful in several ways. First, 'highly recognizable celebrities or athletes are often used in video games (often hired at a cost)' and imperfections may be obvious to the user', making the viewing experience distracting or unpleasant. Often, high levels of detail are required to achieve a high degree of photorealistic sensibility - potentially the need to reproduce a large number of polygons and high resolution textures (in the case where polygons and/or textures change with the movement of the face on the basis of the frame) . When a high polygon count scene with detailed texture changes quickly, the PC or game console supporting the game may not have enough RAM to store enough polygons and texture data for the required number of animated frames generated in the game segment. . In addition, a single or single-disk drive that is typically used on a 15 (or game console) is typically much slower than RAM and typically cannot keep up with the maximum data rate that the GPU can accept in rendering polygons and textures. Games usually carry most polygons and textures to the fortune, which means that the complexity and duration of a given scene is largely limited by the capacity of the ram. In the case of, for example, facial animation, this might % or the game console is limited to low-resolution faces that are not realistic, or limited to a limited number of figures before the game is paused and the polygons and textures (and the potted data) are used for more frames. The realistic face of the frame is made into an animation. When the PC: console displays a message similar to "Loading...", the viewer = the bar is moving slowly and slowly by the users of today's complex video games. The next scene is from the disk (unless there is another 136720.doc • 18 · 200941233 pieces) otherwise the word "disk" in this document refers to non-volatile optical media or magnetic media alpha and such as semiconductors. Flashing "non-disk media of memory" can take a few seconds or even a few minutes to load. This wastes time and can be quite frustrating for gamers. As discussed earlier, a large or all delay may be due to magnetic The loading time of the polygon, texture or other data of the disc, but it may also be the case that when the processor and/or GPU in the PC or console prepares the data for the scene, it takes a part of the loading time. For example, Soccer video games allow players to choose among a large number of players, groups, groups, stadiums, and weather conditions. Therefore, depending on the choice of Hetery, 'and knowing*, different polygons, textures, and other features are needed for the scene. Information (collectively referred to as "objects") (for example, different groups have different colors and patterns on their uniforms). It is possible to enumerate many or all of the various arrangements and pre-calculate many or all of the objects in advance and store the objects in Used to store the game's disk. However, if the number of arrays is large, the storage required for all objects may be too large. Can be installed on a disk (or too unrealistic to download). Therefore, existing PC and console systems are usually constrained in both the complexity and playback duration of a given scene and are prone to complex scenes. Loading time. Another significant limitation of prior art video game systems and application software systems is that they increasingly use large databases such as polygons and textures of 3D objects, which need to be Loaded into a pc or game console for processing. As mentioned above, when the libraries are stored on the disk at the local end, the databases can take a long time to load. However, if the database is It is stored in a remote location and stored via the Internet 136720.doc •19- 200941233 Take 'the time of manned time is usually much more serious. In this case, it may take a few minutes, hours, or even days to download the large library. In addition, these two stocks often generate a large amount of expense (e.g., a detailed high-altitude sailing 3D model for use in games, movies, or historical recordings) and are intended for sale to local end users. However, once the database is downloaded to the local (four), it is at risk of being pirated. In many cases, the user only wants to estimate the database to see if it is appropriate for the user (for example, when making 〇
用者執行狀移動時,用於遊戲人物之犯服裝是否具有滿 意的外觀或外表)的目的而希望下載資料庫。對於在決定 進行講買之前估計㈣料庫之使时而言,長載人時間可 能係一阻礙。 —類似問題在MMOG(特定言之,如允許使用者利用日益 定製化人物之遊戲)中出現。對於顯示人物之?(::或遊戲控 制台,其需要能夠存取具有31)幾何形狀(多邊形、紋理等) 以及彼人物之行為(例如,若人物具有盾牌,則盾牌是否 足夠強以使矛偏轉)的資料庫。通常,當MM〇G由一使用 者初次玩時,用於人物之大量資料庫在遊戲之初始複本下 已經可用,遊戲之初始複本在本端在遊戲光碟上可用或經 下載至磁碟。但是,隨著遊戲進展,若使用者遭遇資料庫 在本端不可用之人物或物件(例如,若另一使用者已建立 一定製人物),則在可顯示彼人物或物件之前,必須下載 其資料庫。此可導致遊戲之實質延遲。 給定視訊遊戲之尖端性及複雜度,則在先前技術視訊遊 戲控制台情況下對視訊遊戲開發商及出版商之另一挑戰在 136720.doc •20· 200941233 於··開發視訊遊戲經常花費2年至3年,成本在數千萬美 元。假定新視訊遊戲控制台平台係以大致每隔五年一次之 速率引入’則遊戲開發商需要在新遊戲控制台發行之前的 數年開始彼等遊戲之開發工作,以便在發行新平台時使視 訊遊戲同時可用。來自競爭性製造商之若干個控制台有時 大約同時發行(例如,彼此在一年或兩年内),但尚待分曉 的係每一控制台之風行性(例如,哪個控制台將產生最大 視訊遊戲軟體銷售)。舉例而言,在近來的控制台循環 〇 中,Mlcrosoft XBox 360、Sony Playstation 3及Nintendo Wii 預定為在大約相同的一般時間框引入。但在該等引入之前 的數年中,遊戲開發商實質上必須「壓注」哪些控制台平 台將比其他者更成功,且相應地投入其開發資源。電影製 作公司亦必須在電影發行之前很長時間基於其估計可能成 功之電影而分攤其有限的製作資源。給定視訊遊戲所需之 投資之增長程度’則遊戲製作愈加變得類似電影製作,且 遊戲製作公司常規上基於其對特定視訊遊戲之將來成功的 估計而投入其製作資源。但是,不同於電影公司,此壓注 並非僅基於製作本身之成功;實情為,其依據於遊戲意欲 在其上執行之遊戲控制台的成功。同時在多個控制台上發 行遊戲可減輕風險,但此額外努力増加成本,且經常延遲 遊戲之實際發行。 pc上之應用程式軟體及使用者環境正變得更為計算上密 集、動態及互動,不僅使其在視覺上更吸引使用者,而且 使其更有用及直觀。舉例而言,新Windows VistaTM作業系 136720.doc 21 200941233 統與Macintosh®作業系統之相繼版本兩者併有視覺動晝效 應。尚階圖形工具(諸如,來自Autodesk公司之MayaTM)提 供非常尖端之3D再現及動晝製作能力(其推動了目前技術 狀態的CPU及GPU之限制)。然而,此等新工具之計算要求 對於該等產品之使用者及軟體開發商而言產生許多實際問 題。 因為作業系統(OS)之視覺顯示必須在多種電腦(包括不 再出售但仍可隨著新〇S而升級之前代電腦)上工作,〇s圖 Ο 形要求在很大程度上受os意欲用於之電腦(其通常包括不 包括GPU之電腦)的最少共同點限制。此嚴重地限制之 圖形能力。此外’電池供電之可攜式電腦(例如,膝上型 電腦)限制視覺顯示能力,因為CPU或GPU中之高計算活動 通常導致較高電力消耗及較短電池壽命。可攜式電腦通常 包括在不利用處理器時自動地減低處理器活動性以降低電 力消耗的軟體。在一些電腦型號中,使用者可手動地減低 處理器活動性。舉例而言’ Sony之VGN-SZ280P膝上型電 腦含有在一側上標記為「Stamina」(用於低效能,更長電 池壽命)且另一側上標記為「Speed」(用於高效能,較短電 池壽命)之交換器。在可攜式電腦上執行之〇S必須能夠即 使在電腦以其峰值效能能力之一分率執行的情況下亦可用 地起作用。因此,OS圖形效能常常保持為遠低於目前技術 狀態的可用計算能力。 經常出售高端的計算上密集之應用程式(如Maya),期望 該等應用程式將用於高效能PCi。此通常產生高得多的效 136720.doc •22- 200941233 能,及更昂貴且可攜性較差、最少共同點之要求。因此, 該等應用程式具有比通用os(或通用生產力應用程式,類 似Microsoft Office)有限得多的目標受眾且通常以比通用 OS軟體或通用應用程式軟體低得多的量出售。潛在的受眾 進-步受限制’因為預期的使用者時常難以提前試用該等 計算上密集之應用程式.舉例而言,假設學生希望瞭解如 何使用M—或已經知道該等應用程式之潛在購買者在購買 巾希望在進打投資之前試賴aya(此可能涉及亦構買能夠 〇 執行Maya之高端電腦)。當學生或潛在購買者可下載Maya 之演示版本或得到Maya演示版本之實體媒體複本時,若其 缺乏能夠執行Maya至其全部潛能(例如,處理複雜3〇場景 之電腦,則其將不能夠進行產品之全方位評估。此實質上 限制該等高端應用程式之受眾。其亦使出售價格變高因 為開發成本通常經由比通用應用程式之購買次數小得多之 購買次數而清償。 高價應用程式亦對使用應用程式軟體之盜版複本之個體 及商業產生更多刺激。因此,高端應用程式軟體遭受福派 盜版’儘管該軟體之出版商進行了大量努力來藉由各種技 術減輕該盜版。但是’甚至當使用盜版的高端應用程式 時,使用者亦不可能排除投資昂貴的目前技術狀態的?〇:來 執行盜版複本之需要。因此,儘管使用者可以軟體應用程 式之實際零售價格之一分率獲得軟體應用程式之使用,但 盜版軟體之使用者仍需要購買或獲得昂貴的pc,以便完全 利用該應用程式。 136720.doc •23- 200941233 此對於高效能盜版視訊遊戲之使用者同樣成立。儘管盜 版者可以遊戲之實際價格之一分率得到遊戲,但其仍需要 購買適當地玩遊戲所需的昂貴計算硬體(例如,GPU_增強 型PC ’或類似ΧΒοχ 360之高端視訊遊戲控制台)。假定視 訊遊戲通常為消費者之娛樂,則用於高端視訊遊戲系統之 額外成本可為過於昂貴的。此情形在當前工人之平均年收 入相當低(相對於美國之當前工人平均年收入)的國家(例 如’中國)中更糟。因此,小得多的百分比之人口擁有高 0 端視訊遊戲系統或高端PC。在該等國家中,使用者可支付 費用以使用連接至網際網路之電腦的「網咖」相當普遍。 經常地’該等網咖具有不具有高效能特徵(諸如,原本可 使玩家能夠玩計算上密集之視訊遊戲的GPU)的較舊型號 或低端PC。此為在低端PC上執行之遊戲成功的關鍵因素 (諸如,Vivendi之「魔獸世界」,其在中國高度成功,且通 常係在中國的網咖中玩)。相比之下,計算上密集之遊戲 Q (如「第二人生」)更不可能在安裝於中國網咖中之PC上 玩。該等遊戲實際上達不到僅能夠存取網咖中之低效能pc 的使用者。 對於考慮購買視訊遊戲且首先願意藉由經由網際網路將 廣不下載至其家庭而試用遊戲之示範版本的使用者亦存在 障礙。視訊遊戲演示常常為遊戲之全能版本,其中一些特 徵停用,或對遊戲播放之量施加限制。此可能涉及在可將 遊戲安裝於PC或控制台上且在PC或控制台上執行之前下 栽數十億位元組之資料的長過程(可能幾個小時)^在pc之 136720.doc * 24 - 200941233 狀况下,其亦可能涉及算出遊戲需要哪些特殊驅動器(例 如,DirectX或〇penGL驅動器),下載正確的版本,安裝正 確的版本,及接著判定PC是否能夠播放該遊戲。此後者步 驟可能涉及判定PC是否具有足夠的處理(cpiJ及GPU)能 力、足夠的RAM及相容的OS(例如,一些遊戲在Wind〇ws XP上執行而不在Vista上執行)。因此,在試圖執行視訊遊 戲演示之長過程之後,使用者可能發現視訊遊戲演示不可 能玩(給定使用者之PC組態)。更糟地,一旦使用者已下載 〇 新驅動器以便嘗試該演示,此等驅動器版本就可能與使用 者在PC上習慣使用的其他遊戲或應用程式不相容,因此, 演示之安裝可致使先前可操作的遊戲或應用程式不能操 作。此等障礙不僅使使用者受挫,而且其對視訊遊戲軟體 出版商及視訊遊戲開發商銷售其遊戲產生障礙。 導致不具經濟效益之另一問題與以下事實有關:給定pc 或遊戲控制台通常經設計以適應對應用程式及/或遊戲的 特定程度之效能要求。舉例而t,一些PC具有或多或少之 RAM、較緩慢或較快之CPU及較緩慢或較快之Gpu(若其 具有GPU)。-些遊戲或應用程式利用給定pc或控制台^ 全十算自b力而些遊戲或應用程式卻不利用給定pC或控 制台之全計算能力。若使用者之遊戲或應用程式之選擇未 達到本端PC或控制台之峰值效能能力,則使用者可能由於 未利用之特徵而在PC或控制台上浪費了財力。在控制台之 狀況下#制台製造商可能支付地比資助控制台成本所要 136720.doc -25- 200941233It is desirable to download the database for the purpose of whether the user's clothing for the game character has a satisfactory appearance or appearance when the user moves. Long-term man time can be a hindrance when estimating (4) the treasury before deciding to buy. - Similar issues arise in MMOGs (specifically, games that allow users to take advantage of increasingly customized characters). For showing people? (:: or game console, which needs to be able to access a database with 31) geometry (polygons, textures, etc.) and the behavior of the character (for example, if the character has a shield, then the shield is strong enough to deflect the spear) . Typically, when MM〇G is played for the first time by a user, a large database for the character is available under the initial copy of the game, and the initial copy of the game is available on the game disc or downloaded to the disk at the local end. However, as the game progresses, if the user encounters a person or object that the database is not available at the local end (for example, if another user has created a custom character), the user or the object must be downloaded before the person or object can be displayed. database. This can result in a substantial delay in the game. Given the sophistication and complexity of video games, another challenge for video game developers and publishers in the case of prior art video game consoles is 136720.doc •20· 200941233. From three to three years, the cost is tens of millions of dollars. Assume that the new video game console platform is introduced at a rate almost every five years. 'The game developers need to start the development of their games in the years before the new game console is released, so that the video will be available when the new platform is released. The game is also available. Several consoles from competing manufacturers are sometimes released at about the same time (for example, within a year or two of each other), but it remains to be seen that each console is popular (for example, which console will produce the maximum video) Game software sales). For example, in recent console loops, the Microsoft XBox 360, Sony Playstation 3, and Nintendo Wii are scheduled to be introduced in approximately the same general time frame. But in the years leading up to these introductions, game developers must essentially “press” which console platforms will be more successful than others and invest their development resources accordingly. Film production companies must also share their limited production resources for a long time before the film is released based on the film that it estimates may be successful. Given the degree of growth in investment required for video games, game production is becoming more and more similar to film production, and game production companies routinely invest in their production resources based on their estimates of the future success of a particular video game. However, unlike film companies, this bet is not based solely on the success of the production itself; the truth is that it is based on the success of the game console on which the game is intended to execute. Simultaneously launching games on multiple consoles mitigates the risk, but this extra effort adds cost and often delays the actual release of the game. The application software and user environment on the PC are becoming more computationally intensive, dynamic and interactive, making it more visually appealing to the user and making it more useful and intuitive. For example, the new Windows VistaTM operating system 136720.doc 21 200941233 and the successive versions of the Macintosh® operating system have visual effects. Good-looking graphical tools, such as MayaTM from Autodesk, offer very cutting-edge 3D rendering and dynamic production capabilities that push the limits of current state of the art CPUs and GPUs. However, the calculation requirements for these new tools create many practical problems for users and software developers of such products. Because the visual display of the operating system (OS) must work on a variety of computers (including those that are no longer sold but can still be upgraded with the new 〇S), the 要求 Ο 要求 requirement is largely intended by os The minimum commonality limit for computers (which typically include computers that do not include GPUs). This severely limits the graphics capabilities. In addition, battery powered portable computers (e.g., laptops) limit visual display capabilities because high computing activity in the CPU or GPU typically results in higher power consumption and shorter battery life. Portable computers typically include software that automatically reduces processor activity to reduce power consumption when the processor is not being utilized. In some computer models, the user can manually reduce processor activity. For example, 'The Sony VGN-SZ280P laptop has a side labeled "Stamina" on one side (for low performance, longer battery life) and the other side is labeled "Speed" (for high performance, Switch for shorter battery life). The S must be executed on a portable computer to function even when the computer is executed at one of its peak performance capabilities. As a result, OS graphics performance often remains available at much lower computing power than current state of the art. High-end, computationally intensive applications such as Maya are often sold, and it is expected that these applications will be used for high-performance PCi. This usually yields much higher efficiency. 136720.doc •22- 200941233 can, and is more expensive and less portable, with the least commonality. As a result, such applications have a much lower target audience than generic os (or generic productivity applications, similar to Microsoft Office) and are typically sold in much lower quantities than general purpose OS software or general purpose application software. Potential audiences are subject to restrictions' because it is often difficult for prospective users to try out these computationally intensive applications in advance. For example, suppose students want to know how to use M — or already know the potential buyers of such applications Try to rely on aya before buying a purchase (this may involve buying a high-end computer that can execute Maya). When a student or prospective purchaser can download a demo version of Maya or a physical media copy of the Maya demo version, it will not be able to perform Maya to its full potential (for example, a computer that handles complex 3 scenes) A comprehensive assessment of the product. This substantially limits the audience of these high-end applications. It also makes the sale price higher because the development cost is usually paid off through the purchases that are much smaller than the number of purchases of the generic application. It is more irritating to individuals and businesses that use pirated copies of the application software. As a result, high-end application software suffers from piracy, although the publisher of the software has made great efforts to mitigate the piracy through various technologies. But even When using pirated high-end applications, it is impossible for users to rule out the need to invest in expensive current state of the art: to perform pirated copies. Therefore, although users can get a fraction of the actual retail price of the software application Use of software applications, but users of pirated software are still Buy or get an expensive PC to fully utilize the app. 136720.doc •23- 200941233 This is also true for users of high-performance pirated video games. Although pirates can get games at a fraction of the actual price of the game, But it still needs to purchase the expensive computing hardware needed to play the game properly (for example, GPU_Enhanced PC' or a high-end video game console like ΧΒοχ 360.) Assuming that video games are usually entertainment for consumers, then The extra cost of a high-end video game system can be too expensive. This situation is worse in countries where the average annual income of current workers is relatively low (relative to the current average annual income of workers in the US) (eg 'China'). A large percentage of the population has high-end video game systems or high-end PCs. In these countries, it is quite common for users to pay for the use of computers connected to the Internet. "Often." Coffee has older features that don't have high-performance features, such as GPUs that would otherwise allow players to play computationally intensive video games. Number or low-end PC. This is a key factor in the success of games executed on low-end PCs (such as Vivendi's "World of Warcraft", which is highly successful in China and is usually played in Chinese Internet cafes). Under the circumstance, the computationally intensive game Q (such as "Second Life") is less likely to play on PCs installed in Chinese Internet cafes. These games actually do not reach the low-performance PCs that only have access to Internet cafes. Users who are considering the purchase of video games and are first willing to try out the demo version of the game by downloading them to their home via the Internet. Video game demos are often the all-around version of the game, some of them. Feature deactivation, or restrictions on the amount of game play. This may involve a long process of loading billions of bytes of data before the game can be installed on a PC or console and executed on a PC or console ( It may be a few hours) ^ In the case of pc 136720.doc * 24 - 200941233, it may also involve calculating which special drivers (such as DirectX or 〇penGL drivers) the game needs, and downloading the correct ones. Version, install the correct version, and then determine if the PC can play the game. The latter step may involve determining if the PC has sufficient processing (cpiJ and GPU) capabilities, sufficient RAM, and a compatible OS (for example, some games are executed on Wind〇ws XP and not on Vista). Therefore, after attempting to perform the video game presentation process, the user may find that the video game demo is not playable (given the user's PC configuration). Worse, once the user has downloaded a new drive to try the demo, these drive versions may be incompatible with other games or applications that the user is accustomed to using on the PC, so the installation of the demo may result in the previous The game or application being operated cannot be operated. These obstacles not only frustrated users, but they also created obstacles for video game software publishers and video game developers to sell their games. Another problem that leads to non-economic benefits is related to the fact that a given pc or game console is typically designed to accommodate a particular level of performance requirements for the application and/or game. For example, some PCs have more or less RAM, a slower or faster CPU, and a slower or faster Gpu (if they have a GPU). - Some games or applications take advantage of a given pc or console. Some games or applications do not take advantage of the full computing power of a given pC or console. If the user's game or application selection does not meet the peak performance capabilities of the local PC or console, the user may be wasting money on the PC or console due to unused features. In the case of the console, the manufacturer of the platform may pay more than the cost of the console. 136720.doc -25- 200941233
存在於視訊遊戲之銷售及享受中的另一問題涉及在使用 者實施購買遊戲之前允許使用者觀看他人玩遊戲。存在用 於記錄視訊遊戲以在稍後時間重放的若干先前技術方法。 舉例而言,美國專利第5,558,339號教示了在「遊戲播放」 期間將遊戲狀態資訊(包括遊戲控制器動作)記錄於視訊遊 戲用戶端電腦(由同一或不同使用者擁有)中。此狀態資訊 可在梢後時間使用以在視訊遊戲用戶端電腦(例如,pc或 控制台)上重放4或所有遊戲㈣。&方法 < 顯著缺點 在於:對於檢視已記錄之遊戲的使用者,使用者必須具有 能夠播放該遊戲之視訊遊戲用戶端電腦且必須具有在彼電 腦上執行之視訊遊戲應用程式,以使得當重放已記錄之遊 戲狀態時遊戲播放係等同的^除此之外,視訊遊戲應用程 式必須係以在已記錄之遊戲與經回放之遊戲之間不存在可 能的執行差異的此種方式編寫β 舉例而言,遊戲圖形大體係在圖框接圖框基礎上計算。 對於許多遊戲’取決於場景是否特別複雜或是否存在減緩 執行之其他延遲(例如’在PC上’另一過程可能正在執 行’以致自遊戲應用程式奪走CPU循環),遊戲邏輯有時可 能花費比-圖框時間短或比一圖框時間長之時間來計算為 下-個圖框而顯示之圖形。在此種遊戲中,以比一圖框時 間稍少之時間(例如,少幾個CPU時脈循環)計算的「臨限 值」圖框最終可出現。當使用完全相同之遊戲狀態資訊再 次計算彼同-場景時,.可能容易花費比—圖框時間多幾個 CPU時脈循環之時間(例如 若内。卩CPU匯流排稍微與外部 136720.doc •26- 200941233 DRAM匯流排不同相’且即使不存在來自自遊戲處理奪走 數毫秒CPU時間之另一過鞀从, βAnother problem that exists in the sale and enjoyment of video games involves allowing the user to watch others play the game before the user implements the purchase of the game. There are several prior art methods for recording video games for playback at a later time. For example, U.S. Patent No. 5,558,339 teaches that game state information (including game controller actions) is recorded during a "game play" on a video game client computer (owned by the same or different users). This status information can be used at a later time to replay 4 or all games (4) on a video game client computer (eg, a pc or console). &method< significant disadvantage is that for the user who views the recorded game, the user must have a video game client computer capable of playing the game and must have a video game application executed on the computer so that when In addition to the playback of the recorded game state, the game playback is equivalent. In addition, the video game application must be programmed in such a way that there is no possible difference in execution between the recorded game and the played back game. For example, the game graphics system is calculated based on the frame of the frame. For many games, depending on whether the scene is particularly complex or if there are other delays that slow down execution (eg 'on the PC' another process may be executing 'so that the CPU loop is taken from the game application), the game logic may sometimes cost - The frame time is short or longer than a frame time to calculate the graphic displayed as the next frame. In such a game, a "threshold value" frame calculated with less time than a frame time (for example, a few CPU clock cycles) may eventually appear. When using the same game state information to calculate the same - scene again, it may be easier to spend more than a few CPU clock cycles than the frame time (for example, if the CPU bus is slightly external to 136720.doc • 26- 200941233 DRAM buss are out of phase' and even if there is no other slave from the game processing taking a few milliseconds of CPU time, β
程的大延遲’其亦引入幾個CPU 循環時間之延遲)。因此’當回放遊戲時,圖框變成以兩 個圖框時間計算而非以單一圖框時間計算。一些行為係基 於遊戲計算新圖框之頻率(例如,當遊戲取樣來自遊戲控 制器之輸入時)。當播放遊戲時,用於不同行為的時間參 考中之此偏差不會影響遊戲播放,但其可導致所回放之遊 纟產生不同結果。舉例而言1籃球之軌道係以穩定的60 fps速率來计箅,但遊戲控制器輸入係基於經計算之圖框 之速率來取樣,則當記錄遊戲時,經計算之圖框之速率可 能為53 fps,而當重放遊戲時,經計算之圖框之速率可能 為52 fpS,此可使得籃球是否被阻止進入籃中存在差異, 從而導致不同結果。因此,使用遊戲狀態記錄視訊遊戲需 要非常謹慎之遊戲軟體設計,以確保使用同一遊戲狀態資 訊重放產生完全相同之結果。 用於記錄視訊遊戲之另前技術方法係僅記錄PC或視 讯遊戲系統之視訊輸出(例如,至VCR、DVD記錄器,或 至PC上之視訊俘獲板)。接著可將視訊回倒及重放,或替 代地,將已記錄之視訊上載至網際網路(通常在將視訊壓 縮之後)。此方法之不利之處在於;當回放3〇遊戲序列 時,使用者限於僅自檢視點(序列被自其記錄)來檢視序 列。換言之,使用者不可改變場景之檢視點。 另外,當經由網際網路而使在家庭pc或遊戲控制台上播 放的已記錄之遊戲序列的經壓縮之視訊為其他使用者可用 136720.doc -27- 200941233 時,即使視訊係即時壓縮,亦不可能即時地將經壓縮之視 訊上載至網際網路。其原因係因為世界上連接至網際網路 之許多家庭具有高度不對稱之寬頻帶連接(例如,DSL及電 纔數據機通常具有比上傳頻寬高得多的下傳頻寬)。經壓 縮之高解析度視訊序列常常具有比網路之上傳頻寬容量高 的頻寬,使得其不可能即時上載。因此,在播放遊戲序列 之後(可能幾分鐘或甚至幾小時),在網際網路上之另一使 用者能夠檢視該遊戲之前,將存在顯著延遲。儘管此延遲 0 在特定情形下(例如,觀看在先前時間出現的遊戲玩家之 成果)可容忍,但其消除了觀看遊戲現場直播(例如,由優 勝玩家玩的籃球錦標賽)之能力或現場直播地播放遊戲時 的「即刻重放J能力。 另一先前技術方法允許具有電視接收器之檢視者觀看視 讯遊戲現場直播’但僅在電視製作人員之控制下。美國與 其他國家中的一些電視頻道提供視訊遊戲檢視頻道,其中 Q 電視觀眾能夠在視訊遊戲頻道上觀看特定視訊遊戲使用者 (例如,參加錦標赛之頂級玩家)。此藉由將視訊遊戲系統 (PC及/或控制台)之視訊輸出饋送至用於電視頻道之視訊分 配及處理設備中來完成。此正如電視頻道廣播現場直播之 籃球比賽時的情況,其中若干個相機自籃球場周圍之不同 角度提供現場直播之饋送。電視頻道接著能夠利用其視訊/ 音訊處理及效應設備來操縱來自各種視訊遊戲系統之輸 出。舉例而言,電視頻道可在來自視訊遊戲的視訊之上上 覆指示不同玩家之狀態的文字(正如其可在現場直播之籃 136720.doc -28- 200941233 球比赛期間上覆文字),且電視頻道可加錄來自評論員(其 τ ’述在比赛期間出現之動作)之音訊。另外,可將視訊 遊戲輸出與記錄遊戲之實際玩家之視訊的相機(例如,展 示玩家對遊戲之情緒反應)組合。 此方法之一問題在於:必須即時地使該等現場直播之視 訊饋送為電視頻道之視訊分配及處理設備可用,以便使其 具有現場直播之廣播的刺激性。然而,如先前所論述,當 視訊遊戲系統係自家庭執行時(尤其是當廣播之一部封包 Θ 〖括來自正俘獲遊戲玩家之真實世界視訊之相機的現場直 播之視訊時),此常常不可能。另外,在錦標賽情形下, 所關注的為家庭中遊戲者可修改遊戲及作弊,如先前所描 述。由於此等原因,電視頻道上之該等視訊遊戲廣播常常 配置有聚集於公共位置處(例如,在電視演播室處或在競 技場中)之播放器及視訊遊戲系統,其中電視製作設備可 接受來自多個視訊遊戲系統及潛在的現場直播之相機的視 訊饋送。 儘管該等先前技術視訊遊戲電視頻道可為電視觀眾提供 非常刺激之演出(其為與現場直播之運動事件同類(例如, 與以「運動員」呈現之視訊遊戲玩家同類)的體驗,不僅 根據其在視訊遊戲世界中之動作’而且根據其在真實世界 中之動作)’但此等視訊遊戲系統常常限於玩家彼此實體 極接近之情形。此外,因為電視頻道係經廣播,所以每一 經廣播之頻道僅可展示由電視頻道之製作人員選擇的一視 訊流。由於此等限制及廣播時間、製作設備及製作人員之 136720.doc -29- 200941233 咼成本,該等電視頻道通常僅展示參加頂級錦標賽之頂級 玩家。 另外,向全部電視觀眾廣播視訊遊戲之全螢幕影像的給 定電視頻道每次僅展示一視訊遊戲。此嚴重地限制電視檢 視者之選擇。舉例而言,電視檢視者可能對給定時間展示 之遊戲不感興趣。另一檢視者可能僅對觀看並非由電視頻 道在給定時間放映的特定玩家之遊戲播放感興趣。在其他 狀況下,檢視者可能僅對觀看内行玩家如何處理遊戲中之 〇 肖定級別感肖趣。#他檢視者可能希望控制檢視點(視訊 遊戲係自其來看),該檢視點不同於由製作小組等選擇之 檢視點。簡言之,電視檢視者在觀看視訊遊戲中可能具有 無數的偏好(即使若干個不同電視頻道可用,電視網路之 特疋廣播亦不適應該等偏好)。由於所有上述原因,使得 先前技術視訊遊戲電視頻道在向電視檢視者呈現視訊遊戲 中具有顯著限制。 先前技術視訊遊戲系統及應用程式軟體系統之另一缺點 在於:其複雜’且通常遭受錯誤、崩潰及/或非所欲且不 需要的行為(統稱「缺陷」)。儘管遊戲及應用程式在發行 之前通常經歷除錯及調諧過程(經常稱為「軟體品質保 證」或SQA),但幾乎不變的是:—旦遊戲或應用程式被 f行至領域中之廣大受眾,缺陷就會突然出現。遺憾的 疋軟體開發商難以在發行之後識別及追縱到許多缺陷。 軟體開發商可能難以意識到缺陷。即使當其瞭解一缺陷 時,亦可能僅存在其可用於識別是什麼引起該缺陷的有限 136720.doc -30· 200941233 量之資訊。舉例而言,使用者可打電話給遊戲開發商之消 費者服務熱線且留下訊息,該訊息陳述:當玩遊戲時,螢 幕開始閃爍’接著改變成固體藍且PC凍結。其為SQA小組 提供了在追縱缺陷中有用的非常少之資訊。線上連接之一 些遊戲或應用程式在特定狀況下有時可提供更多資訊。舉 例而s ’有時可使用「看門狗」過程來監視遊戲或應用程 式是否「崩潰」,看門狗過程可收集遊戲或應用程式崩潰 時關於遊戲或應用程式過程之狀態(例如,記憶體堆疊之 〇 使用狀態、遊戲或應用程式進展至之程度等)的統計,且 接著經由網際網路而將彼資訊上載至SQA小組。但在複雜 遊戲或應用程式中,該資訊可花費非常長之時間來解密, 以便準確地判定在崩潰時使用者正在進行什麼。儘管如 此,亦不可能判定何事件序列導致崩潰。 與PC及遊戲控制台相關聯之又一問題在於:其經受使消 費者極不便利之服務問題。服務問題亦影響pc或遊戲控制 台之製造商’因為其通常需要發送特殊盒子以安全地裝運 破相的PC或控制台,且因而招致修理之成本(若pc或控制 台處於保修期内)《遊戲或應用程式軟體出版商亦可受處 於修理狀態中之PC及/或控制台引起的銷售損失(或線上服 務使用)影響。 圖 1 說明諸如 Sony Playstation® 3、Microsoft Xb〇x 360®、Nintendo Wii™、以Windows為基礎之個人電腦或 Apple Macintosh的先前技術視訊遊戲系統。此等系統中之 每一者包括用於執行程式碼之中央處理單元通常為 I36720.doc -31 · 200941233 用於執行高階圖形操作之圖形處理單元(GPU)),及用於與 外部器件及使用者通信的多個形式之輸入/輸出(1/〇)。為 簡單起見,將此等組件展示為組合在一起為單一單元 100 °圖1之先前技術視訊遊戲系統亦展示為包括光學媒體 驅動器104(例如,DVD_R〇M驅動器);用於儲存視訊遊戲 程式碼及資料之硬碟機! 03;用於播放多人遊戲、用於下 載遊戲、修補程式、演示或其他媒體之網路連接1〇5;用 於儲存當前正由CPU/GPU 100執行之程式碼的隨機存取記 〇 憶體(RAM)i〇i ;用於在遊戲播放期間接收來自使用者之 輸入命令的遊戲控制器1〇6 ;及顯示器件1〇2(例如,SDTV/ HDTV或電腦監視器)。 圖1中所展示之先前技術系統遭受若干限制。首先,與 RAM 101之存取速度相比較,光碟機1〇4及硬碟機1〇3往往 具有緩慢得多的存取速度《當直接經由RAM 1〇1工作時, 由於RAM 101通常具有高得多的頻寬且不會遭受光碟機構 之㈣長的搜尋延遲的事實,CPU/Gpu i⑽在實踐中可處 ϋ 理比直接自硬碟機103或光碟機⑽讀出程式碼及f料時可 能的每秒多邊形數多得多的每秒多邊形數。但僅有限量之 RAM提供於此等先前技術系統中(例如,mu位元 組)。因此’常常需要「正在載入·..」序列,其中rami〇i 被週期性地填以用於視訊遊戲之下一個場景的資料。 -些系統試圖同時地重4程式碼之栽入與遊戲播放,但 此僅可在存在e知序狀事件時進行(例如,若正沿道路 駕駛車,則可在駕驶車的同時载入路旁之正接近的建築物 136720.doc •32- 200941233 的幾何形狀)。對於複雜及/或快速場景改變,此類型之重 叠通常不起作業。舉例而言’在使用者處於戰役進行之中 且在彼時刻之視圖内RAM 101完全被填滿表示物件之資料 的狀況下’若使用者將視圖快速地向左移動以檢視當前未 載入於RAM 101中之物件,則將導致動作之不連續性,因 為不存在足夠的時間來將新物件自硬碟機1〇3或光碟機1〇4 載入至RAM 1 01中。 圖1之系統的另一問題係由於硬碟機1〇3及光學媒體1〇4 0 之儲存容量之限制引起。儘管磁碟儲存器件可被製造成有 相對大之儲存容量(例如,5〇〇億位元組或5〇〇億位元組以 上)’但其仍不提供用於在當前視訊遊戲中所遭遇之特定 情況的足夠儲存容量。舉例而言,如先前所敍述,英式足 球視訊遊戲可允許使用者在全世界的許多小組、玩家及運 動場當中選擇。對於每一小組、每一玩家及每一運動場, 需要大量紋理映射及環境映射來特徵化世界上之3D表面 (例如,每一小組具有一唯一運動衫,每一者需要一唯一 W 紋理映射)。 用於解決此後者問題之一技術係:對於遊戲,一旦使用 者選擇了紋理及環境映射’就預先計算紋理及環境映射。 此可涉及許多5十算上密集之過程,包括解壓縮影像、3D映 射加陰影、組織資料結構等。因此,當視訊遊戲執行此 等計算時,對於使用者可能存在延遲。減少此延遲之一方 法原則上為:最初開發遊戲時執行所有此等計算_包括小 組、玩家名冊及運動場之每一排列。遊戲之發行版本因而 136720.doc •33- 200941233 將包括储存於光學媒體1〇4上或網際網路上之一或多個伺 服器上的所有此經預先處理之資料,當使用者作出選擇 時’僅經由網際網路將用於給定小組、玩家名冊、運動場 選擇的選定之預先處理之資料下載至硬碟機1〇3。然而, 作為實際問題,遊戲播放中可能的每個排列之該預先載入 之資料可能輕易地為數太位元組(terabyte)之資料,其遠超 過現今的光學媒體器件之容量。此外,用於給定小組、玩 家名冊、運動場選擇之資料可能輕易地為數億位元組之資 〇 料或數億位元組以上之資料。在家庭網路連接之情況下 (例如’ 10 Mbps)’經由網路連接1〇5下載此資料將比在本 端計算資料花費更長時間。 因此,圖1中所展示之先前技術遊戲架構使使用者在複 雜遊戲之較大場景轉變之間經受顯著延遲。 諸如圖1中所展示之先前技術方法的先前技術方法的另 一問題在於:這些年來,視訊遊戲傾向於變得更高階且需 要更多Cpu/GPU處理能力。因此,即使採用無限量之 RAM,視訊遊戲硬體要求亦超過此等系統中可用之處理能 力的峰值位準。因此,需要使用者每隔幾年升級遊戲硬體 以保持同步(或以較低品質水準玩較新遊戲)。比以往更高 階之視訊遊戲之趨勢的一後果為:用於家庭用途的玩視訊 遊戲之機器通常不具經濟效益,因為其成本通常係由其可 支援之最高效能遊戲的要求來判定。舉例而言,可能使用 XBox 360來玩類似「戰爭機器(&咖〇f琛⑷」之遊戲, 該遊戲要求高效能之CPU、GPU及數億位元組之ram,或 136720.doc •34- 200941233 者*Τ能使用XBox 360來玩「吃豆(pac Man)」,其為來自20 世紀70年代之遊戲,其僅需要數千位元組之RAM及非常低 效能之CPU。實際上,XBox 360具有同時主機代管許多同 時的「吃豆」遊戲的足夠計算能力。 在一週之大多數小時中’通常切斷視訊遊戲機。根據 2006年7月Nielsen娛樂對13歲及13歲以上之活躍遊戲者的 研究’平均起來’活躍遊戲者一週中花費十四個小時或一 週中的全部小時之僅12〇/〇來玩控制台視訊遊戲。此意謂平 〇 均視訊遊戲控制台在88%之時間内閒置,此為昂貴資源之 無效率使用《假定視訊遊戲控制台常常係由製造商來資助 以降低購買價格(期望該資助將藉由來自未來視訊遊戲軟 體購買之版稅來賺回),則此特別有意義。 視訊遊戲控制台亦招致與幾乎任何消費者電子器件相關 聯的成本。舉例而言,需要將系統之電子器件及機構容納 於外殼中。製造商需要提供服務保證。出售該系統之零售 商需要收取關於系統之銷售及/或關於視訊遊戲軟體之銷 售的利潤。所有此等因素添加視訊遊戲控制台之成本,該 成本必須由製造商來資助、傳遞至消費者,或者由製造商 與消費者兩者來資助。 另外,盜版係視訊遊戲工業之較大問題。實際上每個較 大視訊遊戲系統上所利用的安全機構這些年來已「破 裂」’導致視訊遊戲之未經授權的複製。舉例而言,xb〇x 360安全系統在2_年7月破裂且使用者現在能夠線上下載 非法複本。可下載之遊戲(例如,用於之遊戲)特 I36720.doc -35- 200941233 別易受經受盜版》在世界之特定區域(其中盜版管制不強) 中,實質上不存在獨立視訊遊戲軟體之可行市場,因為使 用者了與合法複本一般容易地以成本之一微小分率購買盜 版複本。又,在世界之許多地方,遊戲控制台之成本係收 入之高百分比,以致即使盜版受控制,亦很少有人可買得 起目前技術狀態之遊戲系統。 另外,已使用之遊戲的市場減少了視訊遊戲業之收入。 當使用者變得對遊戲厭倦時,其可將遊戲出售給將遊戲轉 Ο 售給其他使用者之店鋪。此未經授權但普遍的實踐顯著減 少了遊戲出版商之收入。類似地,當每隔幾年存在平台轉 變時,通常出現大約50%的銷售減少。此係因為:當使用 者知道即將發行較新版本之平台時,使用者停止購買用於 較舊平台之遊戲(例如,當即將發行playstati〇n 3時,使用 者停止購買PlayStation 2遊戲)。組合起來,銷售之損失及 與新平台相關聯之增加的開發成本可對遊戲開發商之收益 性有非常顯著之不利影響。 β 新遊戲控制台亦非常昂貴。Xb〇x 36〇、Nintend〇 wu&The large delay of the program 'which also introduces a delay of several CPU cycles). Therefore, when playing back the game, the frame becomes calculated in two frame times instead of a single frame time. Some behaviors are based on the frequency at which the game calculates new frames (for example, when the game samples input from the game controller). This deviation in the time reference for different behaviors does not affect the game play when the game is played, but it can cause the playback of the game to produce different results. For example, a basketball track is measured at a steady 60 fps rate, but the game controller input is sampled based on the calculated frame rate. When the game is recorded, the calculated frame rate may be 53 fps, and when replaying the game, the calculated frame rate may be 52 fpS, which can cause differences in whether basketball is prevented from entering the basket, resulting in different results. Therefore, the use of game state recording video games requires a very cautious game software design to ensure that the same game state information playback produces exactly the same results. Another prior art method for recording video games is to record only the video output of a PC or video game system (e.g., to a VCR, a DVD recorder, or to a video capture board on a PC). The video can then be replayed and replayed, or alternatively, the recorded video can be uploaded to the Internet (usually after video compression). The disadvantage of this method is that when playing back a 3 game sequence, the user is limited to viewing only the self-test viewpoint (the sequence is recorded from it). In other words, the user cannot change the view point of the scene. In addition, when the compressed video of the recorded game sequence played on the home PC or the game console via the Internet is available to other users 136720.doc -27- 200941233, even if the video system is compressed immediately, It is not possible to upload compressed video to the Internet in real time. The reason for this is because many homes connected to the Internet in the world have highly asymmetric broadband connections (for example, DSL and data modems typically have a much lower downlink bandwidth than the upload bandwidth). Compressed high resolution video sequences often have a higher bandwidth than the network's upload bandwidth, making it impossible to upload on the fly. Therefore, after playing the game sequence (perhaps for a few minutes or even hours), there will be a significant delay before another user on the Internet can view the game. Although this delay 0 is tolerable in certain situations (eg, viewing the outcome of a game player that appeared at a previous time), it eliminates the ability to watch a live game of the game (eg, a basketball tournament played by a winning player) or live broadcast. "Replay Replay J capability when playing a game. Another prior art method allows viewers with TV receivers to watch video game live broadcasts" but only under the control of TV producers. Some TV channels in the US and other countries A video game video channel is provided in which a Q TV viewer can view a particular video game user (eg, a top player participating in a tournament) on a video game channel. This is by video of the video game system (PC and/or console). The output is fed into a video distribution and processing device for the television channel. This is the case when a television channel broadcasts a live basketball game, several of which provide live feeds from different angles around the basketball court. Can then be manipulated with its video/audio processing and effects devices Output from various video game systems. For example, a TV channel can overlay text indicating the status of different players on top of video from a video game (as it can be live broadcast in the basket 136720.doc -28- 200941233 ball game During the period, the text is overwritten, and the TV channel can add the audio from the commentator (the action that τ 'discussed during the game). In addition, the video game can be output to the camera that records the video of the actual player of the game (for example, Demonstrate the emotional response of the player to the game. One of the problems with this method is that the live video feed must be instantly available for the video distribution and processing equipment of the TV channel so that it has the stimulating nature of the live broadcast. However, as previously discussed, when the video game system is implemented from the home (especially when broadcasting a package, including live video from a camera that captures the real world video of the game player), this is often Impossible. In addition, in the case of tournaments, the focus is on the players in the family who can modify the game and make Disadvantages, as previously described. For these reasons, such video game broadcasts on television channels are often configured with players and video game systems that are gathered at a common location (eg, at a television studio or in an arena). The television production equipment can accept video feeds from multiple video game systems and potential live broadcast cameras. Although these prior art video game television channels can provide very exciting performances for television viewers (which is a live broadcast campaign) The experience of similar events (for example, the same as video game players presented by "athletes") is based not only on their actions in the video game world but also on their actions in the real world. 'But such video game systems are often limited The situation where the players are very close to each other. In addition, because the television channels are broadcast, each broadcast channel can only display a video stream selected by the producer of the television channel. Due to these limitations and the cost of broadcast time, production equipment and production staff, these TV channels usually only show top players participating in top tournaments. In addition, a given television channel that broadcasts a full screen image of a video game to all television viewers displays only one video game at a time. This severely limits the choice of TV viewers. For example, a TV viewer may not be interested in a game displayed at a given time. Another viewer may only be interested in watching a particular player's game play that is not shown by the video channel at a given time. In other situations, the viewer may only be interested in watching the insider in the game. #他看者 may wish to control the view point (from which the video game is viewed), which is different from the view point selected by the production team or the like. In short, TV viewers may have countless preferences in watching video games (even if several different TV channels are available, special broadcasts on TV networks should not be preferred). For all of the above reasons, prior art video game television channels have significant limitations in presenting video games to television viewers. Another disadvantage of prior art video game systems and application software systems is that they are complex and often suffer from errors, crashes, and/or undesired and undesirable behaviors (collectively "defects"). Although games and applications typically go through debugging and tuning processes (often referred to as "software quality assurance" or SQA) before release, they are almost unchanged: once the game or application is fought to a wide audience in the field. The defect will suddenly appear. Unfortunately, it is difficult for software developers to identify and trace many defects after the release. Software developers may have difficulty recognizing defects. Even when it understands a defect, there may be only a limited amount of information that can be used to identify what caused the defect. 136720.doc -30· 200941233 For example, the user can call the game developer's consumer service hotline and leave a message stating that when the game is played, the screen begins to flash 'and then changes to solid blue and the PC freezes. It provides the SQA team with very little information that is useful in tracking down defects. One of the online connections Some games or applications sometimes provide more information under certain conditions. For example, you can sometimes use the "watchdog" process to monitor whether a game or application "crashes". The watchdog process collects information about the state of the game or application process when the game or application crashes (for example, memory). The statistics of the status, game or application progress to the stack, etc., and then upload the information to the SQA team via the Internet. But in a complex game or application, the information can take a very long time to decrypt, in order to accurately determine what the user is doing during the crash. Despite this, it is impossible to determine what sequence of events caused the crash. Another problem associated with PCs and game consoles is that they suffer from service problems that are extremely inconvenient for consumers. Service issues also affect the manufacturer of the pc or game console 'because it usually needs to send a special box to safely ship a broken PC or console, and thus incur the cost of repair (if the pc or console is under warranty) Or application software publishers may also be affected by sales losses (or online service usage) caused by PCs and/or consoles in a repaired state. Figure 1 illustrates a prior art video game system such as Sony Playstation® 3, Microsoft Xb® 360®, Nintendo WiiTM, Windows-based PC or Apple Macintosh. Each of these systems includes a central processing unit for executing code, typically I36720.doc -31 · 200941233, a graphics processing unit (GPU) for performing high-level graphics operations, and for use with external devices and Multiple forms of input/output (1/〇) for communication. For the sake of simplicity, these components are shown as being combined into a single unit. The prior art video game system of FIG. 1 is also shown to include an optical media drive 104 (eg, a DVD_R〇M drive); for storing video game programs. Code and data hard drive! 03; a network connection for playing a multiplayer game, for downloading games, patches, demos, or other media; a random access memory for storing code currently being executed by the CPU/GPU 100; Body (RAM) i〇i; game controller 1〇6 for receiving input commands from the user during game play; and display device 1〇2 (for example, SDTV/HDTV or computer monitor). The prior art system shown in Figure 1 suffers from several limitations. First, compared to the access speed of the RAM 101, the optical disk drive 1〇4 and the hard disk drive 1〇3 tend to have a much slower access speed. When operating directly via the RAM 1〇1, since the RAM 101 is usually high The bandwidth is much wider and does not suffer from the (4) long search delay of the optical disc mechanism. The CPU/Gpu i(10) can be used in practice to read the code and f material directly from the hard disk drive 103 or the optical disk drive (10). The possible number of polygons per second is much more than the number of polygons per second. However, only a limited amount of RAM is provided in such prior art systems (e.g., mu bits). Therefore, the sequence of "Loading.." is often required, where rami〇i is periodically filled with data for a scene under the video game. - Some systems attempt to load and play the game at the same time, but this can only be done when there is an e-order event (for example, if driving along the road, you can load the road while driving the car) The geometry of the building 136720.doc •32- 200941233). For complex and/or fast scene changes, this type of overlay usually does not work. For example, 'in the case where the user is in the middle of the campaign and the RAM 101 is completely filled with the information indicating the object in the view of the moment', if the user quickly moves the view to the left to view that the view is not currently loaded. The object in the RAM 101 will cause a discontinuity in motion because there is not enough time to load the new object from the hard disk drive 1 〇 3 or the optical disk drive 1 〇 4 into the RAM 101. Another problem with the system of Figure 1 is due to the limitations of the storage capacity of the hard disk drive 1〇3 and the optical media 1〇40. Although the disk storage device can be manufactured to have a relatively large storage capacity (for example, 500 million bytes or more than 500 million bytes), it is still not provided for use in current video games. Sufficient storage capacity for a particular situation. For example, as previously described, a British football video game may allow a user to select among many groups, players, and sports fields around the world. For each group, each player, and each stadium, a large amount of texture mapping and environment mapping is required to characterize the 3D surface of the world (for example, each group has a unique jersey, each requiring a unique W texture map) . One of the techniques used to solve this latter problem is that for the game, the texture and environment map are pre-computed once the user has selected the texture and environment map. This can involve a number of computationally intensive processes, including decompressing images, 3D mapping plus shadowing, organizing data structures, and the like. Therefore, when the video game performs such calculations, there may be a delay for the user. One way to reduce this delay is, in principle, to perform all such calculations when the game is first developed—including the group, the player roster, and each permutation of the playing field. The release version of the game thus 136720.doc •33- 200941233 will include all such pre-processed material stored on optical media 1〇4 or on one or more servers on the Internet, when the user makes a selection' The selected pre-processed data for a given group, player roster, and sports field selection is downloaded to the hard disk drive 1〇3 only via the Internet. However, as a practical matter, the pre-loaded material for each permutation possible in game play may easily be a terabyte of data that far exceeds the capacity of today's optical media devices. In addition, the information used for a given group, playlist, and sports field selection may easily be hundreds of millions of bytes of information or hundreds of millions of bytes. In the case of a home network connection (e.g., '10 Mbps), downloading this data via the Internet connection 1〇5 takes longer than calculating the data at the local end. Thus, the prior art gaming architecture shown in Figure 1 allows the user to experience significant delays between large scene transitions of complex games. Another problem with prior art methods such as the prior art method shown in Figure 1 is that video games tend to become higher order and require more CPU/GPU processing power over the years. Therefore, even with an unlimited amount of RAM, video game hardware requirements exceed the peak levels of processing power available in such systems. Therefore, users are required to upgrade their game hardware every few years to stay in sync (or play newer games at a lower quality level). One consequence of the trend of higher-order video games over the past is that machines that play video games for home use are often not economical because their cost is usually determined by the requirements of the highest-performance games they can support. For example, you might use XBox 360 to play a game like "War Machine (& curry f琛(4)", which requires a high-performance CPU, GPU, and hundreds of millions of bytes of ram, or 136720.doc •34 - 200941233 * You can use XBox 360 to play "pac Man", a game from the 1970s that requires only a few thousand bytes of RAM and a very low-performance CPU. In fact, XBox 360 has enough computing power to host many simultaneous "Pacman" games at the same time. In most of the week, 'the video game console is usually cut off. According to July 2006, Nielsen Entertainment is 13 years old and older. Active gamer's research 'on average' active gamers spend 14 hours a week or only 12 baht per week for all console games. This means that Pingyi video game console is at 88. Idle idle for % of time, this is an inefficient use of expensive resources. "Assume that video game consoles are often funded by manufacturers to lower the purchase price. It is expected that the funding will be based on royalties from future video game software purchases. Back), this makes a lot of sense. Video game consoles also incur the costs associated with almost any consumer electronics. For example, the electronics and mechanisms of the system need to be housed in the enclosure. Manufacturers need to provide service guarantees. Retailers selling the system are required to receive a profit on the sale of the system and/or sales of video game software. All of these factors add to the cost of the video game console, which must be financed by the manufacturer and delivered to the consumer. Or it can be funded by both manufacturers and consumers. In addition, piracy is a big problem in the video game industry. In fact, the security agencies used in each of the larger video game systems have been "broken" over the years, resulting in video games. Unauthorized copying. For example, the xb〇x 360 security system ruptured in July of the next 2 years and users can now download illegal copies online. Downloadable games (for example, for games) I36720.doc - 35- 200941233 Don't be vulnerable to piracy in a specific area of the world (where piracy is not strong) The viable market for independent video game software, because users and legal copies are generally easy to purchase pirated copies at a fraction of the cost. Also, in many parts of the world, the cost of the game console is a high percentage of revenue, so that even Piracy is under control and few people can afford the current state of the art gaming system. In addition, the market for used games has reduced the revenue of the video game industry. When users become tired of the game, they can sell the game to Selling games to other users' stores. This unauthorized but common practice significantly reduces the revenue of game publishers. Similarly, when there is a platform shift every few years, there is usually a 50% reduction in sales. . This is because when the user knows that a newer version of the platform is about to be released, the user stops buying the game for the older platform (for example, when the playstati〇n 3 is about to be released, the user stops purchasing the PlayStation 2 game). In combination, the loss of sales and the increased development costs associated with the new platform can have a significant adverse effect on the profitability of game developers. The beta new game console is also very expensive. Xb〇x 36〇, Nintend〇 wu&
Sony Playstation 3均以數百美元零售。高能力之個人電腦 遊戲系統可花費高達$8〇〇〇。此表示使用者之顯著投資, 特定言之,考慮到硬體在幾年後變陳舊及許多系統係為孩 子而購買的事實。 上述問題之一方法係線上遊戲,其中將遊戲程式碼及資 料主機代管於伺服器上且按要求將其遞送至用戶端機器, 經壓縮之視訊及音訊經由數位寬頻帶網路而串流。一些公 I36720.doc • 36 - 200941233 司(諸如’ Finland之G-Cluster,其現在為日本之 SOFTBANK Broadmedia的子公司)當前線上提供此等服Sony Playstation 3 is retailed for hundreds of dollars. High-capacity PC gaming systems can cost up to $8. This represents a significant investment by the user, in particular, considering the fact that the hardware became obsolete in a few years and many systems were purchased for the child. One of the above problems is an online game in which the game code and data host are hosted on a server and delivered to the client machine as required, and the compressed video and audio are streamed via a digital broadband network. Some of the companies I36720.doc • 36 - 200941233 (such as 'G-Cluster of Finland, which is now a subsidiary of SOFTBANK Broadmedia in Japan) currently offer these services online.
務。類似遊戲服務變得在本端網路(諸如,旅館内及由DSL 及電纜電視提供者提供之彼等網路)中可用。此等系統之 較大缺點係延時之問題,亦即,信號行進至遊戲伺服器及 自遊戲伺服器行進所花費的時間,遊戲伺服器通常定位於 運營商之「頭端」中。快速動作視訊遊戲(亦稱為「極速Business. Similar gaming services become available in local networks such as hotels and their networks provided by DSL and cable TV providers. The major drawback of these systems is the problem of latency, i.e., the time it takes for the signal to travel to the game server and travel from the game server, which is typically located at the "head end" of the operator. Fast motion video game (also known as "speed
(twitch)」視訊遊戲)在使用者藉由遊戲控制器執行動作之 時間與更新顯示螢幕以展示使用者動作之結果的時間之間 需要非常低的延時。需要低延時,以使得使用者感覺到遊 戲「即刻地」回應。可視遊戲之類型及使用者之熟練程度 而以不同延時間隔來滿足使用者。舉例而言,對於緩慢的 非正式遊戲(類似西洋雙陸棋)或緩慢動作角色扮演遊戲而 言,100毫秒之延時可能係可容忍的,但在快動作遊戲 中,超過70毫秒或80毫秒之延時可引起使用者在遊戲中更 拙劣地表現,1因此不可接受。舉例而言,在需要快反應 時間之遊戲中,當延時自5〇毫秒增加至丨〇〇毫秒時,存在 準確度之銳降。 虽,遊戲或應用伺月民器安裝於附近的受控網路環境或至使 用者之網路路徑可預測及/或可容忍、頻寬峰值的網路環境 中^ ’在最大料以及料之—致性方面,控制延時容易 得夕(例如’目此使用者經由網路觀察到來自數位視訊串 流之穩疋運動卜該程度之控制可在以下達成:在電纔η 網路頭端至電規TV用戶之家庭之間,或自DSL中央辦公室 136720.doc •37· 200941233 至DSL用戶之家庭,或在來自伺服器或使用者之商業辦公 室區域網路(LAN)環境中。又,有可能獲得商業之間的具 有得到保證之頻寬及延時的經特定分級的點到點私用連 接。但在將遊戲主機代管於連接至通用網際網路之伺服器 中心中且接著經由寬頻帶連接而使經壓縮之視訊_流至使 用者的遊戲或應用系統中,許多因素招致延時,導致先前 技術系統之部署中的嚴重限制。 在典型的連接寬頻帶之家庭中,使用者可具有用於寬頻 〇 帶服務之DSL或電規數據機。該等寬頻帶服務通常招致使 用者之家庭與通用網際網路之間的多達25毫秒之來回行程 延時(且有時更多)。另外,存在由於經由網際網路將資料 路由至伺服器中心而招致的來回行程延時。經由網際網路 之延時基於給出資料之路線及資料被路由時資料所招致之 延遲而改變。除路由延遲之外,亦由於光穿過互連大多數 網際網路之光纖的速度而招致來回行程延時。舉例而言, 對於每一 1〇〇〇英里,由於光穿過光纖之速度及其他耗用而 招致約22毫秒之來回行程延時。 額外延時可由於經由網際網路串流之資料的資料速率而 招致。舉例而言,若使用者具有以「6 Mbps DSL服務」出 售之DSL服務,則在實踐中,使用者將很可能最多得到小 於5 Mbps之下行輸送量,且將可能週期性地看見由於各種 因素(諸如,峰值載入時間期間在數位用戶線存取多工器 (DSLAM)處之擁擠)產生的連接降級。若經由相鄰者循環 之本端共用同軸電纜中存在擁擠或電纜數據機系統網路中 136720.doc •38- 200941233 之其他地方存在擁擠,則類似問題可出現,從而將用於以 「6 Mbps電纜數據機服務」出售之連接的電纜數據機之資 料速率減小至遠小於彼資料速率◊若使4 Mbps之穩定速率 下的資料封包以使用者資料報協定(UDp)格式單向地自伺 服器中心經由該等連接而串流,若一切皆適當地工作,則 -貝料封包將通過而不招致額外延時,但若存在擁擠(或其 他妨礙)且僅3.5 Mbps可用於使資料串流至使用者,則在典 型情形下,封包將被丟棄,導致丟失資料,或者封包將在 〇 擁擠點處排入佇列直至其可被發送為止,藉此引入了額外 延時。不同擁擠點具有用於保存經延遲之封包的不同排入 仔列容量,因此在一些狀況下’立即將不可成功解決擁擠 之封包丟棄。在其他狀況下,將數百萬位元之資料排入佇 列且最終將其發送。但是,在幾乎所有狀況下,擁擠點處 之仔列具有容量限制,且一旦超過彼等限制,仔列將溢出 且封包將被丟棄。因此,為了避免招致額外延時(或更糟 地,封包之丟失),必須避免超過自遊戲或應用伺服器至 U 使用者之資料速率容量。 亦由於在飼服器中壓縮視訊及在用戶端器件中解壓縮視 Λ所需之時間而招致延時。當在饲服器上執行之視訊遊戲 正在計算待顯示之下-個圖框時’ *一步招致延時。當前 I用之視訊壓縮演算法遭受高㈣速率或高延時。舉例而 3 ’運動JPEG為僅框内有損之魔縮演算法,其特徵為低延 2視之每-圖框獨立於視訊之每一其他圖框而壓縮。 當用戶端器件接收經Μ縮之運較⑽視訊的一圖框時,其 136720.doc 39- 200941233 可立即解壓縮該圖框且顯示該圖框,從而導致非常低之延 時。但因為每一圖框係分開進行壓縮,所以演算法不能夠 利用相繼圖框之間的類似性’且因此僅框内視訊壓縮演算 法遭乂非*南之資料速率。舉例而言’ 6〇 fpS(每秒圖框 數)640x480運動JPEG視訊可能需要40 Mbps(每秒百萬位 元)或40 Mbps(每秒百萬位元)以上之資料。用於該等低解 析度視訊窗之該等高資料速率在許多寬頻帶應用程式中將 係過於昂貴(且對於大多數消費者的以網際網路為基礎之 應用程式的確如此)。另外,因為每一圖框經獨立壓縮, 所以可能由於有損壓縮而產生的圖框中之假影可能出現於 相繼圖框中之不同位置處。此可導致當解壓縮視訊時,在 檢視者看來為移動的視覺假影。 其他壓縮演算法(諸如,來自Microsoft公司之MPEG2、 H.264或VC9)當用於先前技術組態中時,可達成高壓縮比 率’但以高延時為代價。該等演算法利用框間壓縮以及框 内壓縮。週期性地’該等演算法執行圖框之僅框内壓縮。 此種圖框被稱為關鍵圖框(通常稱作「!」圖框)。接著,此 等演算法通常將I圖框與先前圖框與相繼圖框兩者相比 較°並非獨立地壓縮先前圖框及相繼圖框,而是演算法判 疋影像自I圖框至先前圖框及相繼圖框有何改變,且接著 將彼等改變儲存為:「B」圖框(對於I圖框之前的改變)及 「P」圖框(對於I圖框之後的改變)。此導致比僅框内壓縮 低得多的資料速率。但是,其通常以較高延時為代價。I 圖框通常比B圖框或p圖框大得多(常常大10倍),且因此, 136720.doc -40· 200941233 以給定資料速率傳輸成比例地花費較長之時間。 考慮(例如)一情形:其中I圖框為B圖框及P圖框之大小 的10倍’且對於每個單一〗框内,存在29個3圖框+3〇個?圖 框=59個框間,或對於每一「圖框群」(G〇p)總共6〇個圖 框°因此’在60 fps~p,每秒存在1個6〇圖框G〇p。假設傳 輸頻道具有2 Mbps之最大資料速率。為了在頻道中達成最 向品質之視訊’壓縮演算法將產生2 Mbps資料流,且給定 上述比率,此將產生每框内2百萬位元(Mb)/(59+1〇)=3〇,394 © 個位元及每I圖框303,935個位元。當藉由解壓縮演算法接 收經壓縮之視訊流時,為了穩定地播放視訊,需要以規則 間隔(例如,60 fps)解壓縮及顯示每一圖框。為了達成此 結果,若任何圖框經受傳輸延時,則需要將所有圖框延遲 至少彼延時,因此最糟狀況的圖框延時將界定用於每個視 讯圖框之延時。因為!圖框最大,所以j圖框引入最長傳輸 延時,且整個I圖框將必須在可解壓縮及顯示1圖框(或取決 於I圖框之任何框間)之前接收。假定頻道資料速率為2 Mbps ’則傳輸一!圖框將花費3〇3,935/2 Mb=145毫秒。 使用傳輸頻道之頻寬之大百分比的框間視訊壓縮系統 (如上所述)將由於〗圖框相對於圖框之平均大小的大的大小 而經受長延時。或者,換言之,當先前技術框間壓縮演算 法達成比僅框内壓縮演算法低之平均每圖框資料速率(例 如,2 Mbps對40 Mbps)時,其由於大〗圖框而仍遭受高的 峰值每圖框資料速率(例如,3〇3,935*6〇=182 Mbps)。但 請記住··上述分析假定P圖框及B圖框均比丨圖框小得多。 I36720.doc •41- 200941233 儘管此大體成立’但對於具有與先前圖框、高運動或場景 改變不相關之高影像複雜度的圖檀,此不成立。在該等情 形下’ P圖框或B圖框可變得與j圖框一般大(若p圖框或關 框變得比I圖框大,則央端麼縮演算法通常將「強制」項 框且用I圖框替換P圖框或B圖框)。因此,工圖框大小之資 料速率峰值可在任何時刻出現於數位視訊流中。因此,對 於經壓縮之視訊,當平均視訊資料速率接近傳輸頻道之資 料速率谷量時(經常為該狀況,給定對於視訊之高資料速 0 率要求來自I圖框或大的P圖框或B圖框之高峰值資料速 率導致高圖框延時。 4然,上述論述僅特徵化由G〇p中之大的B圖框、p圖框 或Ϊ圖框產生的壓縮演算法延時。若使用B圖框,則延時 將更咼。此之原因係因為在可顯示B圖框之前,必須接收 B圖框之後的所有b圖框及I圖框。因此,在諸如 BBBBBIPPPPPBBBBBIPPPPP之圖片群(GOP)序列中,其中 Ο 在每一 Ϊ圖框之前存在5個B圖框,只有在接收到隨後的b圖 框及I圖框之後才可由視訊解壓縮器顯示第一B圖框。因 此,若使視訊以60 fps(亦即,16.67毫秒/圖框)串流,則在 可解壓縮第一B圖框之前,不管頻道頻寬如何快,接收五 個B圖框及I圖框將花費i6 67*6=100毫秒,且此係僅5個b 圖框之情況。具有30個B圖框的經壓縮之視訊序列相當普 遍。此外’在如2 Mbps之低頻道頻寬下,由於I圖框之大 小而引起的延時影響很大程度上添加至由於等待B圖框到 達而產生的延時影響。因此,在2 Mbps頻道上,在大量b 136720.doc -42· 200941233 圖框之情況下’使用先前技術視訊壓縮技術超過500毫秒 或500毫秒以上之延時相當容易。若不使用b圖框(對於給 定品質水準,以較低壓縮比率為代價),則不招致B圖框延 時,但仍招致上文所描述的由於峰值圖框大小而引起的延 時。 問題恰恰由於許多視訊遊戲之性質而加重。利用上文所 描述之GOP結構的視訊壓縮演算法很大程度上被最佳化以 用於連同意欲用於被動檢視的現場直播之視訊或電影材料 © 一起使用。通常’相機(真實相機,或者電腦產生之動晝 之狀況下的虛擬相機)及場景相對穩定,僅因為若相機或 場景太顛簸地來回移動,則視訊或電影材料(a)通常觀看起 來令人不愉快’且(b)若其正被觀看’當相機突然來回顛簸 時,檢視者通常不能夠緊密地跟隨該動作(例如,若相機 在拍攝吹滅生日蛋糕上之蝶燭的孩子時被擾動且突然在蛋 糕之間來回顛簸’則檢視者通常集中於孩子及蛋糕上,而 〇 不理會相機突然移動時之簡短中斷)。在視訊會談或視訊 電話會議之狀況下,可將相機固持於固定位置中且根本不 移動,從而導致根本非常少之資料峰值。但3D高動作視訊 遊戲係藉由恆定運動來特徵化(例如,考慮3D競赛,其中 整個圖框在競赛之持續時間中處於快速運動中,或者考慮 第一人稱射擊遊戲,其中虛擬相機恆定地顛簸地來回移 動)。该等視訊遊戲可產生具有大的及頻繁的峰值之圖框 序列,其中使用者可能需要清楚地看見在彼等突然運動期 間發生了什麼。因此,在3D高動作視訊遊戲中,廛縮假影 136720.doc -43- 200941233 遠不可容忍。因此,許多視訊遊戲之視訊輸出(由於其性 質)產生具有非常高且頻繁之峰值的經壓縮之視訊流。 假定快動作視訊遊戲之使用者對於高延時具有小的容忍 度,且給定所有上述延時原目,至今存在對於使視訊在網 際網路上串流的伺服器主機代管之視訊遊戲的限制。另 外,若需要高度互動性之應用程式係主機代管於通用網際 網路上且使視訊串流,則該等應用程式之使用者遭受類似 限制。該等服務需要網路組態’其中主機代管伺服器直接 〇 設置於頭端(在電纜寬頻帶之狀況下)或中央辦公室(在數位 用戶線(DSL)之狀況下)中,或商業背景中之!^^内(或經特 別分級之私用連接上),以便控制自用戶端器件至伺服器 之路線及距離以最小化延時且可適應峰值而不招致延時。 LAN(通常額定在1〇〇 Mbps-1 Gbps)及具有足夠頻寬之租用 線路通常可支援峰值頻寬要求(例如,18 Mbps峰值頻寬為 100 Mbps LAN容量之一小分率)。 若進行特殊適應’則峰值頻寬要求亦可由住宅寬頻帶基 ® 礎架構來適應。舉例而言,在電纜TV系統上,可為數位 視訊訊務給出專用頻寬’該專用頻寬可處理諸如大I圖框 之等值。此外’在DSL系統上’可供應較高速度之dsl數 據機(慮及高峰值),或可供應可處理較高資料速率之經特 別分級的連接。但是,附接至通用網際網路之習知電規數 據機及DSL基礎架構對於用於經壓縮之視訊的峰值頻寬要 求而言遠不能容忍。因此’線上服務(將視訊遊戲或應用 程式主機代管於距用戶端器件長距離之伺服器中心中,且 136720.doc 44 200941233 接者經由習知的住宅寬頻帶連接經由網際網路而使經麼縮 之視訊輸出串流)遭受顯著之延時及峰值頻寬要求-尤其對 於需要非常低之延時的遊戲及應用程式(例如,第一人稱 射擊遊戲及其他多使用者、互動式動作遊戲,&需要快回 應時間之應用程式)。 【實施方式】 本揭示案將自以下[實施方式]及附圖而更完全地理解, 然而,其不應用於將所揭示之標的物限於所展示之特定實 0 施例’而僅用於說明及理解。 在以下描述t闡述特定細節(諸如,器件類型、系統組 通信方法等)’以便k供對本揭示案之徹底理解。然 而,一般熟習相關技術者應瞭解,實踐所描述之該等實施 例可能不需要此等特定細節。 圖2a至圖2b提供兩個實施例之高階架構,其中視訊遊戲 及軟體應用程式由主機代管服務21〇主機代管且在訂用服 務下由使用者場所211(注意、,「使用者場所」意、謂使用者 ϋ 所定位的無論何處之位置,若使用行動器件則包括室外) 處之用戶端器件205經由網際網路2〇6(或其他公眾網路或 私用網路)來存取。用戶端器件205可為具有至網際網路之 有線或無線連接、具有内部或外部顯示器件222的通用電 腦(諸如’以Microsoft Windows或Linux為基礎之PC或 Apple公司之Macintosh電腦),或者其可為將視訊及音訊輸 出至監視器或電視機222之諸如機頂盒之專用用戶端器件 (具有至網際網路之有線或無線連接),或者其可為推測起 136720.doc -45- 200941233 來具有至網際網路之無線連接的行動器件。 此等器件十之任一者可具有其自身的使用者輸入器件 (例如鍵盤、按紐、觸摸螢幕、追縱板(track pad)或慣性 感測棒(inertial-sensing wand)、視訊俘獲相機及/或運動追 蹤相機等),或者其可使用藉由線連接或無線地連接之外 部輸入器件221(例如,鍵盤、滑鼠、遊戲控制器、慣性感 測棒、視訊俘獲相機及/或運動追蹤相機等)。如下文更詳 細描述,主機代管服務21〇包括各種效能位準之伺服器(包 〇 括具有高能力CPU/GPU處理能力之彼等伺服器)。在播放 遊戲或使用主機代管服務21〇上之應用程式期間,家庭或 辦公至用戶端器件205接收來自使用者之鍵盤及/或控制器 輸入’且接著其將控制器輸入經由網際網路2〇6傳輸至主 機代管服務210,主機代管服務21〇回應於此而執行遊戲程 式碼並產生用於遊戲或應用程式軟體的視訊輸出(視訊影 像序列)之相繼圖框(例如,若使用者按壓將會指引螢幕上 之人物向右移動的按鈕,則遊戲程式接著將產生展示人物 0 向右移動的視訊影像序列)。接著使用低延時視訊壓縮器 壓縮此視訊影像序列’且主機代管服務21〇接著經由網際 網路206而傳輸低延時視訊流。家庭或辦公室用戶端器件 接著解碼經壓縮之視訊流並將經解壓縮之視訊影像再現於 監視器或TV上。因此’顯著地減少用戶端器件205之計算 及圖形硬體要求。用戶端205僅需要具有用於將鍵盤/控制 器輸入轉遞至網際網路206且解碼並解壓縮自網際網路2〇6 所接收的經壓縮之視訊流的處理能力,實際上現今任 136720.doc -46· 200941233 何個人電腦均能夠在其(:1>1;上以軟體來進行此(例如,以 約2 GHz執行之Intei公司雙核cpu能夠解壓縮使用諸如 H.264及Windows媒體VC9之壓縮器編碼的72〇p hdtv)。 此外,在任何用戶端器件之狀況下,專用晶片亦可以比通 用cpu低得多的成本及比通用cpu少得多的電力消耗(諸 如,現代PC所需的)來即時地執行用於該等標準之視訊解 壓縮。值得注意地,為了執行轉遞控制器輸入及解壓縮視 訊的功能,家庭用戶端器件2〇5不需要任何專門化的圖形 〇 處理單元(gpu)、光碟機或硬碟機(諸如,圖i中所展示之 先前技術視訊遊戲系統)。 隨著遊戲及應用程式軟體變得更複雜及更具照片般逼真 感,其將需要較高效能之CPU、GPU、較多RAM,及較大 且較快之磁碟機,且可使主機代管服務210處之計算能力 不斷地升級,但終端使用者將不需要使家庭或辦公室用戶 端平台205升級,因為將藉由給定視訊解壓縮演算法而使 《庭或辦公室用戶端平台2〇5之處理要求對於顯示解析度 〇及圖框速率保持恆定。因此,圖h至圖2b中所說明之系統 中不存在現今所見的硬體限制及相容性問題。A (twitch) video game requires very low latency between when the user performs an action by the game controller and when the display screen is updated to show the result of the user action. A low latency is required to make the user feel the game respond "immediately". The user is satisfied with different delay intervals depending on the type of visual game and the proficiency of the user. For example, for slow informal games (like backgammon) or slow action role-playing games, a 100 millisecond delay may be tolerable, but in fast action games, over 70 milliseconds or 80 milliseconds. The delay can cause the user to perform worse in the game, 1 and therefore is unacceptable. For example, in a game that requires fast response time, there is a sharp drop in accuracy when the delay is increased from 5 〇 milliseconds to 丨〇〇 milliseconds. Although the game or application is installed in a nearby controlled network environment or to the user's network path can be predicted and / or tolerable, peak bandwidth in the network environment ^ 'in the largest material and material In terms of the nature, it is easy to control the delay (for example, 'the user can observe the steady motion from the digital video stream through the network. The degree of control can be achieved in the following: in the head of the network. Between TV users' families, or from the DSL Central Office 136720.doc •37· 200941233 to the DSL user's home, or in the commercial office area network (LAN) environment from the server or user. Again, it is possible Obtain a specific hierarchical point-to-point private connection between businesses with guaranteed bandwidth and latency, but host the game console in a server center connected to the universal Internet and then connect via broadband And the resulting video stream to the user's game or application system, many factors cause delays, leading to severe limitations in the deployment of prior art systems. In a typical connected broadband family Users can have DSL or electrical data modems for broadband piggyback services. These broadband services typically result in up to 25 milliseconds of travel delay between the user's home and the universal Internet (and sometimes In addition, there is a round trip delay caused by routing data to the server center via the Internet. The delay via the Internet changes based on the route given the data and the delay caused by the data being routed. In addition to routing delays, it also causes round trip delays due to the speed of light passing through the fibers interconnecting most of the Internet. For example, for every 1 mile, due to the speed of light passing through the fiber and Other consumption results in a round trip delay of approximately 22 milliseconds. The extra delay can be incurred due to the data rate of the data streamed over the Internet. For example, if the user has a DSL sold under "6 Mbps DSL Service" Service, in practice, the user will most likely get at most less than 5 Mbps under the line throughput, and will likely see periodically due to various factors (such as Connection degradation caused by congestion at the Digital Subscriber Line Access Multiplexer (DSLAM) during peak load time. If there is congestion in the local shared coaxial cable via the adjacent loop, or 136720 in the network of the cable modem system .doc •38- 200941233 There is congestion elsewhere, and similar problems can arise, reducing the data rate of the cable modem used for the sale of the “6 Mbps Cable Data Service” to much less than the data rate◊ If the data packet at a stable rate of 4 Mbps is streamed unidirectionally from the server center via the connection in the User Datagram Protocol (UDp) format, if everything works properly, then the -before packet will pass Without incurring additional delays, but if there is congestion (or other obstruction) and only 3.5 Mbps can be used to stream data to the user, in a typical situation, the packet will be discarded, resulting in lost data, or the packet will be in the frame. The queue is queued until it can be sent, thereby introducing additional delays. Different congestion points have different capacity for storing delayed packets, so in some cases, the packets that cannot be successfully resolved are discarded immediately. In other cases, millions of bits of data are queued and eventually sent. However, in almost all cases, the queue at the congestion point has a capacity limit, and once it exceeds these limits, the queue will overflow and the packet will be discarded. Therefore, in order to avoid incurring additional delays (or worse, loss of packets), data rate capacity beyond the game or application server to the U user must be avoided. Delays are also incurred due to the time required to compress the video in the feeder and decompress the video in the client device. When the video game is executed on the feeder, it is calculating the frame to be displayed. The video compression algorithm currently used by I suffers from high (four) rates or high delays. For example, the 3' motion JPEG is a frame-only lossy algorithm, which is characterized in that each frame is compressed independently of each other frame of the video. When the client device receives a frame of collapsed (10) video, its 136720.doc 39-200941233 can immediately decompress the frame and display the frame, resulting in very low latency. However, because each frame is compressed separately, the algorithm cannot take advantage of the similarity between successive frames' and therefore only the in-frame video compression algorithm suffers from non-South data rates. For example, '6〇 fpS (frames per second) 640x480 motion JPEG video may require more than 40 Mbps (megabits per second) or 40 Mbps (megabits per second). These high data rates for such low resolution video windows will be too expensive in many broadband applications (and indeed for most consumer Internet-based applications). In addition, because each frame is independently compressed, artifacts in the frame that may be due to lossy compression may appear at different locations in successive frames. This can result in a visual artifact that appears to the viewer as moving when the video is decompressed. Other compression algorithms (such as MPEG2, H.264, or VC9 from Microsoft Corporation) can achieve high compression ratios when used in prior art configurations, but at the expense of high latency. These algorithms utilize inter-frame compression and in-frame compression. Periodically, the algorithms perform only in-frame compression of the frame. This type of frame is called a key frame (usually called a "!" frame). Then, these algorithms usually compare the I frame with the previous frame and the successive frames. Instead of compressing the previous frame and the subsequent frame independently, the algorithm determines the image from the I frame to the previous image. The box and subsequent frames are changed, and then their changes are stored as: "B" frame (for changes before I frame) and "P" frame (for changes after I frame). This results in a much lower data rate than just in-frame compression. However, it usually comes at the expense of higher latency. The I frame is usually much larger (usually 10 times larger) than the B or P frame, and therefore, 136720.doc -40· 200941233 takes a prolonged time proportionally at a given data rate. Consider, for example, a situation where the I frame is 10 times the size of the B frame and the P frame and for each single frame there are 29 3 frames + 3 frames? Frame = 59 frames, or a total of 6 frames for each "frame group" (G〇p). Therefore, at 60 fps~p, there is one 6-inch frame G〇p per second. Assume that the transmission channel has a maximum data rate of 2 Mbps. In order to achieve the most quality video in the channel, the compression algorithm will generate a 2 Mbps stream, and given the above ratio, this will result in 2 million bits per frame (Mb) / (59 + 1 〇) = 3 〇, 394 © bits and 303, 935 bits per I frame. When the compressed video stream is received by the decompression algorithm, in order to stably play the video, each frame needs to be decompressed and displayed at regular intervals (e.g., 60 fps). To achieve this result, if any frame is subjected to a transmission delay, all frames need to be delayed by at least one delay, so the worst case delay will define the delay for each video frame. because! The frame is the largest, so the j frame introduces the longest transmission delay, and the entire I frame will have to be received before the decompressible and display 1 frame (or between any frames of the I frame). Assume that the channel data rate is 2 Mbps ‘and transmit one! The frame will cost 3〇3,935/2 Mb=145 milliseconds. An inter-frame video compression system (as described above) that uses a large percentage of the bandwidth of the transmission channel will experience long delays due to the large size of the frame relative to the average size of the frame. Or, in other words, when the prior art interframe compression algorithm achieves a lower average data rate per frame than the in-frame compression algorithm (eg, 2 Mbps versus 40 Mbps), it still suffers from high frame size Peak data rate per frame (for example, 3〇3,935*6〇=182 Mbps). But remember that the above analysis assumes that the P and B frames are much smaller than the frame. I36720.doc •41- 200941233 Although this is generally true, this does not hold for a tile with high image complexity that is not related to previous frames, high motion, or scene changes. In these cases, the 'P frame or B frame can become larger than the j frame. (If the p frame or the closed frame becomes larger than the I frame, the central end of the reduction algorithm will usually be "forced". Item box and replace the P frame or B frame with the I frame). Therefore, the peak data rate of the frame size can appear in the digital video stream at any time. Therefore, for compressed video, when the average video data rate is close to the data rate of the transmission channel (often for this situation, given the high data rate for video, the rate is required from the I frame or the large P frame or The high peak data rate of frame B results in a high frame delay. 4 However, the above discussion only characterizes the compression algorithm delay generated by the large B frame, p frame or frame in G〇p. In the case of frame B, the delay will be even worse. This is because all b frames and I frames after the B frame must be received before the B frame can be displayed. Therefore, in the picture group (GOP) such as BBBBBIPPPPPBBBBBIPPPPP In the sequence, where Ο there are 5 B frames before each frame, the first B frame can be displayed by the video decompressor only after receiving the subsequent b frame and I frame. Therefore, if Video streaming at 60 fps (ie, 16.67 ms/frame), before receiving the first B frame, regardless of the fast channel bandwidth, receiving five B frames and I frames will cost i6 67 *6=100 milliseconds, and this is only the case of 5 b frames. There are 30 B The frame's compressed video sequence is quite common. In addition, at low channel bandwidths such as 2 Mbps, the delay due to the size of the I frame is largely added to the delay due to waiting for the B frame to arrive. Impact. Therefore, on the 2 Mbps channel, in the case of a large number of b 136720.doc -42· 200941233 frames, it is quite easy to use the prior art video compression technology for more than 500 milliseconds or more than 500 milliseconds. If you do not use the b frame (For a given quality level, at the expense of a lower compression ratio), the B-frame delay is not incurred, but still causes the delay due to the size of the peak frame described above. The problem is precisely due to the nature of many video games. And the emphasis. The video compression algorithm using the GOP structure described above is largely optimized for use with live video or movie material © which is intended for passive viewing. Usually 'camera (real The camera, or the virtual camera produced by the computer, and the scene are relatively stable, just because the camera or scene moves too far and bumpy Then the video or movie material (a) is usually unpleasant to watch 'and (b) if it is being viewed', when the camera suddenly bumps back and forth, the viewer is usually unable to follow the action closely (for example, if the camera is blowing When the child who wiped out the butterfly candle on the birthday cake was disturbed and suddenly bumped back and forth between the cakes, the viewer usually concentrated on the child and the cake, and ignored the brief interruption of the camera when it suddenly moved. In the video talk or video In the case of a conference call, the camera can be held in a fixed position and not moved at all, resulting in very little data spikes. However, 3D high motion video games are characterized by constant motion (for example, considering 3D competitions, The entire frame is in rapid motion during the duration of the competition, or considers a first-person shooter game in which the virtual camera constantly moves back and forth in a bumpy manner. These video games can produce a sequence of frames with large and frequent peaks, where the user may need to clearly see what happens during their sudden movements. Therefore, in the 3D high motion video game, the collapse of the shadow 136720.doc -43- 200941233 is far intolerable. Therefore, the video output of many video games (due to their nature) produces a compressed video stream with very high and frequent peaks. Assuming that the user of the fast motion video game has a small tolerance for high latency, and given all of the above delays, there have been limitations to video games hosted by server hosts that stream video over the Internet. In addition, users of such applications suffer from similar restrictions if a highly interactive application host is required to host a common Internet and stream video. These services require network configuration 'where the colocation server is set directly at the head end (in the case of cable broadband) or central office (in the case of digital subscriber line (DSL)), or business background In the ^^ (or on a specially graded private connection) to control the route and distance from the client device to the server to minimize latency and adapt to peaks without incurring delays. LANs (typically rated at 1 Mbps to 1 Gbps) and leased lines with sufficient bandwidth typically support peak bandwidth requirements (for example, 18 Mbps peak bandwidth is one of the 100 Mbps LAN capacity fractions). If special adaptation is applied, the peak bandwidth requirement can also be accommodated by the residential broadband base infrastructure. For example, on a cable TV system, a dedicated bandwidth can be given to a digital video message. The dedicated bandwidth can handle values such as a large I frame. In addition, 'on the DSL system' can supply higher speed dsl data machines (considering high peaks) or can be supplied with specially graded connections that can handle higher data rates. However, conventional electronic data processors and DSL infrastructure attached to the universal Internet are far from tolerable for peak bandwidth requirements for compressed video. Therefore, 'online service (hosting a video game or application host in a server center that is long distances from the client device, and 136720.doc 44 200941233 is connected via the Internet via a conventional residential broadband connection) The shrinking video output stream suffers from significant latency and peak bandwidth requirements - especially for games and applications that require very low latency (eg, first-person shooters and other multi-user, interactive action games, &; applications that need a quick response time). The present disclosure will be more fully understood from the following description of the embodiments and the accompanying drawings, which are not to be construed as limited. And understanding. Specific details (such as device type, system group communication method, etc.) are set forth in the following description in order to provide a thorough understanding of the present disclosure. However, it will be appreciated by those skilled in the art that the specific embodiments described in the practice may not require such specific details. 2a to 2b provide a high-level architecture of two embodiments, wherein the video game and the software application are hosted by the colocation service 21 and hosted by the user site 211 under the subscription service (note, "user location The user device 205 at the location of the user, wherever the user is located, if the mobile device is used, is connected via the Internet 2〇6 (or other public or private network) access. The client device 205 can be a general purpose computer having a wired or wireless connection to the Internet, with an internal or external display device 222 (such as a 'Microsoft Windows or Linux based PC or Apple Macintosh computer), or A dedicated client device (such as a wired or wireless connection to the Internet) for outputting video and audio to a monitor or television 222, such as a set top box, or it can be speculated to be 136720.doc -45-200941233 A wirelessly connected mobile device for the Internet. Any of these devices may have its own user input device (eg, a keyboard, button, touch screen, track pad or inertial-sensing wand, video capture camera and / or motion tracking camera, etc., or it can use an external input device 221 that is connected by wire or wirelessly (eg, keyboard, mouse, game controller, inertial sensor, video capture camera, and/or motion tracking) Camera, etc.). As described in more detail below, the colocation service 21 includes servers of various performance levels (including those with high-capacity CPU/GPU processing capabilities). During playback of the game or application using the colocation service 21, the home or office-to-user device 205 receives the keyboard and/or controller input from the user' and then enters the controller via the Internet 2 〇6 is transmitted to the colocation service 210, in response to which the colocation service 21 executes the game code and generates successive frames for the video output (video image sequence) of the game or application software (eg, if used) Pressing the button that will direct the person on the screen to the right, the game program will then produce a sequence of video images showing the person 0 moving to the right. The video image sequence is then compressed using a low latency video compressor and the colocation service 21 then transmits the low latency video stream over the internet 206. The home or office client device then decodes the compressed video stream and reproduces the decompressed video image on a monitor or TV. Thus, the computational and graphical hardware requirements of the client device 205 are significantly reduced. The client 205 only needs to have the processing capability for forwarding the keyboard/controller input to the Internet 206 and decoding and decompressing the compressed video stream received from the Internet 2〇6, actually 136720 .doc -46· 200941233 Any personal computer can do this on its (:1>1; software (for example, Intei dual-core cpu executed at about 2 GHz can decompress using VCs such as H.264 and Windows Media The compressor encodes 72〇p hdtv). In addition, in the case of any client device, the dedicated chip can also be much lower cost than the general-purpose CPU and much less power consumption than the general-purpose CPU (such as modern PC Required) to perform video decompression for these standards on the fly. Notably, in order to perform the functions of the transfer controller input and decompress video, the home client device 2〇5 does not require any special graphics〇 Processing unit (gpu), optical drive or hard drive (such as the prior art video game system shown in Figure i). As games and application software become more complex and more photo-realistic, Will require higher performance CPU, GPU, more RAM, and larger and faster drives, and the computing power of the colocation service 210 will be continuously upgraded, but the end user will not need to make the family Or the office client platform 205 is upgraded because the processing requirements of the court or office client platform 2〇5 will remain constant for display resolution and frame rate by a given video decompression algorithm. There are no hardware limitations and compatibility issues seen today in the system illustrated in Figure 2b.
此顯考减輕遊戲或應用程 包括(例如)教室)中決不存在遊戲或應用程 ;學媒體之形式,或者為經下载之軟體)。 或應用程式軟體被非法複製(盜版)之可能 136720.doc •47- 200941233 性’以及減輕可由遊戲或應用程式軟體使用的有價值之資 料庫被盜版之可能性。實際上,若需要專門化的伺服器 (例如,需要非常昂貴的、大的或有噪音的設備)來播放對 於家庭或辦公室使用不可行之遊戲或應用程式軟體,則即 使獲得遊戲或應用程式軟體之盜版複本,其亦將不可在家 庭或辦公室中操作。 在一實施例中,主機代管服務2丨〇向設計視訊遊戲之遊 戲或應用程式軟體開發商(其大體指代軟體開發公司、遊 © 戲或電影工作室,或遊戲或應用程式軟體出版商)220提供 軟體開發工具,以使得其可設計能夠在主機代管服務21〇 上執行之遊戲。s亥專工具允許開發商利用主機代管服務之 特徵(該等特徵通常在獨iPC或遊戲控制台中將不可 用)(例如,快速存取複雜幾何形狀的非常大之資料庫(除非 另外有條件,否則「幾何形狀」將在本文中用於指代界定 3D資料集之多邊形、紋理、索具、照明、行為及其他組件 及參數))。 在此架構下,不同商業模型係可能的。在一模型下,主 機代管服務210自終端使用者收取訂用費用且向開發商 支付版稅,如圖2a中所展示。在替代實施中(圖沘中所展 示),開發商220直接自使用者收取訂用費用且向主機代管 服務210支付用於主機代管遊戲或應用程式内容的費用。 此等基本原理不限於用於提供線上遊戲或應用程式主機代 管之任何特定商業模型。 緩壓缩之視訊特性 136720.doc •48- 200941233 如先刚所★述,線上提供視訊遊戲服務或應用程式軟體 服務之、顯著問題在於延時。7〇毫秒-80毫秒之延時(自輸 入器件被使用者致動之時刻至在顯示器件上顯示回應時之 時刻)為用於需要快回應時間之遊戲及應用程式的上限。 * '由於大量實際及實體約束而使得此在圖2a及圖2b中 所展不之架構的情況下非常難以達成。 如圖3中所指不,當使用者訂用網際網路服務時,連接 it常額S為至使用者之家庭或辦公室的標稱最大資料速率 301 #決於提供者之策略及路由設備能力,|最大資料 速率可或多或少被嚴格地強制執行’但通常由於許多不同 原因中之-者而使得實際可用資料速率較低。舉例而言, 可能在DSL中央辦公室處或在本端電窥數據機迴路上存在 過多網路訊務,或可能在電繞線上存在雜訊,從而引起丢 棄之封&,或提供者可能建立每使用纟每月最大數目之位 元。當前,用於電纜及DSL服務之最大下行資料速率通 常在數百千位元/秒(Kbps)至30 Mbps之範圍内。蜂巢式 从服務通常限㈣百Kbps之下行資料。然而,㈣帶服務之 速度及訂用寬頻帶服務之使用者之數目將隨著時間而急劇 增加。當前,一些分析者估計33%之美國寬頻帶用戶具有 2 Mbps或2 Mbps以上之下行資料速率。舉例而言,一些分 析者預測.至2010年止,超過85%之美國寬頻帶用戶將具 有2 Mbps或2 Mbps以上之資料速率。 如圖3中所指示,實際可用最大資料速率3 〇2可隨著時間 而波動。因此,在低延時、線上遊戲或應用程式軟體情況 136720.doc -49- 200941233 I ’有時難以預測用於特定視訊流之實際可用資料速率。 2於特定量之場景複雜度及運動在較數目之每秒圖框 ps下以給疋解析度(例如,64〇x48〇 @ 6 定品質位準所需的資料速率303升高高於實)=; = '如藉由圖3中之蜂值指示),則可出現= 舉例而3,—些網際網路服務將僅丟棄封包,從而導 致使用者之視訊螢幕上的丟失的資料及失真的,丟失的影 像。其他服務將暫時緩衝(亦即,排入仔列)額外封包且以 可用資料速率將該等封包提供至用戶#,從而導致延時之 增加對於許多視訊遊戲及應用程式而言為不可接受的結 果。最後,一些網際網路服務提供者將資料速率之增加視 為惡意攻擊(諸如,否認服務攻擊(由電腦黑客用以^網路 連接停用的熟知技術)),且將在特定時間週期中切斷使用 者之網際網路連接。因此,本文中所描述之實施例設法確 保用於視訊遊戲的所需資料速率不會超過最大可用資料速 率。This display reduces the game or application, including, for example, the game or application in the classroom, the form of the media, or the downloaded software. Or the possibility of illegal copying (piracy) of the application software 136720.doc •47- 200941233 Sexuality and the possibility of mitigating the piracy of valuable libraries that can be used by games or application software. In fact, if you need a specialized server (for example, a very expensive, large or noisy device) to play games or application software that is not feasible for home or office use, even if you get a game or application software. A copy of the pirated copy will not be operated in the home or office. In one embodiment, the colocation service 2 is directed to a game or application software developer who designs video games (which generally refers to a software development company, a game play or movie studio, or a game or application software publisher). 220 provides a software development tool to enable it to design games that can be executed on the colocation service 21〇. The s-specific tool allows developers to take advantage of the features of colocation services (the features are usually not available in a single iPC or game console) (for example, a very large database of fast access to complex geometries (unless otherwise conditional) Otherwise, "geometry" will be used herein to refer to the polygons, textures, rigging, lighting, behavior, and other components and parameters that define the 3D dataset). Under this architecture, different business models are possible. Under a model, the host escrow service 210 charges a subscription fee from the end user and pays royalties to the developer, as shown in Figure 2a. In an alternate implementation (shown in the figure), the developer 220 charges the subscription fee directly from the user and pays the colocation service 210 for the cost of hosting the game or application content. These basic principles are not limited to any particular business model used to host an online game or application host. Slow compression video features 136720.doc •48- 200941233 As mentioned earlier, the obvious problem with video game services or application software services is delay. The delay of 7 〇 milliseconds - 80 milliseconds (the time from when the input device is actuated by the user to when the response is displayed on the display device) is the upper limit for games and applications that require fast response times. * 'This is very difficult to achieve due to the large number of actual and physical constraints that make this architecture not shown in Figures 2a and 2b. As indicated in Figure 3, when the user subscribes to the Internet service, the connection constant S is the nominal maximum data rate to the user's home or office. 301 #Depends on the provider's policy and routing device capabilities. , | The maximum data rate can be more or less strictly enforced 'but usually for a number of different reasons, the actual available data rate is lower. For example, there may be too many network traffic at the DSL central office or at the local end of the data logger loop, or there may be noise on the electrical winding, causing the discarded seal & or the provider may Establish the maximum number of bits per month for each use. Currently, the maximum downlink data rate for cable and DSL services is typically in the range of hundreds of kilobits per second (Kbps) to 30 Mbps. Honeycomb type The data is usually limited to (four) hundred Kbps. However, (iv) the speed of services and the number of users subscribed to broadband services will increase dramatically over time. Currently, some analysts estimate that 33% of US broadband users have data rates below 2 Mbps or above 2 Mbps. For example, some analysts predict that by 2010, more than 85% of US broadband users will have data rates of 2 Mbps or more. As indicated in Figure 3, the actual available maximum data rate of 3 〇 2 can fluctuate over time. Therefore, in the case of low latency, online gaming or application software, 136720.doc -49- 200941233 I ‘it is sometimes difficult to predict the actual available data rate for a particular video stream. 2 The scene complexity and motion at a certain amount are given to the resolution of the number of frames per second ps (for example, the data rate 303 required for the quality level of 64〇x48〇@6 is higher than the real) =; = 'If indicated by the bee value in Figure 3, then it can appear = example and 3, some internet services will only discard the packet, resulting in lost data and distortion on the user's video screen. , lost image. Other services will temporarily buffer (i.e., queue) extra packets and provide them to User# at the available data rate, resulting in an increase in latency that is unacceptable for many video games and applications. Finally, some Internet service providers view the increase in data rate as a malicious attack (such as a denial of service attack (a well-known technique used by computer hackers to disable network connections)) and will be cut in a specific time period. Disconnect the user's internet connection. Thus, the embodiments described herein seek to ensure that the required data rate for a video game does not exceed the maximum available data rate.
主機代管服務架構 圖4a說明根據一實施例之主機代管服務21〇的架構。主 機代管服務210可定位於單一伺服器中心中,或者可跨越 複數個伺服器中心而分散(以為具有比其他者低延時的至 特定伺服器中心之路徑的使用者提供低延時連接,以在使 用者之間提供負载平衡,且在一或多個伺服器中心出故障 之狀況下提供冗餘)。主機代管服務21〇最終可包括成千上 萬個或甚至數百萬個飼服器402,從而伺服非常大之使用 136720.doc •50- 200941233 者基礎(user base)。主機代管服務控制系統4〇1提供對主機 代管服務21 0之總體控制’且指引路由器、飼服器、視訊 壓縮系統、§十費及帳務系統等。在一實施例中,主機代管 服務控制系統401實施於以Linux為基礎之分散式處理系統 上,該處理系統綁定至用於儲存用於使用者資訊、伺服器 負afl及系統統δ十資料之資料庫的RAID陣列。在上述描述 中’除非歸因於其他特定系統’否則由主機代管服務2 i 〇 實施之各種動作由主機代管服務控制系統401來起始及控 〇 制。 主機代管服務210包括許多伺服器402,諸如當前可自 Intel、IBM及Hewlett Packard及其他者得到的彼等伺服 器。或者,可將伺服器402裝配成定製組件組態,或者最 終可將伺服器402整合以便將整個伺服器實施為單一晶 片。儘管此圖為說明起見而展示少數伺服器402,但在實 際部署中’可能存在少至一伺服器402或多達數百萬個或 數百萬個以上伺服器402的伺服器。伺服器402均可以相同Host Managed Service Architecture Figure 4a illustrates the architecture of a hosted service 21〇 according to an embodiment. The colocation service 210 can be located in a single server center or can be spread across multiple server centers (to provide a low latency connection to users with a lower latency to a particular server center than others) to Provides load balancing between users and provides redundancy in the event of one or more server center failures. The colocation service 21〇 can eventually include tens of thousands or even millions of feeders 402, so that the servo is very large. 136720.doc • 50- 200941233 The user base. The colocation service control system 4-1 provides overall control over the host escrow service and directs routers, feeders, video compression systems, § ten fees, and accounting systems. In one embodiment, the hosted service control system 401 is implemented on a Linux-based distributed processing system that is tied to storage for user information, server negative afl, and system hierarchy δ A RAID array of data databases. In the above description, the various actions implemented by the colocation service 2 i 起始 are initiated and controlled by the colocation service control system 401 unless otherwise attributed to other specific systems. The colocation service 210 includes a number of servers 402, such as those currently available from Intel, IBM, and Hewlett Packard, among others. Alternatively, the server 402 can be assembled into a custom component configuration, or the server 402 can ultimately be integrated to implement the entire server as a single wafer. Although this figure shows a small number of servers 402 for purposes of illustration, in actual deployments there may be as few as one server 402 or as many as millions or millions of servers 402. Servers 402 can all be the same
G 方式組態(作為一些組態參數之實例,具有相同Cpu類型及 效能;具有或不具有GPU,且若具有GPU,則具有相同 GPU類型及效能;具有相同數目之CPU及GPU ;具有相同 量及相同類型/速度之RAM ;及具有相同RAM組態),或伺 服器402之各種子集可具有相同組態(例如,25%之飼服器 可以一特定方式組態,50%之伺服器以一不同方式組態, 且25%之伺服器以又一方式組態),或每個伺服器4〇2可不 同0 I36720.doc 51 200941233 在-實施例中,伺服器402無磁碟,亦即,並非具有其 自身的本端大容量儲存器(其為光學或磁性儲㈣,、或者 以半導體為基礎之儲存器,諸如快閃記憶體或飼服類似功 能之其他大容量儲存構件),每一伺服器經由快速底板或 網路連接而存取共用的大容量儲存器。在一實施例中,此 快速連接為連接至獨立冗餘磁碟陣列(11八1〇) 4〇5系列之儲 存區域網路(SAN) 4〇3 ’在使用超高速乙太網路實施之器 件之間具有連接。如熟習此項技術者已知的,SAN 403可 Ο 用於將許多RAID陣列405組合在-起,從而導致極高之頻 寬-接近或可能超過可自用於當前遊戲控制台及pc中之 RAM得到的頻寬。此外,儘管基於諸如磁性媒體之旋轉媒 體的RAID陣列經常具有顯著的搜尋時間存取延時,但基 於半導體儲存器之RAID陣列可實施為具有低得多的存取 延時。在另一組態中’一些或所有伺服器4〇2在本端提供 一些或所有其自身的大容量儲存器。舉例而言,伺服器 ^ 402可將頻繁存取之資訊(諸如,其作業系統及視訊遊戲或 應用程式之複本)儲存於以低延時本端快閃記憶體為基礎 之儲存器上’但其可利用SAN來存取基於旋轉媒體之具有 較兩搜尋延時之RAID陣列405,以較不頻繁地存取幾何形 狀或遊戲狀態資訊之大資料庫。 另外’在一實施例中,主機代管服務21〇使用下文詳細 描述的低延時視訊壓縮邏輯4〇4。視訊壓縮邏輯404可以軟 體、硬體或其任何組合來實施(下文描述其特定實施例)。 視訊壓縮邏輯404包括用於壓縮音訊以及視覺材料之邏 136720.doc •52- 200941233 輯。 在操作中,當經由鍵盤、滑鼠、遊戲控制器或其他輸入 器件421而玩視訊遊戲或使用使用者場所211處之應用程式 時,用戶端415上之控制信號邏輯413將表示由使用者致動 之按鈕按壓(及其他類型之使用者輸入)的控制信號4〇6a_ b(通常為UDP封包之形式)傳輸至主機代管服務21〇。將來 自給疋使用者之控制信號路由至適當伺服器(或若多個伺 服器回應於使用者之輸入器件,則路由至多個伺服器) 〇 402。如圖4a中所說明,可經由SAN而將控制信號406a路 由至伺服器402。或者或另外,可經由主機代管服務網路 (例如,以乙太網路為基礎之區域網路)而將控制信號4〇6b 直接路由至伺服器402。不管控制信號4〇6a_b係如何被傳 輸,該或該等伺服器均回應於控制信號4〇6a_b而執行遊戲 或應用程式軟體。儘管圖4a中未說明,但各種網路連接組 件(諸如,防火牆及/或閘道器)可處理主機代管服務21〇之 邊緣處(例如,主機代管服務210與網際網路410之間)及/或 使用者場所211之邊緣處(網際網路41〇與家庭或辦公室用 戶端415之間)的傳入及傳出的訊務。所執行的遊戲或應用 程式軟體之圖形及音訊輸出(亦即,新的視訊影像序列)提 供至低延時視訊壓縮邏輯4〇4,低延時視訊壓縮邏輯4〇4根 據低延時視訊壓縮技術(諸如,本文中所描述之彼等技術) 而壓縮視訊影像序列且經由網際網路4丨〇(或,如下文所描 述,經由繞過通用網際網路的最佳高速網路服務)而將經 壓縮之視訊流(通常具有經壓縮或未經壓縮之音訊)傳輸回 136720,doc -53· 200941233 至用戶端415。接著’用戶端415上之低延時視訊解壓縮邏 輯412解壓縮視訊及音訊流並再現經解壓縮之視訊流,且 通常在顯示器件422上播放經解壓縮之音訊流。或者,可 在與顯示器件422分開之揚聲器上播放音訊或根本不播放 音訊。注意’儘管輸入器件421及顯示器件422在圖2a及圖 2b中展示為獨立式器件’但其可整合於諸如可摧式電腦或 行動器件之用戶端器件内。 家庭或辦公室用戶端415(先前在圖2a及圖2b中描述為家 © 庭或辦公室用戶端205)可為非常低廉且低能力之器件,其 具有非常有限之計算或圖形效能且可能具有非常有限之本 端大容量儲存器或不具有本端大容量儲存器。相比之下, 耦合至SAN 403及多個RAID 405之每一伺服器4〇2可為格 外高效能之計算系統,且實際上,若多個伺服器以一並列 處理組態合作地使用,則幾乎不存在對可承受的計算量及 圖形處理能力的限制。此外,由於低延時視訊壓縮4〇4及 低乙時視訊解壓縮412(由使用者感知地),所以將伺服器 402之計算能力提供給使用者。當使用者按壓輸入器件 上之按鈕時,顯示器422上之影像被回應於按鈕按壓而更 新(在感知上無有意義之延遲),好像遊戲或應用程式軟體 係在本端執行。因此,對於為非常低效能之電腦或僅為實 施低延時視訊解壓縮及控制信號邏輯413之低廉晶片的家 庭或辦公室用戶端415,自看來在本端可用之遠端位置有 效地為使用者提供任意計算能力。此為使用者給出用於玩 最高1%、處理器密集的(通常為新的)視訊遊戲及最高效能 136720.doc •54· 200941233 之應用程式的能力。 圖4c展示非常基礎且低廉的家庭或辦公室用戶端器件 465。此器件為來自圖4a及圖4b之家庭或辦公室用戶端415 之一實施例。其為約2吋長。其具有與具有乙太網路供電 (PoE)之乙太網路電纜介接的乙太網路插孔462,該器件自 乙太網路插孔462得到其電力及其至網際網路之連接性。 該器件能夠在支援網路位址轉譯(NAT)之網路内執行 NAT。在辦公室環境中’許多新的乙太網路交換器具有 © PoE且將PoE直接帶至辦公室中之乙太網路插孔》在此種 情形下’所需的為自壁式插孔至用戶端465之乙太網路電 纜。若可用的乙太網路連接不載運電力(例如,在具有DSL 或電纜數據機但無PoE之家庭中)’則存在可用的低廉的壁 式「磚塊(brick)」(亦即,電源)’其將接受無電力之乙太 網路電鏡且輸出具有PoE之乙太網路。 用戶端465含有耗合至藍芽無線介面之控制信號邏輯 41 3(圖4a) ’該藍芽無線介面與諸如鍵盤、滑鼠、遊戲控制 及/或麥克風及/或耳機之藍穿輸入器件4 7 9介接。又,用 戶端465之一實施例在與顯示器件468耦合的情況下能夠以 120 fps輸出視訊,顯示器件468能夠支援12〇 fps視訊且向 一對遮光眼鏡466發信號(通常經由紅外)以對於每一相繼圖 框交替地遮蔽一隻眼接著遮蔽另一隻眼。使用者所感覺之 效應為「跳出」顯示螢幕之立體3D影像。支援該操作之一 種該顯示器件468為Samsung HL-T5076S。因為用於每一隻 眼之視訊流係單獨的,所以在兩個獨立視訊流係由主機代 136720.doc -55- 200941233 管服務21 0壓縮的一實施例中,圖框在時間上交錯,且圖 框在用戶端465内係以兩個獨立解壓縮過程來解壓縮。 用戶端465亦含有低延時視訊解壓縮邏輯412,其解壓縮 傳入的視訊及音訊且經由HDMI(高清晰度多媒體介面)、 連接器463輸出’ HDMI(高清晰度多媒體介面)、連接器 463插入於SDTV(標準清晰度電視)或HDTV(高清晰度電 * 視)468中’從而向TV提供視訊及音訊,或插入於支援 HDMI之監視器468中。若使用者之監視器468不支援 O HDMI ’則可使用HDMI至DVI(數位視覺介面),但音訊將 丟失。在HDMI標準下’顯示能力(例如,所支援之解析 度’圖框速率)464係自顯示器件468傳達,且接著經由網 際網路連接462將此資訊傳回至主機代管服務21〇,因此主 機代管服務2 1 0可使經壓縮之視訊以適合於該顯示器件之 格式串流。 圖4d展示家庭或辦公室用戶端器件475,除了用戶端器 件475具有更多外部介面之外,其與圖4c中所展示之家庭 © 或辦公室用戶端器件465相同。又,用戶端475可接受P〇E 來供電,或者其可佔用插入牆壁中之外部電源配接器(未 圖示)。視訊相機477使用用戶端475 USB輸入將經壓縮之 視訊提供至用戶端475,經壓縮之視訊由用戶端475上載至 主機代管服務210以用於下文所描述之用途。將利用下文 所描述之壓縮技術將低延時壓縮器建置於相機477中。 除具有用於其網際網路連接之乙太網路連接器之外,用 戶端475亦具有至網際網路之8〇211 g無線介面。兩種介面 136720.doc -56· 200941233 均能夠在支援NAT之網路内使用NAT。 又,除具有用於輸出視訊及音訊之HDMI連接器之外, 用戶端475亦具有雙鏈接DVI-I連接器,雙鏈接DVI-I連接 器包括類比輸出端(且具有將提供VGA輸出之標準配接器 電纜)。其亦具有用於複合視訊及S視訊之類比輸出端。 對於音訊,用戶端475具有左/右類比立體RCA插孔,且 對於數位音訊輸出,其具有TOSLINK輸出端。 除了至輸入器件479之藍芽無線介面之外,其亦具有用 Ο 於介接至輸入器件之USB插孔。 圖4e展示用戶端465之内部架構之一實施例。該圖中所 展示的所有器件或一些器件可實施於場可程式化邏輯陣 列、定製ASIC中或若干個離散器件(定製設計或者現成的) 中。 具有PoE之乙太網路497附接至乙太網路介面481。電力 499係自具有PoE之乙太網路497得到且連接至用戶端465中 之其餘器件。匯流排480為用於器件之間的通信之公同匯 〇 流排。 執行來自快閃記憶體476之小用戶端控制應用程式的控 制CPU 483(幾乎任何小(:1>1;係適當的,諸如具有嵌入式 RAM的100 MHz下的MIPS R4000系列CPu)實施用於網路 (亦即,乙太網路介面)之協定堆疊且亦與主機代管服務2ι〇 通信,並組態用戶端465中之所有器件。其亦處理與輸入 器件469之介面並將封包(必要時’連同受前向錯誤校正保 護之使用者控制器資料一起)發送回至主機代管服務加。 136720.doc •57- 200941233 又’控制CPU 483監視封包訊務(例如,封包係吾失還是延 遲,以及其到達之時間戳)。將此資訊發送回至主機代管 服務210,以使得其可恆定地監視網路連接且相應地調整 其發送之内容《最初在製造時為快閃記憶體476載入用於 控制CPU 483之控制程式以及對於特定用戶端465單元而言 唯一的序號。此序號允許主機代管服務21〇唯一地識別用 戶端465單元。 藍芽介面484經由其天線(在用戶端465内部)無線地通信 Ο 至輸入器件469。 視訊解壓縮器486為經組態以實施本文中所描述之視訊 解壓縮的低延時視訊解壓縮器。大量視訊解壓縮器件存 在’或者為現成產品,或者作為具有可整合於FPGA或定 製ASIC中的設計之智慧產權(IP)。一提供用於H 264解碼 器之IP的公司為NSW Australia之Ocean Logic Of Manly。 使用IP之優點在於:本文中所使用之壓縮技術與壓縮標準 不相符。一些標準解壓縮器足夠靈活以經組態以適應本文 中之壓縮技術,但一些標準解壓縮器可能並非如此。但 疋,在IP之情況下,在視需要而重新設計解壓縮器中存在 完全靈活性。 視訊解壓縮器之輸出端耦合至視訊輸出子系統487,視 訊輸出子系統487將視訊耦合至HDMI介面490之視訊輸出 端。 音訊解壓縮子系統488或者使用可用的標準音訊解壓縮 器來實施,或者其可實施為IP,或者可在可(例如)實施 136720.doc -58· 200941233G mode configuration (as an example of some configuration parameters, with the same CPU type and performance; with or without GPU, and with GPU, with the same GPU type and performance; with the same number of CPU and GPU; with the same amount And the same type/speed RAM; and with the same RAM configuration), or various subsets of the server 402 can have the same configuration (for example, 25% of the feeders can be configured in a specific way, 50% of the servers Configured in a different way, and 25% of the servers are configured in a further way), or each server 4〇2 can be different. I36720.doc 51 200941233 In an embodiment, the server 402 has no disk, That is, it does not have its own local mass storage (which is an optical or magnetic storage (four), or a semiconductor-based storage, such as flash memory or other large-capacity storage components of the feeding function) Each server accesses the shared mass storage via a fast backplane or network connection. In one embodiment, the fast connection is connected to an independent redundant disk array (11 〇 1 〇) 4 〇 5 series storage area network (SAN) 4 〇 3 ' implemented in the use of ultra-high speed Ethernet There is a connection between the devices. As is known to those skilled in the art, SAN 403 can be used to combine many RAID arrays 405, resulting in extremely high bandwidth - close to or possibly exceeding the RAM available for use in current gaming consoles and PCs. The resulting bandwidth. Moreover, while RAID arrays based on rotating media such as magnetic media often have significant seek time access latency, RAID arrays based on semiconductor memories can be implemented with much lower access latency. In another configuration, some or all of the servers 4〇2 provide some or all of their own mass storage at the local end. For example, the server 402 can store frequently accessed information (such as a copy of its operating system and video game or application) on a low-latency local flash memory-based storage. The SAN can be used to access a RAID array 405 based on rotating media with two more search delays to access the large database of geometry or game state information less frequently. In addition, in an embodiment, the colocation service 21 uses the low latency video compression logic 4〇4 described in detail below. Video compression logic 404 can be implemented in software, hardware, or any combination thereof (described in its specific embodiments below). Video compression logic 404 includes logic for compressing audio and visual material 136720.doc • 52-200941233. In operation, when a video game is played via a keyboard, mouse, game controller or other input device 421 or an application at the user location 211 is used, the control signal logic 413 on the client 415 will indicate The control signal 4〇6a_b (usually in the form of a UDP packet) of the push button press (and other types of user input) is transmitted to the colocation service 21〇. In the future, the control signal from the user is routed to the appropriate server (or to multiple servers if multiple servos respond to the user's input device) 〇 402. Control signal 406a can be routed to server 402 via the SAN as illustrated in Figure 4a. Alternatively or additionally, control signals 4〇6b may be routed directly to server 402 via a hosted service network (e.g., an Ethernet-based local area network). Regardless of how the control signals 4〇6a_b are transmitted, the or the servers execute the game or application software in response to the control signals 4〇6a_b. Although not illustrated in FIG. 4a, various network connectivity components, such as firewalls and/or gateways, may be handled at the edge of the colocation service 21 (eg, between the colocation service 210 and the Internet 410) And/or incoming and outgoing traffic at the edge of the user premises 211 (between the Internet 41〇 and the home or office client 415). The graphics and audio output of the executed game or application software (ie, the new video image sequence) is provided to the low-latency video compression logic 4〇4, and the low-latency video compression logic 4〇4 is based on the low-latency video compression technique (such as The video image sequence is compressed and compressed via the Internet (or, as described below, via the best high speed network service bypassing the universal Internet). The video stream (usually with compressed or uncompressed audio) is transmitted back to 136720, doc-53·200941233 to the client 415. The low latency video decompression logic 412 on the client 415 then decompresses the video and audio streams and reproduces the decompressed video stream, and typically plays the decompressed audio stream on the display device 422. Alternatively, the audio may be played on a separate speaker from the display device 422 or not at all. Note that although input device 421 and display device 422 are shown as stand-alone devices in Figures 2a and 2b, they may be integrated into a client device such as a destructible computer or mobile device. The home or office client 415 (previously described as home or office client 205 in Figures 2a and 2b) can be a very low cost and low power device with very limited computational or graphical performance and possibly very limited The local large-capacity storage or the local large-capacity storage. In contrast, each server 4〇2 coupled to the SAN 403 and the plurality of RAIDs 405 can be an exceptionally efficient computing system, and in fact, if multiple servers are cooperatively used in a side-by-side configuration configuration, There is almost no limit to the amount of computation and graphics processing that can be tolerated. In addition, the computational power of the server 402 is provided to the user due to the low latency video compression 4〇4 and the low B video decompression 412 (perceived by the user). When the user presses a button on the input device, the image on display 422 is updated in response to the button press (with no meaningful delay in perception) as if the game or application software was executing at the local end. Thus, for a very low-performance computer or a home or office client 415 that is only a low-cost chip that implements low-latency video decompression and control signal logic 413, it is effectively available to the user from a remote location that appears to be available at the local end. Provide any computing power. This gives the user the ability to play up to 1% of processor-intensive (usually new) video games and applications with maximum performance of 136720.doc •54· 200941233. Figure 4c shows a very basic and inexpensive home or office client device 465. This device is an embodiment of the home or office client 415 from Figures 4a and 4b. It is about 2 inches long. It has an Ethernet jack 462 that interfaces with an Ethernet cable (PoE), which receives its power from the Ethernet jack 462 and its connection to the Internet. Sex. The device is capable of performing NAT within a network that supports Network Address Translation (NAT). In an office environment, 'many new Ethernet switches have ©PoE and bring PoE directly to the Ethernet jack in the office.' In this case, 'the required wall is the self-walled jack to the user. End 465 Ethernet cable. If the available Ethernet connection does not carry power (for example, in a home with a DSL or cable modem but no PoE) then there is an inexpensive wall-type "brick" (ie, power supply) available. 'It will accept a powerless Ethernet mirror and output an Ethernet with PoE. The client 465 contains control signal logic 41 3 (Fig. 4a) that is consuming the Bluetooth wireless interface. The Bluetooth wireless interface and the blue-through input device 4 such as a keyboard, mouse, game control and/or microphone and/or earphone 4 7 9 interface. Moreover, one embodiment of the client 465 can output video at 120 fps with the display device 468 coupled, and the display device 468 can support 12 〇 fps video and signal a pair of opaque glasses 466 (typically via infrared) for Each successive frame alternately shades one eye and then obscures the other eye. The effect felt by the user is to "jump out" the stereoscopic 3D image of the display screen. One of the operations is supported. The display device 468 is a Samsung HL-T5076S. Since the video stream for each eye is separate, in one embodiment where the two independent video streams are compressed by the host 136720.doc - 55 - 200941233, the frames are interleaved in time, and The frame is decompressed in client 465 in two separate decompression processes. The client 465 also includes low-latency video decompression logic 412, which decompresses incoming video and audio and outputs 'HDMI (High Definition Multimedia Interface), connector 463 via HDMI (High Definition Multimedia Interface), connector 463 It is inserted in SDTV (standard definition TV) or HDTV (high definition TV) 468 to provide video and audio to the TV, or to be inserted into the monitor 468 supporting HDMI. If the user's monitor 468 does not support O HDMI ’, HDMI to DVI (Digital Visual Interface) can be used, but the audio will be lost. The 'display capability (eg, supported resolution 'frame rate) 464 is conveyed from the display device 468 under the HDMI standard, and then this information is passed back to the colocation service 21 via the internet connection 462, thus The colocation service 2 1 0 can cause the compressed video to be streamed in a format suitable for the display device. Figure 4d shows a home or office client device 475, which is identical to the home © or office client device 465 shown in Figure 4c, except that the client device 475 has more external interfaces. Again, the client 475 can accept P〇E to power, or it can occupy an external power adapter (not shown) that is plugged into the wall. The video camera 477 provides the compressed video to the client 475 using the client 475 USB input, and the compressed video is uploaded by the client 475 to the colocation service 210 for use as described below. The low latency compressor will be built into camera 477 using the compression techniques described below. In addition to having an Ethernet connector for its Internet connection, the client 475 also has an 8 〇 211 g wireless interface to the Internet. Both interfaces 136720.doc -56· 200941233 are able to use NAT in a network that supports NAT. In addition to the HDMI connector for outputting video and audio, the client 475 also has a dual-link DVI-I connector, and the dual-link DVI-I connector includes an analog output (and has a standard that will provide VGA output). Adapter cable). It also has an analog output for composite video and S video. For audio, the client 475 has a left/right analog stereo RCA jack and has a TOSLINK output for digital audio output. In addition to the Bluetooth wireless interface to input device 479, it also has a USB jack for interfacing to the input device. Figure 4e shows an embodiment of the internal architecture of the client 465. All or some of the devices shown in this figure can be implemented in a field programmable logic array, in a custom ASIC, or in several discrete devices (custom design or off-the-shelf). Ethernet 497 with PoE is attached to the Ethernet interface 481. Power 499 is derived from Ethernet 497 with PoE and is connected to the remaining devices in client 465. Bus 480 is a common sink for communication between devices. A control CPU 483 that executes a small client control application from flash memory 476 (almost any small (:1>1; suitable, such as MIPS R4000 series CPu at 100 MHz with embedded RAM) is implemented for The network (i.e., the Ethernet interface) is stacked and also communicates with the colocation service 2, and configures all of the devices in the client 465. It also processes the interface with the input device 469 and encapsulates ( If necessary, 'along with the user controller data protected by the forward error correction, send back to the colocation service plus. 136720.doc •57- 200941233 And 'control the CPU 483 to monitor the packet traffic (for example, the packet is lost) It is also the delay, and the timestamp of its arrival.) This information is sent back to the colocation service 210 so that it can constantly monitor the network connection and adjust the content it sends accordingly (initially at the time of manufacture is flash memory) Body 476 loads the control program for controlling CPU 483 and the serial number unique to the particular client 465. This sequence number allows the host hosting service 21 to uniquely identify the client 465 unit. The bud interface 484 wirelessly communicates via its antenna (within the user terminal 465) to the input device 469. The video decompressor 486 is a low latency video decompressor configured to implement the video decompression described herein. The video decompression device exists either as an off-the-shelf product or as an intellectual property (IP) with a design that can be integrated into an FPGA or custom ASIC. A company that provides IP for the H 264 decoder is Ocean Logic of NSW Australia. Of Manly. The advantage of using IP is that the compression techniques used in this article do not match the compression standards. Some standard decompressors are flexible enough to be configured to accommodate the compression techniques in this article, but some standard decompressors may not However, in the case of IP, there is full flexibility in redesigning the decompressor as needed. The output of the video decompressor is coupled to the video output subsystem 487, which couples the video to the HDMI. The video output of interface 490. The audio decompression subsystem 488 is implemented using an available standard audio decompressor, or it can be Implemented as IP, or can be implemented, for example, 136720.doc -58· 200941233
Vorbis音訊解壓縮器之控制處理器483内實施音訊解壓縮。 實施音訊解壓縮之器件耦合至音訊輸出子系統489,音 訊輸出子系統489將音訊耦合至HDMI介面490之音訊輸出 端。 圖4f展示用戶端475之内部架構之一實施例。如可見, 除額外介面及來自插入牆壁中之電源配接器的可選外部 DC電力(且若如此使用,則可選外部DC電力替換將來自乙 太網路PoE 497之電力)之外,該架構與用戶端465之架構 〇 相同。下文中將不重複與用戶端465共同之功能性,但將 額外功能性描述如下。 CPU 483與額外器件通信且組態額外器件。The audio decompression is implemented in the control processor 483 of the Vorbis audio decompressor. The device that implements the audio decompression is coupled to an audio output subsystem 489 that couples the audio to the audio output of the HDMI interface 490. Figure 4f shows an embodiment of the internal architecture of the client 475. As can be seen, in addition to the additional interface and optional external DC power from the power adapter plugged into the wall (and if so, the optional external DC power replacement will be from the Ethernet PoE 497), The architecture is the same as that of the client 465. The functionality common to the client 465 will not be repeated below, but the additional functionality will be described below. The CPU 483 communicates with additional devices and configures additional devices.
WiFi子系統482經由其天線提供無線網際網路存取,作 為對乙太網路497之替代。WiFi子系統可購自多家製造 商,包括 CA 之Santa Clara 之 Atheros Communications。 USB子系統485提供對用於有線USB輸入器件479之藍芽 通信的替代。USB子系統相當標準且可容易地用於FPGA 0 及ASIC,且經常建置於執行如視訊解壓縮之其他功能的現 成器件中。 與用戶端465内之視訊輸出相比較,視訊輸出子系統487 產生較寬範圍之視訊輸出。除提供HDMI 490視訊輸出之 外,其提供DVI-I 491、S-視訊492及複合視訊493。又,當 DVI-I 491介面係用於數位視訊時,將顯示能力464自顯示 器件傳回至控制CPU 483,以使得其可向主機代管服務210 通知顯示器件478之能力。由視訊輸出子系統487提供之所 136720.doc -59- 200941233 有介面均為相當標準之介面且容易以許多形式可用。 音訊輸出子系統489經由數位介面494(S/PDIF及/式 Toslink)數位地輸出音訊且經由立體類比介面495輸出類比 形式之音訊。 來回行程延時分析 當然,為了實現前一段之利益,使用者使用輸入器件 421之動作與在顯示器件42〇上看見彼動作之後果之間的來 回行程延時應不大於7〇毫秒_8〇毫秒。此延時必須考慮在 〇 自使用者場所211中之輸入器件421至主機代管服務21〇及 再次返回至使用者場所211至顯示器件422之路徑中的所有 因素。圖4b說明各種組件及網路(信號必須經由其行進), 且此等組件及網路上方的為時刻表,該時刻表列出實際實 施中可預期的例示性延時。注意,圖4b經簡化以便僅展示 重要路徑路由。下文描述用於系統之其他特徵之資料的其 他路由。雙頭箭頭(例如,箭頭453)指示來回行程延時且單 ,箭頭(例如,箭頭457)指示單向延時,且「〜」表示近似 S測。應指出,將存在所列之延時不可達成的真實世界情 形仁在大量狀況下,在美國,使用至使用者場所211之 DSL及電纜數據機連接,此等延時可在下一段中所描述之 情形中達成。又’注意,儘管至網際網路之蜂巢式無線連 接!·生的確將在所展不之系統中工作,但大多數當前美國蜂 巢式資料系統(諸如,EVD〇)招致非常高之延時且將不能 夠達成圖4b中所展示之延時。然而,此等基本原理可在可 能能夠實施此位準之延時的未來蜂巢式技術上實施。 136720.doc • 60 · 200941233 自使用者場所211處之輸入器件421開始,一旦使用者致 輸器件42ι,就將使用者控制信號發送至用戶端 化(其^可為諸如機頂盒之獨立器件,或其可為在諸如pc或 行動器件之另-器件中執行的軟體或硬體),且將其封包 化(在一實施财以UDP格式)並為封包給出目的地位址以 到達主機代管服務210。封包將亦含有用於指示控制信號 係來自哪個使用者的資訊。接著經由防火牆/路由器/ NAT(網路位址轉譯)器件443將控制信號封包轉遞至介 © ® 442。〜顏介® 442為由使用者之ISP(網際網路服務提供 者)提供至使用者場所211的介面器件。WAN介面442可為 電纜或DSL數據機、WiMax收發器、光纖收發器、蜂巢式 資料介面、電力線網際網路協定介面(Internet pn>t()e()i_ 〇ver-p0werline interface) ’或至網際網路之許多介面中的 任何其他介面。另外,可將防火牆/路由器/ΝΑτ器件 443(及(可能地)WAN介面442)整合於用戶端415中。此之一 實例將為行動電話,其包括用於實施家庭或辦公室用戶端 〇 415之功能性的軟體,以及用於經由某一標準(例如, 802.11 g)而無線地路由及連接至網際網路的構件。 W A N介面4 4 2接著將控制信號路由至本文中所稱的用於 使用者之網際網路服務提供者(ISP)的「存在點」44ι, WAN介面442為提供連接至使用者場所211之WAN輸送器與 通用網際網路或私用網路之間的介面的設施。存在點之特 性將視所提供之網際網路服務的性質而改變。對於dsl, 其通常將為DSLAM所定位之電話公司中央辦公室。對於 136720.doc -61- 200941233 電缓數據機,其通常將為電欖多系統運營商(Ms〇)頭端。 對於蜂巢式系統,其通常將為與蜂巢式塔相關聯的控制 室。但無論存在點之性質怎樣,其均將接著將控制信號封 包路由至通用網際網路410。接著經由將最可能係光纖收 發器介面之介面將控制信號封包路由至WAN介面444至主 機代管服務210。WAN 444將接著將控制信號封包路由至 路由邏輯409(其可以許多不同方式來實施,包括乙太網路 交換器及路由伺服器),路由邏輯4〇9估計使用者之位址且 〇 將控制信號路由至用於給定使用者之正確的伺服器4〇2。 伺服器402接著將該等控制信號視為在伺服器4〇2上執行 之遊戲或應用程式軟體的輸入且使用該等控制信號來處理 遊戲或應用程式之下一個圖框。一旦產生下一個圖框,就 將視訊及音訊自伺服器402輸出至視訊壓縮器404。可經由 各種構件將視訊及音訊自伺服器402輸出至壓縮器404。首 先,可將壓縮器404建置於伺服器402中,因此可在伺服器 402内在本端實施壓縮。或者’可經由至網路(其或者為飼 ® 服器402與視訊壓縮器404之間的私用網路,或者為經由諸 如SAN 403之共用網路的網路)之網路連接(諸如,乙太網 路連接)以封包化形式輸出視訊及/或音訊。或者,可經由 視訊輸出連接器(諸如,DVI或VGA連接器)將視訊自伺服 器402輸出,且接著由視訊壓縮器404來俘獲。又,可將音 訊自伺服器402輸出為數位音訊(例如,經由TOSLINK或 S/PDIF連接器)或類比音訊,類比音訊由視訊壓縮器404内 之音訊壓縮邏輯來數位化並編碼。 136720.doc -62- 200941233 一旦視訊壓縮器404已俘獲來自伺服器402之視訊圖框及 在彼圖框時間期間所產生之音訊,則視訊壓縮器將使用下 文所描述之技術壓縮視訊及音訊。一旦視訊及音訊被壓The WiFi subsystem 482 provides wireless internet access via its antenna as an alternative to Ethernet 497. The WiFi subsystem is available from a number of manufacturers, including Atheros Communications of Santa Clara, CA. USB subsystem 485 provides an alternative to Bluetooth communication for wired USB input device 479. The USB subsystem is fairly standard and can be easily used in FPGAs 0 and ASICs, and is often built into existing devices that perform other functions such as video decompression. The video output subsystem 487 produces a wider range of video outputs than the video output in the client 465. In addition to providing HDMI 490 video output, it provides DVI-I 491, S-Video 492 and Composite Video 493. Also, when the DVI-I 491 interface is used for digital video, the display capability 464 is passed back from the display device to the control CPU 483 so that it can notify the host escrow service 210 of the capabilities of the display device 478. The 136720.doc -59- 200941233 interface provided by the video output subsystem 487 is a fairly standard interface and is readily available in many forms. The audio output subsystem 489 digitally outputs audio via the digital interface 494 (S/PDIF and/or Toslink) and outputs an analog form of audio via the stereo analog interface 495. Round trip delay analysis Of course, in order to realize the benefits of the previous paragraph, the user's action between the input device 421 and the effect of seeing the action on the display device 42〇 should be no more than 7 milliseconds _8 milliseconds. This delay must account for all factors in the path from the input device 421 to the colocation service 21A in the user premises 211 and back to the user premises 211 to the display device 422 again. Figure 4b illustrates the various components and networks through which signals must travel, and above these components and the network is a timetable that lists exemplary delays that can be expected in actual implementation. Note that Figure 4b is simplified to show only important path routing. Other routes for information on other features of the system are described below. A double-headed arrow (e.g., arrow 453) indicates a round-trip delay and a single, an arrow (e.g., arrow 457) indicates a one-way delay, and a "~" indicates an approximate S-test. It should be noted that there will be real-world situations in which the listed delays are not achievable. In a large number of situations, in the United States, DSL and cable modem connections to the user premises 211 are used, and such delays can be described in the next paragraph. Achieved. Also, 'note that despite the cellular wireless connectivity to the Internet! · Life will indeed work in the system that is not being deployed, most current US cellular data systems (such as EVD〇) incur very high latency and will The delay shown in Figure 4b cannot be achieved. However, these basic principles can be implemented on future cellular technologies that may be able to implement this level of delay. 136720.doc • 60 · 200941233 Beginning with the input device 421 at the user premises 211, once the user causes the device 42ι, the user control signal is sent to the user terminal (which may be a standalone device such as a set top box, or It can be a software or hardware implemented in another device such as a pc or mobile device, and it is packetized (in a UDP format) and the destination address is given to the packet to reach the colocation service. 210. The packet will also contain information indicating which user the control signal is from. The control signal packet is then forwarded to the interface ©® 442 via the Firewall/Router/NAT (Network Address Translation) device 443. ~Yan Jie® 442 is an interface device provided to the user's premises 211 by the user's ISP (Internet Service Provider). The WAN interface 442 can be a cable or DSL modem, a WiMax transceiver, a fiber optic transceiver, a cellular data interface, a power line internet protocol interface (Internet pn>t()e()i_ 〇ver-p0werline interface) or Any other interface in many interfaces of the Internet. Additionally, firewall/router/ΝΑτ device 443 (and (possibly) WAN interface 442) may be integrated into client 415. An example of this would be a mobile phone that includes software for implementing the functionality of a home or office client 415, and for wirelessly routing and connecting to the Internet via a standard (eg, 802.11g) Components. The WAN interface 4 4 2 then routes the control signals to the "presence point" 44 ι for the user's Internet Service Provider (ISP), which is the WAN that provides connectivity to the user premises 211. A facility between the conveyor and the interface between the universal Internet or the private network. The nature of the point of existence will vary depending on the nature of the Internet service provided. For dsl, it will typically be the central office of the telephone company that the DSLAM is targeting. For the 136720.doc -61- 200941233 electric slow data machine, it will usually be the head end of the electric multi-system operator (Ms〇). For a honeycomb system, it will typically be the control room associated with the honeycomb tower. But regardless of the nature of the point, it will then route the control signal packet to the universal internet 410. The control signal packets are then routed to the WAN interface 444 to the host escrow service 210 via the interface that is most likely to be the fiber optic transceiver interface. WAN 444 will then route the control signal packets to routing logic 409 (which can be implemented in many different ways, including Ethernet switches and routing servers), routing logic 4〇9 to estimate the user's address and will control The signal is routed to the correct server 4〇2 for a given user. The server 402 then treats the control signals as inputs to the game or application software executing on the server 4〇2 and uses the control signals to process the next frame of the game or application. Once the next frame is generated, the video and audio are output from the server 402 to the video compressor 404. Video and audio can be output from the server 402 to the compressor 404 via various components. First, the compressor 404 can be built into the server 402 so that compression can be performed at the local end within the server 402. Alternatively, it may be connected via a network (either a private network between the server 402 and the video compressor 404, or a network via a shared network such as the SAN 403) (such as, The Ethernet connection) outputs video and/or audio in a packetized form. Alternatively, the video may be output from the server 402 via a video output connector, such as a DVI or VGA connector, and then captured by the video compressor 404. Alternatively, the audio can be output from the server 402 as digital audio (e.g., via a TOSLINK or S/PDIF connector) or analog audio, and the analog audio is digitized and encoded by the audio compression logic within the video compressor 404. 136720.doc -62- 200941233 Once the video compressor 404 has captured the video frame from the server 402 and the audio generated during the frame time, the video compressor will compress the video and audio using the techniques described below. Once video and audio are pressed
縮,就藉由一位址將其封包化以將其發送回至使用者之用 戶端415,且將其路由至WAN介面444,WAN介面444接著 經由通用網際網路410路由視訊及音訊封包,通用網際網 路410接著將視訊及音訊封包路由至使用者之Isp的存在點 441,存在點441將視訊及音訊封包路由至使用者場所處之 WAN介面442,WAN介面442將視訊及音訊封包路由至防 火牆/路由器/NAT器件443,防火牆/路由器/NAT器件443接 著將視訊及音訊封包路由至用戶端415。 用戶端415解廢縮視訊及音訊,且接著在顯示器件 422(或用戶端之内置顯示器件)上顯示視訊並將音訊發送至 顯示器件422或至單獨的放大器/揚聲器或至建置於用戶端 中之放大器/揚聲器。 瓜丨叫%你你燉沖上無滯 後,來回行程延遲需要小於7〇毫秒或8〇毫秒。所描述之來 回行程路徑中的—些延時延遲受主機代管服務21〇及/或使 用者之控制,而其他的延時延遲不受主機代管服務η。及/ 或使用者之控制。儘管如此,基於大量真實世界情況之分 析及測試,以下為近似量測。 之刀 控制信號之單向傳輸時間451通常小 經由使用者場所之來回 ,ΛΑ J· ^ ^ 逋常係使用乙太網路 的易仵之^費者級防火牆/路由器/NAT交換器而在約】毫 136720.doc •63- 200941233 秒内完成。使用者ISP廣泛地改變其來回行程延遲453,但 在DSL及電纜數據機提供者之情況下,通常看見其在1〇毫 秒與25毫秒之間。通用網際網路41〇上之來回行程延時可 視訊務被如何路由及路線上是否存在任何故障(且此等問 題在下文加以論述)而極大地改變,但通常通用網際網路 提供相當最佳的路由且延時很大程度上係由光穿過光纖之 速度(給定至目的地之距離)來判定^如下文進一步論述, 已確疋1000英里作為期望將主機代管服務21〇遠離使用者 © 場所211置放的大致最遠距離。在1000英里處(來回行程 2000英里)’用於信號經由網際網路之實際傳輸時間為約 22毫秒。至主機代管服務21〇之WAN介面444通常為具有可 忽略之延時的商業級光纖高速介面。因此,通用網際網路 延時454通常係在1毫秒與10毫秒之間。經由主機代管服務 210之單向路由455延時可在小於丨毫秒内達成。伺服器4〇2 通常將在小於一圖框時間(其在60 fps下為167毫秒)之時間 中计算用於遊戲或應用程式之新圖框,因此16毫秒為將使 用的合理的最大單向延時456。在本文中所描述之視訊壓 縮及音訊壓縮演算法之最佳硬體實施中,塵縮4 5 7可在1毫 秒内完成。在次佳版本中,壓縮可花費多達6毫秒(當然, 更欠佳之版本可花費更長時間,但該等實施將影響來回行 程之總延時且將需要其他延時較短(例如,可減小經由通 用網際網路之可允許的距離)以維持7〇毫秒_8〇毫秒延時目 標)。已經考慮網際網路454、使用者ISP 453及使用者場所 路由452之來回行程延時,因此剩餘的為視訊解壓縮458延 136720.doc • 64- 200941233 時’視訊解壓縮458延時取決於視訊解壓縮458是實施於專 用硬體中還是實施於用戶端器件415(諸如,Pc或行動器 件)上之軟體中’可視顯示器之大小及解壓縮CPU之效能而 改變。通常’解壓縮458花費1毫秒與8毫秒之間的時間。 因此,可藉由將在實踐中所見的所有最糟狀況之延時加 在一起來判定圖4a中所展示之系統之使用者可預期將經歷的 最糟狀況之來回行程延時。其為:1 + 1+25+22+1 + 16+6+8=8() 毫秒。此外,實際上,在實踐中(具有下文所論述的防止 ® 誤解之說明),此大致為使用圖4a中所展示之系統之原型 版本(在美國使用現成的Windows PC作為用戶端器件及家 庭DSL及電纜數據機連接)所見的來回行程延時。當然,優 於最糟狀況之情況可導致短得多的延時,但不可依賴其來 開發廣泛使用之商業服務。 為了經由通用網際網路達成圖4b中所列出之延時,需要 用戶端415中之視訊壓縮器404及視訊解壓縮器412(來自圖 4a)產生具有非常特定的特性之封包流,以使得經由自主 機代管服務210至顯示器件422之整個路徑所產生的封包序 列不經受延遲或過多封包丟失’且詳言之,始終如一地落 在經由使用者之網際網路連接(經由WAN介面442及防火牆/ 路由器/NAT 43 3)而可用於使用者的頻寬之約束内。另 外’視訊壓縮器必須產生足夠強健之封包流,以使得其可 谷忍在正常網際網路及網路傳輸中出現的不可避免的封包 丟失及封包重排序。 低延時視訊歷縮 136720.doc •65- 200941233 為了完成上述目標,一實施例採用新的視訊壓縮方法, 該方法降低用於傳輸視訊之延時及峰值頻寬要求。在描述 此等實施例之前,將關於圖5及圖6a至圖6b提供對當前視 訊壓縮技術之分析。當然,若使用者具備足以處理此等技 術所需之資料速率的頻寬,則此等技術可根據基本原理來 使用。注意,本文中不解決音訊壓縮,而是陳述音訊壓縮 係與視訊壓縮同時且同步地來實施。滿足用於此系統之要 求的先前技術音訊壓縮技術存在。 圖5說明用於壓縮視訊之一特定先前技術,其中由壓縮 邏輯520使用特定壓縮演算法來壓縮每一個別視訊圖框 501-503以產生一系列經壓縮之圖框511_513。此技術之一 實施例係「運動JPEG」’其中根據聯合圖像專家群(jpEG) 壓縮演算法基於離散餘弦變換(DCT)來壓縮每一圖框。可 使用各種不同類型之壓縮演算法,然而,仍遵守此等基本 原理(例如’以小波為基礎之壓縮演算法,諸如JpEG_ 2000) 〇 此類型壓縮之一問題在於:其減小了每一圖框之資料速 率’但其不利用相繼圖框之間的類似性來減小總視訊流之 資料速率。舉例而言’如圖5中所說明,假定64〇x48〇x24 位元/像素=64〇*480*24/8/1024=900千位元組/圖框(KB/圖 框)之圖框速率,則對於給定品質之影像,運動JPEG可能 僅將該流壓縮1/10,從而產生9〇 KB/圖框之資料流。在6〇 圖框/秒下’此將需要90 KB*8位元*60圖框/秒=42.2 Mbps 之頻道頻寬,其對於美國現今幾乎所有的家庭網際網路連 136720.doc •66· 200941233 接而s將為極高之頻寬,且對於許多辦公室網際網路連接 而言為過高之頻寬。實際上,假定其在此種高頻寬之情況 下要求恆定資料流,且其將僅伺服一使用者,則即使在辦 公室LAN環境中,其亦將消耗1〇〇 Mbps6太網路LAN之頻 寬的大百分比及支援LAN之負擔沉重的乙太網路交換器。 因此,當與其他壓縮技術(諸如下文所描述之彼等技術)相 比較時,用於運動視訊之壓縮無效率。此外,使用有損壓 縮演算法之單一圖框壓縮演算法(如JpEG& JpEG_2〇〇〇)產 © 纟在靜止影像中可能不引人注意的壓縮假影(例如,場景 中之密集樹葉内之假影可能不呈現為假影,因為眼並不確 切地知道密集樹葉應如何呈現)。但是’一旦場景係在運 動中,假影就可能突出,因為眼谓測到自圖框至圖框而改 變之假影,儘管假影係在場景之區域(在該區域中,假影 在靜止影像中可能不引人注意)中。此導致圖框序列中之 「背景雜訊」之感知,胃「背景雜訊」之外觀與邊緣類比 TV接收期間可見的「雪」雜訊類似。當然,此類型之壓 縮仍可用於本文中所描述之特定實施例中,但一般而言, 為了避免場景中之背景雜訊,對於給定感知品質,需要高 資料速率(亦即,低壓縮比率)。 其他類型之壓縮(諸如,H.264,或Windows媒體VC9、 MPEG2及MPEG4)在壓縮視訊流中均更有效,因為其利用 相繼圖框之間的類似性。此等技術均依賴於用於壓縮視訊 之相同的一般技術。因此,儘管將描述Η.]"標準,但相 同的一般原理適用於各種其他壓縮演算法。大量H 264壓 136720.doc •67· 200941233 縮器及解壓縮器可用,包括用於壓縮Η.264之χ264開放源 軟體庫及用於解壓縮H.264之FFmpeg開放源軟體庫。 圖6a及圖6b說明例示性先前技術壓縮技術,其中由麼縮 邏輯620將一系列未經壓縮之視訊圖框501-503、559-561壓 縮成一系列「I圖框」611、671 ;「P圖框」612-613 ;及 「B圖框」670。圖6a中之垂直軸大體表示經編碼之圖框中 之每一者的所得大小(儘管該等圖框未按比例進行緣製)。 如上所述’熟習此項技術者良好地理解使用I圖框、B圖框 〇 及P圖框之視訊寫碼。簡言之,I圖框611為完全未壓縮之 圖框501的以DCT為基礎之壓縮(類似於如上所述的經壓縮 之JPEG影像)。P圖框612-613之大小通常顯著小於I圖框 611之大小’因為其利用先前I圖框或p圖框中之資料;亦 即’其含有指示先前I圖框或P圖框之間的改變的資料。除 B圖框使用隨後參考圖框中的圖框以及(可能地)之前參考 圖框中的圖框之外,B圖框670類似於p圖框。 對於以下論述’將假定所要之圖框速率為6〇圖框/秒, ® 每一 I圖框為約160 Kb,平均P圖框及B圖框為16 Kb且每隔 一秒產生一新的I圖框。在此組參數下,平均資料速率將 為:160 Kb+16 Kb* 59 = 1.1 Mbps。此資料速率適當地落在 用於至家庭及辦公室之許多當前寬頻帶網際網路連接之最 大資料速率内。此技術亦傾向於避免來自僅框内編碼之背 景雜訊問題’因為P圖框及B圖框追蹤圖框之間的差異,因 此壓縮假影傾向於不自圖框至圖框而呈現及消失,藉此減 少上文所描述之背景雜訊問題。 136720.doc -68 - 200941233 上述類型之壓縮之一問題在於:儘管平均資料速率相對 低(例如,1.1 Mbps),但單一 I圖框可能花費若干個圖框時 間來傳輸。舉例而言,使用先前技術,2.2 Mbps網路連接 (例如,DSL或電纜數據機,其具有來自圖3a的最大可用資 料速率302之2.2 Mbps峰值)通常將足夠使視訊以1.1 Mbps 串流’每60個圖框一 160 Kbps I圖框。此將藉由使解壓縮 器在解壓縮視訊之前將1秒視訊排入佇列來完成,在1秒 内’將傳輸1.1 Mb之資料,其將藉由2.2 Mbps最大可用資 〇 料速率來容易地適應,即使假定可用資料速率可能週期性 地下降多達50%亦如此。遺憾地’此先前技術方法將由於 接收器處之1秒視訊緩衝而導致視訊之1秒延時。此種延遲 對於許多先前技術應用程式(例如,線性視訊之回放)而言 足夠’但對於不可容忍大於70毫秒_8〇毫秒之延時的快動 作視訊遊戲而言其為極長之延時。 若進行嘗試來消除1秒視訊緩衝,其仍將不會導致用於 快動作視訊遊戲之足夠延時減少。舉例而言,如先前所描 述’ B圖框之使用將需要接收I圖框之前的所有b圖框以 圖框。若假定在P圖框與B圖框之間大致分裂59個非I圖 框,則將存在至少29個B圖框且可顯示任何B圖框之前所 接收的I圖框。因此’不管頻道之可用頻寬如何,均需要 29 +1-30個圖框每一者"60秒持續時間之延遲,或5〇〇毫秒 之延時。顯而易見,彼時間極長。 因此’另一方法將為消除B圖框且僅使用I圖框及p圖 框。(此之一後果為:對於給定品質位準,資料速率將增 136720.doc -69- 200941233 加,但出於此實例十之一致性起見’繼續假定每一j圖框 之大小為160 Kb且平均P圖框之大小為16 Kb,且因此資料 速率仍為1 · 1 Mbps)。此方法消除了由B圖框引入的不可避 免之延時,因為每一P圖框之解碼僅依賴於先前所接收之 圖框。此方法仍存在的問題在於:丨圖框比平均p圖框大得 多,以致在低頻寬頻道上(如大多數家庭中及許多辦公室 中典型的),I圖框之傳輸添加實質延時。此在圖讣中加以 說明。視訊流資料速率624低於可用最大資料速率621 (除 Ο 對於1圖框之外),其中I圖框所需之峰值資料速率623遠超 過可用最大資料速率622(且甚至超過額定最大資料速率 621) 圖框所需之資料速率小於可用最大資料速率。即 使在2.2 Mbps之可用最大資料速率峰值穩定地保持在其2 2 Mbps峰值速率’亦將花費16〇 Kb/22 Mb=71毫秒來傳輸I 圖框’且若可用最大資料速率622下降50%(l.l Mbps),則 將lb費142毫秒來傳輸I圖框。因此,傳輸I圖框中之延時將 ©落在71毫秒與142毫秒之間的某處。此延時添加至圖仆中 所識別之延時(該等延時在最糟狀況下總計達7〇毫秒),因 此’此將導致自使用者致動輸入器件421之時刻直至影像 呈現於顯示器件422上的為141-222毫秒之總來回行程延 時’其極高。且若可用最大資料速率下降至低於2.2 Mbps,則延時將進一步增加。 亦注意’以遠超過可用資料速率622之峰值資料速率623 使1SP「堵塞J通常存在嚴重後果。不同ISP中之設備將不 同地表現,但當以比可用資料速率622高得多的資料速率 136720.doc •70- 200941233 並,、匕時以下行為在DSL及電纜數據機ISP當中相當 s遍.(a)藉由將封包排入仔列而使封包延遲(引入延時), W丢棄-些或所有封包,⑷停用連接歷時—時間週期(最 可此因為ISP擔憂其為惡意攻擊,諸如「否認服務」攻 擊)。因此,以全資料速率傳輸封包流(具有諸如圖⑪中所 展不之彼等特性的特性)並非為可行的選項。可在主機代 管服務2H)處將峰值623排人㈣且以低於可用最大資料速 ❹ 率之資料速率進行發送,從Μ人前—段中所描述的不可 接受之延時。 另外’圖6b中所展示之視訊流f料速率序列_為非常 「馴服的(tame)」視訊流資料速率序列,且將係由於壓縮 來自視訊序列之視訊而預期產纟的該種資料速率序列,該 視訊序列並不改變很大且具有非常少之運動(例如,如在 視訊電話會議中將係普遍的’在視訊電話By shrinking, it is packetized by a single address to send it back to the user's client 415 and routed to the WAN interface 444, which then routes the video and audio packets over the universal Internet 410. The universal Internet 410 then routes the video and audio packets to the Isp presence point 441 of the user. The presence point 441 routes the video and audio packets to the WAN interface 442 at the user premises, and the WAN interface 442 routes the video and audio packets. To firewall/router/NAT device 443, firewall/router/NAT device 443 then routes the video and audio packets to client 415. The client 415 demultiplexes the video and audio, and then displays the video on the display device 422 (or the built-in display device of the user terminal) and sends the audio to the display device 422 or to a separate amplifier/speaker or to the user terminal. In the amplifier / speaker. After you don't stagnate, the back and forth delay needs less than 7〇 milliseconds or 8〇 milliseconds. Some of the delay delays described in the return path are controlled by the colocation service 21 and/or the user, while other delay delays are not subject to the colocation service η. And / or user control. Nonetheless, based on the analysis and testing of a large number of real-world situations, the following are approximate measurements. The one-way transmission time 451 of the knife control signal is usually small through the user's place, ΛΑ J· ^ ^ 逋 often uses the easy-to-use firewall/router/NAT switch of the Ethernet network. 】 136720.doc •63- 200941233 completed in seconds. The user ISP extensively changes its round trip delay 453, but in the case of DSL and cable modem providers, it is typically seen between 1 and 25 milliseconds. The back-and-forth delay of the Universal Internet 41 is how the routing is routed and whether there are any faults on the route (and these issues are discussed below), but the general Internet is usually quite optimal. Routing and delay are largely determined by the speed at which light passes through the fiber (distance given to the destination). As discussed further below, 1000 miles have been determined as a desire to host the service 21 away from the user© The approximate farthest distance at which the location 211 is placed. At 1000 miles (2,000 miles back and forth), the actual transmission time for signals via the Internet is approximately 22 milliseconds. The WAN interface 444 to the colocation service 21 is typically a commercial grade fiber optic high speed interface with negligible latency. Therefore, the universal internet latency 454 is typically between 1 millisecond and 10 milliseconds. The one-way routing 455 delay via the colocation service 210 can be achieved in less than one millisecond. Server 4〇2 will typically calculate a new frame for the game or application at less than one frame time (which is 167 milliseconds at 60 fps), so 16 milliseconds is the reasonable maximum one to be used. Delay 456. In the best hardware implementation of the video compression and audio compression algorithms described herein, the dust shrinkage can be completed in less than 1 millisecond. In the next best version, compression can take up to 6 milliseconds (of course, a less desirable version can take longer, but these implementations will affect the total latency of the round trip and will require other delays to be shorter (eg, subtractable) Small via the allowable distance of the universal Internet) to maintain a 7 〇 _ 8 〇 millisecond delay target). The round trip delay of Internet 454, user ISP 453 and user location route 452 has been considered, so the rest is video decompression 458 extension 136720.doc • 64-200941233 'Video decompression 458 delay depends on video decompression 458 is implemented in a dedicated hardware or in a software implemented on a client device 415 (such as a Pc or mobile device), the size of the visual display and the performance of the decompressing CPU. Usually 'decompressing 458 takes a time between 1 millisecond and 8 milliseconds. Thus, the worst-case back-and-forth delay that the user of the system shown in Figure 4a can expect to experience can be determined by adding together all the worst-case delays seen in practice. It is: 1 + 1+25+22+1 + 16+6+8=8() milliseconds. In addition, in practice, in practice (with the explanation of Prevention® misunderstandings discussed below), this is roughly the prototype version of the system shown in Figure 4a (using an off-the-shelf Windows PC as a client device and home DSL in the United States) And the cable data machine connection) see the back and forth travel delay. Of course, situations that are better than the worst can lead to much shorter delays, but you can't rely on them to develop widely used business services. In order to achieve the delays listed in Figure 4b via the universal internet, the video compressor 404 and the video decompressor 412 (from Figure 4a) in the client 415 are required to generate a packet stream having very specific characteristics such that The sequence of packets generated from the entire path of the colocation service 210 to the display device 422 is not subject to delay or excessive packet loss' and, in detail, is consistently connected via the user's Internet connection (via the WAN interface 442 and Firewall / Router / NAT 43 3) can be used within the constraints of the user's bandwidth. In addition, the video compressor must generate a sufficiently robust packet stream so that it can withstand the inevitable packet loss and packet reordering that occurs in normal Internet and network transmissions. Low-latency videoconferencing 136720.doc •65- 200941233 To accomplish the above objectives, an embodiment employs a new video compression method that reduces the latency and peak bandwidth requirements for video transmission. Prior to describing such embodiments, an analysis of current video compression techniques will be provided with respect to Figures 5 and 6a through 6b. Of course, if the user has sufficient bandwidth to handle the data rate required by such techniques, then such techniques can be used in accordance with the underlying principles. Note that this does not address audio compression, but rather states that audio compression is implemented concurrently and synchronously with video compression. Prior art audio compression techniques that meet the requirements for this system exist. Figure 5 illustrates a particular prior art for compressing video in which each individual video frame 501-503 is compressed by compression logic 520 using a particular compression algorithm to produce a series of compressed frames 511-513. One embodiment of this technique is "Motion JPEG" where each frame is compressed based on a discrete cosine transform (DCT) according to the Joint Image Experts Group (jpEG) compression algorithm. Various different types of compression algorithms can be used, however, these basic principles are still adhered to (eg 'wavelet-based compression algorithms such as JpEG_2000). One of the problems with this type of compression is that it reduces each figure The data rate of the box 'but it does not take advantage of the similarity between successive frames to reduce the data rate of the total video stream. For example, as illustrated in Figure 5, assume a frame of 64〇x48〇x24 bits/pixel=64〇*480*24/8/1024=900 kilobytes/frame (KB/frame) Rate, then for a given quality image, Motion JPEG may only compress the stream by 1/10, resulting in a 9 〇 KB/frame data stream. In 6 frames/sec, 'this will require 90 KB*8 bits*60 frames/sec = 42.2 Mbps channel bandwidth, which is available for almost all home Internet connections in the United States today 136720.doc •66· 200941233 will eventually be extremely high bandwidth and too high bandwidth for many office internet connections. In fact, assuming that it requires a constant data stream in such a high bandwidth, and it will only serve one user, it will consume 1 Mbps 6 too wide LAN LAN bandwidth even in an office LAN environment. A large percentage and a heavy Ethernet switch that supports the LAN. Therefore, compression for motion video is inefficient when compared to other compression techniques, such as those described below. In addition, a single frame compression algorithm (such as JpEG& JpEG_2〇〇〇) using a lossy compression algorithm produces © 压缩 a compression artifact that may be unobtrusive in still images (for example, in dense foliage in a scene) False shadows may not appear as artifacts because the eye does not know exactly how dense leaves should be rendered). But 'when the scene is in motion, the artifacts may stand out because the eye is the artifact that changes from the frame to the frame, even though the artifact is in the area of the scene (in this area, the artifact is still The image may not be noticeable). This results in the perception of "background noise" in the sequence of frames, and the appearance of the "background noise" of the stomach is similar to the "snow" noise seen during TV reception. Of course, this type of compression can still be used in the specific embodiments described herein, but in general, in order to avoid background noise in the scene, a high data rate (ie, a low compression ratio) is required for a given perceived quality. ). Other types of compression (such as H.264, or Windows Media VC9, MPEG2, and MPEG4) are more efficient in compressing video streams because they exploit the similarities between successive frames. These techniques all rely on the same general techniques for compressing video. Therefore, although the Η.]" standard will be described, the same general principles apply to various other compression algorithms. A large number of H 264 pressures 136720.doc •67· 200941233 Reducers and decompressors are available, including the χ264 open source software library for compression 264.264 and the FFmpeg open source software library for decompressing H.264. 6a and 6b illustrate an exemplary prior art compression technique in which a series of uncompressed video frames 501-503, 559-561 are compressed by a compression logic 620 into a series of "I frames" 611, 671; Frames 612-613; and "B-frames" 670. The vertical axis in Figure 6a generally represents the resulting size of each of the encoded frames (although the frames are not scaled). As described above, those skilled in the art have a good understanding of the video writing code using the I frame, the B frame, and the P frame. Briefly, block I 611 is a DCT-based compression of frame 501 that is completely uncompressed (similar to a compressed JPEG image as described above). The size of P-frames 612-613 is typically significantly smaller than the size of I-frame 611 'because it utilizes data from previous I-frames or p-frames; that is, 'which contains an indication between the previous I-frame or P-frame Changed information. The B-frame 670 is similar to the p-frame except that the B-frame uses the frame of the subsequent reference frame and (possibly) the frame of the previous reference frame. For the following discussion, it will be assumed that the desired frame rate is 6 frames/sec, ® each I frame is about 160 Kb, the average P frame and B frame are 16 Kb and a new one every second. I frame. Under this set of parameters, the average data rate will be: 160 Kb + 16 Kb * 59 = 1.1 Mbps. This data rate falls appropriately within the maximum data rate for many current broadband Internet connections to homes and offices. This technique also tends to avoid background noise problems from intra-frame coding only. Because the difference between the P-frame and the B-frame tracking frame, the compression artifact tends to appear and disappear from the frame to the frame. To reduce the background noise problem described above. 136720.doc -68 - 200941233 One of the problems with compression of the above type is that although the average data rate is relatively low (for example, 1.1 Mbps), a single I frame may take several frame times to transmit. For example, using prior art, a 2.2 Mbps network connection (eg, a DSL or cable modem with a 2.2 Mbps peak from the maximum available data rate 302 of Figure 3a) would typically be sufficient to stream video at 1.1 Mbps 'per 60 frames a 160 Kbps I frame. This will be done by having the decompressor put a 1 second video into the queue before decompressing the video, and will transmit 1.1 Mb of data in 1 second, which will be easily tuned by the 2.2 Mbps maximum available data rate. Adaptation, even if it is assumed that the available data rate may periodically drop by as much as 50%. Unfortunately, this prior art method would result in a 1 second delay in video due to the 1 second video buffer at the receiver. This delay is sufficient for many prior art applications (e.g., playback of linear video), but it is an extremely long delay for fast motion video games that cannot tolerate delays greater than 70 milliseconds _8 milliseconds. If an attempt is made to eliminate the 1 second video buffer, it will still not result in a sufficient delay reduction for fast motion video games. For example, the use of the 'B frame' as previously described would require receiving all of the b-frames before the I-frame. If it is assumed that approximately 59 non-I frames are split between the P frame and the B frame, there will be at least 29 B frames and the I frame received before any B frames can be displayed. Therefore, regardless of the available bandwidth of the channel, each of the 29 +1-30 frames is required to have a delay of 60 seconds duration or a delay of 5 milliseconds. Obviously, his time is extremely long. Therefore, another method would be to eliminate the B frame and only use the I frame and the p frame. (One of the consequences is that for a given quality level, the data rate will increase by 136720.doc -69- 200941233 plus, but for the consistency of this example ten, 'continue to assume that the size of each j frame is 160 Kb and the average P frame size is 16 Kb, and therefore the data rate is still 1 · 1 Mbps). This method eliminates the unavoidable delay introduced by the B-frame because the decoding of each P-frame depends only on the previously received frame. The problem with this approach is that the frame is much larger than the average p-frame, so that on low-frequency wide channels (as is typical in most homes and many offices), the transmission of I-frames adds substantial latency. This is illustrated in the figure. The video stream data rate 624 is lower than the available maximum data rate 621 (except for the 1 frame), where the peak data rate 623 required for the I frame is well above the maximum available data rate 622 (and even exceeds the nominal maximum data rate 621). The data rate required for the frame is less than the maximum data rate available. Even if the maximum available data rate peak at 2.2 Mbps is steadily maintained at its 2 2 Mbps peak rate', it will cost 16 〇 Kb / 22 Mb = 71 milliseconds to transmit the I frame' and if the available maximum data rate 622 drops by 50% ( Ll Mbps), the lb will be 142 milliseconds to transmit the I frame. Therefore, the delay in the transmission I frame will fall somewhere between 71 milliseconds and 142 milliseconds. This delay is added to the delay identified in the servant (the delays are up to 7 〇 milliseconds in the worst case), so this will result from the moment the user actuates the input device 421 until the image is presented on the display device 422. The total round trip delay of 141-222 milliseconds is extremely high. And if the maximum available data rate drops below 2.2 Mbps, the delay will increase further. It is also noted that 'the peak data rate 623 far exceeds the available data rate 622. The 1SP "blocking J usually has serious consequences. Devices in different ISPs will behave differently, but at a data rate 136720 that is much higher than the available data rate 622. Doc •70- 200941233 And, the following behaviors are quite s in the DSL and cable modem ISP. (a) Delay the packet by introducing the packet into the queue (introduction delay), W discard some or All packets, (4) deactivate the connection duration - time period (most likely because the ISP is concerned about malicious attacks, such as "denial of service" attacks). Therefore, transmitting packet streams at full data rate (having characteristics such as those not shown in Figure 11) is not a viable option. The peak 623 can be queued (4) at the host-hosted service 2H) and sent at a data rate lower than the maximum data rate available, from the unacceptable delay described in the previous paragraph. In addition, the video stream rate sequence shown in Figure 6b is a very "tame" video stream data rate sequence, and will be the data rate sequence expected to be born due to compression of video from the video sequence. The video sequence does not change very much and has very little motion (for example, as in a video conference call will be common in video calls)
於固定位置中且具有非常少之運動,且場景(例如= 的人談話)中之物件展示較少運動)。 圖6c中所展示之視訊流資料速率序列634為自具有多得 多的動作之視訊(諸如,可能在電影或視訊遊戲中或在某 一應用程式軟體中產生)預期可見的典型序列。注意,除工 圖框峰值633之外,亦存在相當大且在許多場合上超過可 用最大資料速率之P圖框峰值(諸如,635及636)。儘管此 等P圖框峰值並不如I圖框峰值一般相當大,作其仍極大、 致不能由頻道以全資料速率來載運,且如同1圖樞峰值一 樣’ P圖框峰值必須緩慢地傳輸(藉此增加延時)。 I36720.doc -71- 200941233 〇 ❹ 在-高頻寬頻道(例如’ 100MbpsLAN,或高頻寬ι〇〇 用連接)上,網路將能夠容忍諸如I圖框峰值633或ρ 圖框峰值636之大峰值,但原則上,可維持低延時。但 $,該等網路經常在許多使用者當中共用(例如,在辦公 室環境中),且該「有峰」冑料將影響LAN之效能,尤其 在網路訊務經路由至私用共用連接(例如,自遠端資财 心至辦公室)之情況下n,記住此實例係60 fpS下 640x480像素的相對低解析度的視訊流的實例。6〇 fps下之 xum)的HDTV流容易由現代電腦及顯示器來處理,且 60 fps下之2560x1440解析度顯示器日益可用(例如,a卯& 公司之30"顯示器)。使用H 264壓縮,6〇扣下之 1920x1080之高動作視訊序列可能需要4 5 Mbps以獲得合 理品質位準。若假定I圖框峰值為標稱資料速率之1〇倍, 則其將產生45 Mbps峰值,以及較小但仍相當大的p圖框峰 值。若若干個使用者正在同一 1〇〇 Mbps網路(例如,辦公 室與資料中心之間的私用網路連接)上接收視訊流,則容 易看見來自若干使用者之視訊流之峰值可如何碰巧對準, 從而淹沒網路之頻寬,且可能淹沒網路上支援使用者之交 換器的底板之頻寬。即使在超高速乙太網路之狀況下,若 足夠的使用者具有同時對準的足夠峰值,則其可淹沒網路 或網路父換器。此外,一旦256〇χ144〇解析度視訊變得更 常見,平均視訊流資料速率就可能為9.5 Mbps,從而或許 產生95 Mbps峰值資料速率。不用說,資料中心與辦公室 之間的100 Mbps連接(其在現今為格外快之連接)將完全被 I36720.doc -72- 200941233 來自單一使用者乏峰值訊務擊潰。因此,即使LAN及私用 網路連接對有峰串流視訊可具有更高容忍度,具有高峰值 之串流視訊亦係不需要的且可能需要辦公室之汀部門之特 殊計劃及適應。 當然,對於標·準線性視訊應用程式,此等問題並非問 題,因為資料速率在傳輸點「經平滑化」且用於每一圖框 之資料低於最大可用資料速率622,且在解壓縮〗圖框、p 圖框及B圖框序列之前’用戶端中之緩衝器儲存I圖框、P © 目框及B圖框序列。因此,網路上之資料速率保持接近於 視訊流之平均資料速率。遺憾地,此引入延時,即使不使 用B圓框’對於諸如需要快回應時間之視訊遊戲及應用程 式的低延時應用程式而言,彼亦係不可接受的。 用於減輕具有高峰值之視訊流的一先前技術解決方法係 使用常常被稱作「怪定位元速率」(CBR)編碼之技術。儘 管術語CBR看來似乎暗示將所有圖框壓縮以具有相同位元 速率(亦即,大小)’但其經常提及的為壓縮範例,在壓縮 範例中,允許跨越特定數目之圖框(在吾人之狀況下,1個 圖框)的最大位元速率。舉例而言,在圖“之狀況下,若 對編碼施加CBR約束(其將位元速率限於(例如)額定最大資 料速率621之7〇%),則壓縮演算法將限制該等圖框中之每 一者的麼縮,以使得通常將使用額定最大資料速率621之 70%以上來麼縮的任何圖框將以較少位元來壓縮。此之結 果為.將使通常將需要更多位元來維持給定品質位準之圖 框「極度缺乏」位元且彼等圖框之影像品質將比不需要比 136720.doc -73. 200941233 額定最大資料速率621之7()%多的位元的其他圖框之 品質糟。此方法對於特定類型的經壓縮視訊(其中⑷預 較少運動或場景改變且⑻使用者可接受週期性的品質降 級)可產生可接党的結果。適合CBR之應用的良好實例為 視π電話會6義’因為存在較少峰值,且在品質暫時降級: 情況下(例如,若使相機掃視,從而導致顯著場景運動及 大峰值,則在掃視期間可能不存在足夠的位元用於高品質 影像壓縮,其將導致降級的影像品質),大多數使用者可 ©接受。遺憾地,CBR並非良好地適合具有高複雜度之場景 或大量運動及/或需要合理恆定之品質位準的許多其他應 用。 在一實施例中所使用之低延時壓縮邏輯4〇4使用若干不 同技術來解決串流低延時經壓縮視訊同時維持高品質之許 多問題。首先,低延時壓縮邏輯4〇4僅產生j圖框及p圖 框,藉此緩解等待若干個圖框時間來解碼每一 B圖框的需 要。另外,如圖7&中所說明,在一實施例中,低延時壓縮 邏輯404將每一未經壓縮之圖框7〇1_76〇再分成一系列「影 像塊(tile)」且將每一影像塊個別地編碼為】圖框或p圖框。 在本文中將該群經壓縮之I圖框及p圖框稱作「r圖框」 711-770。在圖7a中所展示之特定實例中,將每一未經壓 縮之圖框再分成4M矩陣的16個影像塊。然而,此等基本 原理不限於任何特定再分機制。 在一實施例中’低延時壓縮邏輯4〇4將視訊圖框劃分成 許多景々像塊,且將來自每一圖框之一影像塊編碼(亦即, 136720.doc •74· 200941233 壓縮)為i圖框(亦即,將該影像塊壓縮,好像其為全影像之 大小之1/16的單獨視訊圖框,且用於此「迷你型」圖框之 壓縮為I圖框壓縮)並將剩餘影像塊編碼為?圖框(亦即,用 於每一「迷你型」1/16圖框之壓縮為p圖框壓縮)。經壓縮 為I圖框之影像塊及經壓縮為p圖框之影像塊將分別被稱作 「I影像塊」及「P影像塊」。隨著每一相繼視訊圖框而改 變待編碼為丨影像塊之影像塊。因此,在給定圖框時間 中,視訊圖框中之該等影像塊中僅一影像塊為工影像塊, © 且該等影像塊中之剩餘者為p影像塊。舉例而言,在圖h 中,未經壓縮之圖框701之影像塊〇經編碼為〗影像塊1〇且剩 餘的1-15影像塊經編碼為p影像塊(Ρι至p〗5)以產生R圖框 711。在下一個未經壓縮之視訊圖框7〇2中,未經壓縮之圖 框7 01之影像塊丨經編碼為】影像塊丨丨且剩餘的影像塊〇及2至 15經編碼為p影像塊(p〇,及匕至卜5)以產生r圖框712。因 此用於影像塊之1影像塊及P影像塊在相繼圖框上逐漸地 在時間上交錯。該過程繼續,直至產生R影像塊770(矩陣 中最末影像塊經編碼為I影像塊(亦即,為止。該過程 接著重新開始,從而產生諸如圖框711(亦即,對於影像塊 〇,編碼I影像塊)等之另一 R圖框。儘管圖乃中未說明,但 在實施例中,R圖框之視訊序列之第一 R圖框僅含有 像塊(亦即,以使得隨後之p圖框具有參考影像資料(自其 開始汁算運動。或者,在一實施例中啟動序列使用與 正常相同的I影像塊型樣,但不包括用於尚未連同〗影像塊 起編碼之彼等影像塊的p影像塊。換言之,在第一丨影像 136720.doc -75- 200941233 塊到達之前不連同任何資料一起編碼特定影像塊,藉此避 免圖9a中的視訊流資料速率934中之啟動峰值,其在下文 進一步詳細說明。此外,如下所述,各種不同大小及形狀 可用於該等影像塊同時仍遵守此等基本原理。 在用戶端41 5上執行之視訊解壓縮邏輯412解壓縮每一影 像塊’好像其為小I圖框及P圖框之單獨視訊序列,且接著 將每一影像塊再現給驅動顯示器件422之圖框緩衝器。舉 例而言,使用來自R圖框711至770之10及P〇來解壓縮並再現 © 視訊影像之影像塊〇。類似地,使用來自R圖框7丨丨至77〇之 Ιι及Pi來重建影像塊1 ’專等。如上所述,I圖框及p圖框之 解壓縮係此項技術中眾所熟知的,且I影像塊及p影像塊之 解壓縮可藉由使視訊解壓縮器之多個執行個體在用戶端 415上執行來元成。儘管倍增過程看來似乎增加用戶端us 上之計算負擔,但實際上其不會增加用戶端415上之計算 負擔,因為影像塊本身成比例地較小(相對於額外處理之 數目而§)’因此所顯示之像素之數目相同,好像存在一 ^ 個處理且使用習知的全大小之I圖框及P圖框。 此R圖框技術顯著減輕通常與I圖框相關聯之頻寬峰值 (圖6b及圖6c中所說明),因為任何給定圖框主要係由通常 比I圖框小之P圖框構成。舉例而言,再次假定典型〖圖框 為160 Kb,則圖7a中所說明之圖框中之每一者的j影像塊 將為此量之大致1/1 6或10 Kb。類似地,假定典型p圖框為 16 Kb,則用於圖7a中所說明之影像塊中之每一者的p圖框 可為大致1 Kb。最終結果為約10 Kb+15J|51 Kb=25 Kb《R圖 136720.doc .76· 200941233 框。因此,每一 60圖框序列將係25 Kb*60 = 1.5 Mbps。因 此,在60圖框/秒下,此將需要能夠維持1.5 Mbps之頻寬的 頻道,但由於I影像塊係貫穿6〇圖框間隔而分散而使得具 有低得多的峰值。 注意’在先前實例中,在用於!圖框及p圖框之相同假定 資料速率情況下,平均資料速率為丨]Mbps。此係因為在 先前實例中’每隔60個圖框時間僅引入一新1圖框,而在 〇 此實例中’構幻圖框之16個影像塊在16個圖框時間中循 環,且因此’每隔16個圖框時間弓1入一!圖框之均等物, 從而導致稍高之平均資料速率。儘管如此,但在實踐中, 引入更頻繁之I®框並不會線性地增加f料速率^此係由 於以下事實:p圖框(或P影像塊)主要編碼自先前圖框至下 一個圖框之差異。因此1先前圖框與下—個圖框相當類 似,則P圖框將非常小,若先前圖框與下一個圖框相當不 同’則p圖框將非常大。但因為p圖框很大程度上係自先前 ❹ 圖框導出,而非自實際圖框導出,所以所得的經編碼圖框 可:含有比具有足夠數目之位元之I圖框多的錯誤(例如, 視覺假影)。此外,當一 p圖框跟隨另—P圖框時,可出現 錯誤累加(當存在長p圖框序列時,變得更糟)。現在,尖 端的視訊壓縮器將偵測到影傻 降㈣宣# 質在一序列P圖框之後 =事實’且必要時,其將更多位元分配給隨後之P圖 框以提兩品質,或若其為最有 ^ p . 之動作過程’則用I圖框 替換P圖框。因此,當使用長 框,如上文先前實例中)時,特定一序列(例如,59侧 特疋S之當場景具有大量複 136720.doc -77- 200941233 雜度及/或運動時,通常,對於p圖框而言需要更多位元(因 為其變得距I圖框更遠)。 或者,自相對檢視點看P圖框,緊密地跟隨丨圖框之p圖 框傾向於需要比距〗圖框更遠之p圖框少的位元。因此,在 圖7a中所展示之實例中,無p圖框比距〗圖框隔開15個圖框 更遠(在I圖框之前)’而在先前實例申,ρ圖框可為自】圖框 隔開59個圖框。因此,在更頻繁之j圖框情況下,ρ圖框較 小。當然’確切相對大小將基於視訊流之性質而改變但 © 在圖乃之實例中,若I影像塊為10 Kb,貝JP影像塊之大小平 均可為僅0.75 kb,從而導致10 Kb+15*0.75 Kb=21.25 Kb, 或在60圖框/秒下’資料速率將為21 a KbMOMj Mbps, 或比1·1 Mbps下的具有一 ϊ圖框繼之以59個p圖框之流之資 料速率高約16% ^再一次,用於視訊壓縮之此等兩種方法 之間的相對結果將視視訊序列而改變,但通常,吾人憑經 驗發現,對於給定品質位準,使用R圖框比使用I/p圖框序 歹’J需要多約20%之位元。但是’當然,R圖框急劇地減少 峰值,此使視訊序列在遠小於j/ρ圖框序列之延時下可用。 可視視訊序列之性質、頻道之可靠性及可用資料速率而 以多種不同方式來組態R圖框。在替代實施例中,在4><4組 態中使用不同於16之數目之影像塊。舉例而言,可在2χΐ 或1x2組態中使用2個影像塊,可在2x2、4><1或1><4組態令 使用4個影像塊,可在3x2、2x3、6xl或1χ6組態中使用6個 影像塊或可在4x2(如圖7b中所展示)、2x4、8x1或lx8組態 中使用8個影像塊。注意,影像塊不需要為方形,視訊圖 136720.doc -78- 200941233 框亦不必為方形’或甚至矩形。可將影像塊分解成最佳地 適合所使用之視訊流及應用程式的無論什麼形狀。In a fixed position and with very little motion, and objects in the scene (eg, a person's conversation) show less movement). The video stream data rate sequence 634 shown in Figure 6c is a typical sequence that is expected to be visible from video with much more motion, such as may be produced in a movie or video game or in an application software. Note that in addition to the peak 633 of the worksite, there are also P-frame peaks (such as 635 and 636) that are quite large and in many cases exceed the maximum available data rate. Although the peaks of these P-frames are not quite as large as the I-frame peaks, they are still too large to be carried by the channel at the full data rate, and as the pivot peaks of Figure 1 'P-frame peaks must be transmitted slowly ( This increases the delay). I36720.doc -71- 200941233 〇❹ On a high-frequency wide channel (such as '100Mbps LAN, or high-bandwidth 连接 connection), the network will be able to tolerate large peaks such as I-frame peak 633 or ρ frame peak 636 However, in principle, low latency can be maintained. But $, these networks are often shared among many users (for example, in an office environment), and the "peak" data will affect the performance of the LAN, especially when the network traffic is routed to a private shared connection. (For example, from the remote financial center to the office) n, remember that this example is an example of a relatively low resolution video stream of 640x480 pixels at 60 fpS. The HDTV stream at 6〇 fps is easily handled by modern computers and monitors, and 2560x1440 resolution displays at 60 fps are increasingly available (for example, a卯&30" With H 264 compression, a 1920x1080 high motion video sequence with 6 〇 may require 4 5 Mbps to achieve a reasonable quality level. If the I-frame peak is assumed to be 1〇 of the nominal data rate, it will produce a 45 Mbps peak and a small but still quite large p-frame peak. If several users are receiving video streams on the same 1 Mbps network (for example, a private network connection between the office and the data center), it is easy to see how the peak of the video stream from several users can happen to The bandwidth of the network is flooded and may overwhelm the bandwidth of the backplane of the switch supporting the user on the network. Even in the case of ultra-high-speed Ethernet, if enough users have enough peaks for simultaneous alignment, they can flood the network or network parent converter. In addition, once 256 〇χ 144 〇 resolution video becomes more common, the average video stream data rate may be 9.5 Mbps, which may result in a 95 Mbps peak data rate. Needless to say, the 100 Mbps connection between the data center and the office (which is now an extraordinarily fast connection) will be completely defeated by a single user lacking peak traffic from I36720.doc -72- 200941233. Therefore, even if LAN and private network connections are more tolerant for peak-stream video, streaming video with high peaks is not required and may require special planning and adaptation by the office department. Of course, for standard and quasi-linear video applications, these issues are not a problem because the data rate is "smoothed" at the transmission point and the data for each frame is below the maximum available data rate 622 and is decompressed. Before the frame, p frame and B frame sequence, the buffer in the client side stores the I frame, the P © frame and the B frame sequence. Therefore, the data rate on the network remains close to the average data rate of the video stream. Unfortunately, this introduction delay, even if the B-frame is not used, is unacceptable for low-latency applications such as video games and applications that require fast response times. A prior art solution for mitigating video streams with high peaks is to use techniques often referred to as "blame locating element rate" (CBR) encoding. Although the term CBR appears to imply that all frames are compressed to have the same bit rate (ie, size)' but it is often referred to as a compression paradigm, in the compression paradigm, a certain number of frames are allowed to be crossed (in my case) In the case of a frame, the maximum bit rate. For example, in the context of the figure, if a CBR constraint is imposed on the code that limits the bit rate to, for example, 7〇% of the nominal maximum data rate 621, the compression algorithm will limit the frames. Each frame is shrunk so that any frame that would normally be reduced by more than 70% of the nominal maximum data rate 621 will be compressed with fewer bits. The result is that it will usually require more bits. Yuan will maintain the "extremely lacking" position of the frame of the given quality level and the image quality of these frames will be more than the required ratio of 136720.doc -73. 200941233 rated maximum data rate 621 of 7 ()% The quality of the other frames of the yuan is bad. This method can produce a result for a particular type of compressed video (where (4) less motion or scene change and (8) the user can accept periodic quality degradation). A good example of a suitable CBR application is that the π phone will be 6 meanings because there are fewer peaks and temporarily degraded in quality: (for example, if the camera is glanced, resulting in significant scene motion and large peaks, during the glance There may not be enough bits for high quality image compression, which will result in degraded image quality), which most users can accept. Unfortunately, CBR is not well suited for many other applications with high complexity scenes or large amounts of motion and/or requiring a reasonably constant quality level. The low latency compression logic 4〇4 used in one embodiment uses several different techniques to solve the problem of streaming low latency compressed video while maintaining high quality. First, the low-latency compression logic 4〇4 only generates the j-frame and the p-frame, thereby alleviating the need to wait for several frame times to decode each B-frame. Additionally, as illustrated in Figures 7 & In one embodiment, low latency compression logic 404 divides each uncompressed frame 7〇1_76 into a series of "tiles" and each image The blocks are individually encoded as a frame or a p-frame. In this paper, the compressed I frame and p frame of the group are referred to as "r frame" 711-770. In the particular example shown in Figure 7a, each uncompressed frame is subdivided into 16 image blocks of a 4M matrix. However, these basic principles are not limited to any particular sub-dividing mechanism. In one embodiment, the 'low latency compression logic 4〇4 divides the video frame into a plurality of scene blocks and encodes one of the image blocks from each frame (ie, 136720.doc • 74· 200941233 compression). Is an i frame (ie, compressing the image block as if it were a 1/16 of a full video frame size, and the compression for this "mini" frame is I frame compression) and Encode the remaining image blocks as? The frame (that is, the compression for each "mini" 1/16 frame is p-frame compression). The image blocks compressed into I frames and the image blocks compressed into p frames will be referred to as "I image blocks" and "P image blocks", respectively. The image block to be encoded as a block of image blocks is changed with each successive video frame. Therefore, in a given frame time, only one of the image blocks in the video frame is a work image block, and the remaining ones of the image blocks are p image blocks. For example, in Figure h, the image block of uncompressed frame 701 is encoded as image block 1 and the remaining 1-15 image blocks are encoded as p image blocks (Ρι to p) 5 An R frame 711 is generated. In the next uncompressed video frame 7〇2, the image block of the uncompressed frame 71 is encoded as an image block and the remaining image blocks 2 and 2 to 15 are encoded as p image blocks. (p〇, 匕 to 卜5) to generate r frame 712. Therefore, the image block and the P image block used for the image block are gradually interleaved in time on successive frames. The process continues until an R image block 770 is generated (the last image block in the matrix is encoded as an I image block (i.e., the process is then restarted, resulting in, for example, frame 711 (i.e., for the image block, Another R frame, such as an I picture block, etc. Although not illustrated, in the embodiment, the first R frame of the video sequence of the R frame contains only the image block (ie, so that The p-frame has reference image data (from which the juice motion is started. Or, in one embodiment, the start-up sequence uses the same I-image block pattern as normal, but does not include those that have not been encoded with the image block yet. The p-image block of the image block. In other words, the specific image block is not encoded together with any data before the arrival of the first frame of image 136720.doc -75- 200941233, thereby avoiding the start peak in the video stream data rate 934 in Figure 9a. Further, as described in more detail below, various sizes and shapes can be used for the image blocks while still complying with these basic principles. The video decompression logic executed on the client terminal 41 5 412 decompresses each image block as if it were a separate video sequence of a small I frame and a P frame, and then reproduces each image block to a frame buffer that drives display device 422. For example, using from R Frames 711 to 770, 10 and P〇, decompress and reproduce the image block of the video image. Similarly, the image block 1 'class is reconstructed using Ιι and Pi from R frames 7丨丨 to 77〇. As described above, the decompression of the I frame and the p frame is well known in the art, and the decompression of the I picture block and the p picture block can be performed by causing multiple execution entities of the video decompressor to be in the user. The implementation is performed on terminal 415. Although the multiplication process appears to increase the computational burden on the client usus, it does not actually increase the computational burden on the client 415 because the image block itself is proportionally smaller (as opposed to The number of additional processing and §) 'There are the same number of pixels displayed, as if there is one processing and using the full-size I-frame and P-frame of the conventional size. This R-frame technique significantly reduces the usual I-picture The peak width associated with the frame (described in Figures 6b and 6c) Ming), because any given frame is mainly composed of P frames that are usually smaller than the I frame. For example, suppose that the typical frame is 160 Kb, then each frame in the frame illustrated in Figure 7a The j image block of one will be approximately 1/16 or 10 Kb for this amount. Similarly, assuming a typical p frame of 16 Kb, then for each of the image blocks illustrated in Figure 7a. The frame can be approximately 1 Kb. The final result is approximately 10 Kb + 15J | 51 Kb = 25 Kb "R Figure 136720.doc .76 · 200941233 box. Therefore, each 60 frame sequence will be 25 Kb * 60 = 1.5 Mbps. Therefore, at 60 frames per second, this would require a channel capable of maintaining a bandwidth of 1.5 Mbps, but with a much lower peak due to the dispersion of the I-picture block throughout the 6-frame interval. Note 'In the previous example, it was used! The same assumptions for the frame and p-frames, the average data rate is 丨]Mbps. This is because in the previous example, only one new 1 frame was introduced every 60 frame time, and in this example, the 16 image blocks of the frame were cycled in 16 frame times, and thus 'Every 16 frames time bow 1 into one! The equalization of the frame results in a slightly higher average data rate. However, in practice, the introduction of more frequent I® boxes does not linearly increase the f-rate rate. This is due to the fact that the p-frame (or P-image block) is mainly encoded from the previous frame to the next. The difference in the box. Therefore, the previous frame is quite similar to the next frame, and the P frame will be very small. If the previous frame is quite different from the next frame, the p frame will be very large. However, because the p-frame is largely derived from the previous frame, rather than being derived from the actual frame, the resulting coded frame can contain more errors than I frames with a sufficient number of bits ( For example, visual artifacts). In addition, when a p-frame follows another P-frame, an error accumulation can occur (when there is a long p-frame sequence, it gets worse). Now, the cutting-edge video compressor will detect the shadow drop (four) declaration after a sequence of P frames = facts and if necessary, it will allocate more bits to the subsequent P frame to mention two qualities, Or if it is the most active process of 'p.', replace the P frame with an I frame. Thus, when a long box is used, as in the previous example above, a particular sequence (eg, a 59-sided feature S scene has a large number of complex 136720.doc -77 - 200941233 noise and/or motion, usually, for In the case of a p-frame, more bits are needed (because it becomes farther away from the I-frame). Or, looking at the P-frame from the relative view point, closely following the p-frame of the frame tends to require distance The frame is farther away from the bit of the p frame. Therefore, in the example shown in Figure 7a, the p-free frame is farther away from the frame by 15 frames (before the I frame)' In the previous example, the ρ frame can be separated from the frame by 59 frames. Therefore, in the case of more frequent frames, the ρ frame is smaller. Of course, the exact relative size will be based on the video stream. The nature changes but © In the example of Fig., if the I image block is 10 Kb, the size of the Bay JP image block can be only 0.75 kb on average, resulting in 10 Kb+15*0.75 Kb=21.25 Kb, or 60 graphs. The data rate in frame/sec will be 21 a KbMOMj Mbps, or a data rate with a frame frame followed by 59 p frames at 1·1 Mbps. The rate is about 16% higher. Again, the relative results between the two methods for video compression will vary depending on the video sequence, but in general, we have empirically found that for a given quality level, the R frame is used. It takes about 20% more bits than using the I/p frame sequence. However, 'of course, the R frame sharply reduces the peak value, which makes the video sequence available at a delay much smaller than the j/ρ frame sequence. The R frame is configured in a number of different ways depending on the nature of the video sequence, the reliability of the channel, and the available data rate. In an alternate embodiment, a number of image blocks other than 16 are used in the 4><4 configuration. For example, two image blocks can be used in a 2χΐ or 1x2 configuration, and 4 image blocks can be used in 2x2, 4><1 or 1><4 configuration commands, available in 3x2, 2x3, 6xl Or use 6 image blocks in the 1χ6 configuration or use 8 image blocks in 4x2 (shown in Figure 7b), 2x4, 8x1 or lx8 configurations. Note that the image block does not need to be square, video map 136720. Doc -78- 200941233 The box does not have to be square or even rectangular. The image block can be decomposed into the best fit. Whatever the shape of the video stream and application used.
在另一實施例中,I影像塊及P影像塊之循環不鎖定至影 像塊之數目。舉例而言,在8影像塊4χ2組態中,仍可如圖 7b中所說明而使用16循環序列。順序的未經壓縮之圖框 721、722、723各自經劃分成8個影像塊〇_7,且每一影像 塊經個別壓縮。自R圖框731,僅影像塊〇經壓縮為丨影像 塊,且剩餘影像塊經壓縮為P影像塊。對於隨後之尺圖框 732,所有8個影像塊經壓縮為p影像塊,且接著對於隨後 之R圖框733,影像塊1經壓縮為I影像塊且其他影像塊均經 壓縮為P影像塊。此外,如此對於16個圖框繼續進行排 序’僅每隔-圖框產生—;[影像塊,因此在第15個圖框時 間期間(圖7b中未圖示)及在第16個圖框時間期間產生用於 影像塊7之最末I影像塊(使用所有的p影像塊壓縮r圖框 78〇) °接著’序列再次以影像塊〇經廢縮為!影像塊且其他 影像塊經壓縮為P影像塊開始。如在先前實施例中,整個 視訊序列之第-圖框通常將均為!影像塊,以提供用於自 彼點向前之P影像塊的參考。!影像塊及㈣像塊之循環甚 至不需要為影像塊之數目之偶倍數。舉例而言,在8個影 像塊之情況下’在使用另一 I影像塊之前,具有影像塊 之每-圖框之後可為所有皆影像塊之2個圖框。在又一 實施例中’若(例如)已知螢幕之特定區域具有更多運動(需 要更頻繁之I影像塊),而其他區域更為靜態(例如,展示遊 戲之分數)(需要較残繁之!料塊),則與其他影像塊相 136720.doc -79· 200941233 比,可更經常地將特定影像塊連同〗影像塊一起進行排 序。此外,儘管在圖7心圖71)中說明每一圖框具有單一 像塊,但可在單一圖框令編碼多個1影像塊(取決於傳輸頻 道之頻寬)。相反地,特定圖框或圖框序列可在不具有工影 像塊(亦即,僅p影像塊)的情況下傳輸。 前一段之方法適當起作用之原因在於:儘管不具有跨越 每個單一圖框而分散之j影像塊看來似乎導致較大峰值, 但系統之行為並不如此簡單。因為每一影像塊係與其他影 © 像塊分開進行廢縮,所以當影像塊變小時,每一影像塊之 編碼可變得較不有效,因為給定影像塊之壓縮器不能夠利 用來自其他影像塊之類似影像特徵及類似運動。因此,與 將螢幕劃分成8個影像塊相比較,將螢幕劃分成16個影像 塊通常將導致較不有效之編碼。但是,若將榮幕劃分成8 個影像塊且其引起每隔8個圖框(而非每隔16個圖框)引入一 完全I圖框之資料,則其導致總體上高得多的資料速率。 泛因此,藉由每隔16個圖框(而非每隔8個圖框)引入一完全1 圖框,減小了總資料速率。又,藉由使用8個較大影像塊 (而非16個較小影像塊),減小了總資料速率,其亦將由較 大影像塊引起之資料峰值減輕至某種程度。 在另實施例中,圖7a及圖7b中之低延時視訊壓縮邏輯 4〇4藉由基於待壓縮之視訊序列之已知特性而藉由設定預 先組態或者基於每一影像塊中之影像品質的正在進行之分 析而自動地控制至R圖框中之各影像塊之位元的分配。舉 例而言,在一些競赛視訊遊戲中,玩家之汽車(其為場景 136720.doc 200941233 ❹In another embodiment, the loop of the I image block and the P image block is not locked to the number of image blocks. For example, in an 8 image block 4χ2 configuration, a 16-cycle sequence can still be used as illustrated in Figure 7b. The sequential uncompressed frames 721, 722, 723 are each divided into 8 image blocks 〇_7, and each image block is individually compressed. From R frame 731, only the image block is compressed into a frame of image, and the remaining block is compressed into a block of P blocks. For subsequent frame 732, all 8 image blocks are compressed into p-image blocks, and then for subsequent R frame 733, image block 1 is compressed into I image blocks and other image blocks are compressed into P-image blocks. . In addition, the 16 frames continue to be sorted 'only every time - frame is generated -; [image block, therefore during the 15th frame time (not shown in Figure 7b) and at the 16th frame time During the period, the last I image block for the image block 7 is generated (use all the p image blocks to compress the r frame 78〇). Then the sequence is again shredded by the image block! The image block and other image blocks are compressed into P image blocks. As in the previous embodiment, the first frame of the entire video sequence will usually be! Image block to provide a reference for P blocks that are forward from the other point. ! The loop of the image block and (4) the block does not even need to be an even multiple of the number of image blocks. For example, in the case of 8 image blocks, before each other image block is used, each frame having the image block can be followed by 2 frames of all the image blocks. In yet another embodiment, 'if, for example, a particular area of the screen is known to have more motion (requiring more frequent I-picture blocks), while other areas are more static (eg, showing game scores) (requires more tedious !block), compared with other image blocks 136720.doc -79· 200941233, the specific image blocks can be sorted together with the image blocks more often. Further, although each frame is illustrated as having a single block in Fig. 7 of Fig. 7, a plurality of blocks of one block can be encoded in a single frame (depending on the bandwidth of the transmission channel). Conversely, a particular frame or frame sequence can be transmitted without a work image block (i.e., only a p-picture block). The reason why the method of the previous paragraph works properly is that although the j-image block that does not have a spread across each single frame appears to cause a large peak, the behavior of the system is not so simple. Because each image block is shrunk separately from other image © blocks, the coding of each image block can become less effective when the image block becomes smaller, because the compressor of a given image block cannot be utilized from other Similar image features and similar motion of image blocks. Therefore, dividing the screen into 16 image blocks will generally result in less efficient coding than dividing the screen into 8 image blocks. However, if the screen is divided into 8 image blocks and it causes the introduction of a complete I frame every 8 frames (rather than every 16 frames), it results in a much higher overall data. rate. Therefore, by introducing a full 1 frame every 16 frames instead of every 8 frames, the total data rate is reduced. Moreover, by using eight larger image blocks (rather than 16 smaller image blocks), the total data rate is reduced, which also reduces the peak of the data caused by the larger image blocks to some extent. In another embodiment, the low-latency video compression logic 4〇4 in FIGS. 7a and 7b is pre-configured or based on image quality in each image block by virtue of known characteristics of the video sequence to be compressed. The ongoing analysis automatically controls the allocation of bits to each of the image blocks in the R frame. For example, in some competitive video games, the player's car (which is the scene 136720.doc 200941233 ❹
= =:)之前方佔據榮幕之下半部之大部分,而 、/①全被填滿正接近的道路、建築物及風景, 二乎、X*疋在運動中。若磨縮邏輯4〇4將相等數目之位元 ^己給每ϋ塊,則圖心的未經I缩之圖框a!中的 之下半部上之影像塊(影像塊4_7)通常將以比圖^中的 未經屢縮之㈣72l中㈣幕之上半部中之影像塊(影像塊 曰3)间的扣質而壓縮。乡已知此特定遊戲或遊戲之此特定 场景具有料特性’ Mt丨主機代f服務21()之運#商可组緣 屋縮邏輯404以將更多位元分配給螢幕之頂部之影像塊(與 刀配給螢幕之底部處之影像塊的位元相比)。或者,壓縮 邏輯404可在壓縮圖框之後估計影像塊之壓縮品質(使用許 多壓縮品質度量中之一或多者,諸如峰值信號雜訊比 (PSNR)),且若判定在特定時間窗上,特定影像塊始終如 地產生較佳品質結果,則其逐漸地將更多位元分配給產 生較低品質結果之影像塊,直至各種影像塊達到類似位準 之品質為止。在替代實施例中,壓縮器邏輯4〇4分配位元 以在特定影像塊或影像塊群中逹成較高品質。舉例而言, 其可提供較佳的總體感知外觀’以在螢幕之中心具有比邊 緣處高之品質。 在一實施例中’為了改良視訊流之特定區域之解析度, 視訊壓縮邏輯404使用較小影像塊來編碼視訊流之具有相 對多之場景複雜度及/或運動的區域(與視訊流之具有相對 少之場景複雜度及/或運動的區域相比)。舉例而言,如圖8 中所說明,在一 R圖框811(可能繼之以具有相同影像塊大 136720.doc -81 - 200941233 J之系列R圖框(未圖示))之一區域中的移動人物805之周 圍使用較小影像塊❶接著,當人物8〇5移動至影像之新區 域時’在另-R圖框812内之此新區域之周圍使用較小影像 塊^如所說明。如上所述,各種不同大小及形狀可用作 「影像塊」同時仍遵守此等基本原理。 次儘管上文所描述之循環I/P影像塊實質上減小視訊流之 資料速率中的峰值,但其並不完全消除峰值,尤其在快速 改變或高度複雜之視訊影像(諸如在電影、視訊遊戲及某 一應用程式軟體下出現)的狀況下。舉例而言,在突然場 景轉變期間,一複雜圖框可能繼之以完全不同之另一複雜 圖框。即使若干個I影像塊可領先於場景轉變僅幾個圖框 時間,其在此情形下亦無助益,因為新圖框之材料與先前 I影像塊無關。在此種情形下(及在即使並非一切皆改變, 大量影像亦改變的其他情形下),視訊壓縮器404將判定將 許多(若並非所有)p影像塊更有效地寫碼為】影像塊,且所 導致的為彼圖框之資料速率中的非常大之峰值。 如先前所論述,其僅為對於大多數消費者級網際網路連 接(及許多辦公室連接)之狀況,其僅不可「堵塞」超過圖 6c中展示為622之可用最大資料速率以及額定最大資料速 率621的資料。注意,額定最大資料速率621(例如,「6 Mbps DSL」)實質上為對於考慮麟買網際網路連接的使用 者之銷售數字,但通常其不保證效能位準。出於此應用之 目的’其不相g 1為吾人僅關注經由連接使視訊串流時 之可用最大資料速率622。因此,在圖9a及圖%中,當描 136720.doc •82· 200941233 述對峰值問題之解決方法時,自曲線圖省略額定最大資料 速率’且僅展示可用最大資料速率922。視訊流資料速率 不得超過可用最大資料速率922。 為了解決此問題,視訊壓縮器404進行的第一件事係判 定峰值資料速率941,其為頻道能夠穩定地處理之資料速 率°此速率可藉由許多技術來判定。一種該技術係將愈加 變高的資料速率測試流自主機代管服務21〇逐漸發送至用 ❹ ❹ 戶端415(圖4a及圖4b中),且使用戶端將關於封包丟失及延 時之位準的反饋提供至主機代管服務。當封包丟失及/或 延時開始展示尖銳增加時,其為達到可用最大資料速率 922之指示。之後,主機代管服務21〇可逐漸地減小測試流 之資料速率,直至用戶端415報告在合理之時間週期中已 接收到測試流(封包丟失及延時之可接受位準接近最小)為 止。此確定峰值最大資料速率941,其接著將用作用於串 流視訊之峰值資料速率。隨著時間的推移,峰值資料速率 941將波動(例如,絲庭中之另—使用者開始嚴重地使用 網際網路連接),且用戶端415將需要惶定地監視峰值 速率941以查看封包丢失或延時是否增加(指示可用最大資 料速率922T降至低於先前所確定科值㈣逮率, 且若如此’則峰值資料速率941。類似地,若隨 推移,用戶端415發現封Μ失及延時保持錢佳位準 則其可凊求視訊壓縮器緩慢地增加資料速率以 大資料速率是否增加(例如,若家庭令之另 止對網際網路連接之嚴重使用),且再次等待直至封 136720.doc •83- 200941233 失及/或較尚延時指示已超過可用最大資料速率922為止, 且可再次發現用於峰值資料速率941之較低位準,但該較 低位準可能高於測試增加的資料速率之前的位準。因此, 可藉由使用此技術(及類似其之其他技術)而發現峰值資料 速率941,且視需要而週期性地進行調整。峰值資料速率 941確定可由視訊壓縮器4〇4使用以使視訊串流至使用者的 最大資料速率。用於判定峰值資料速率之邏輯可在使用者 場所211處及/或在主機代管服務21〇上加以實施。在使用 © 者場所211處,用戶端器件415執行計算以判定峰值資料速 率且將此資訊傳輸回至主機代管服務21〇 ;在主機代管服 務210處,主機代管服務處之伺服器4〇2執行計算以基於自 用戶端415所接收之統計資料(例如,峰值丟失、延時、最 大資料速率等)而判定峰值資料速率。 圖9a展示具有實質場景複雜度及/或運動之實例視訊流 資料速率934,其係使用先前所描述且在圖&、圖几及圖8 中加以說明的循環I/P影像塊壓縮技術而產生。視訊麼縮器 U 404經組態而以低於峰值資料速率941之 經麼縮之視訊,且注意,大部分時間,視訊流 持低於峰值資料速率941。資料速率934與圖6c中所展示之 視訊流資料速率634(其係使用I/p/B或I/p圖框而產生)的比 較展示循環Ι/P影像塊壓縮產生平滑得多的資料速率。但在 圖框2倍峰值952(其接近2倍峰值資料速率942)及圖框*倍峰 值954(其接近4倍峰值資料速率944)下’資料速率仍超過峰 值資料速率941,其為不可接受的。在實踐中即使對於 136720.doc -84 - 200941233 來自快速改變之視訊遊戲的高動作視訊,超過岭值資料速 率941之峰值亦在小於2%之圖框中出現,超過2倍峰值資 料速率942之峰值很少出現,且超過3倍峰值資料速率943 之峰值難得出現。但是,當其確實出現時(例如,在場景 轉變期間),其所需之資料速率必須產生良好品質之視訊 影像。 解决此問題之一方式係簡單地組態視訊壓縮器404以使 得其最大資料速率輸出為峰值資料速率941。遺憾地,峰 ©值圖框期間的所得視訊輸出品f不良,因為壓縮演算法 極度缺乏」位元。所導致的為當存在突然轉變或快速運 動時出現壓縮假影,且及時地,使用者開始認識到:當存 在突然改變或快速運動時假影總是突然出I,且其可變得 相當討厭。 儘s人的視覺系統對在突然改變或快速運動期間出現的 視覺假影相當敏感,但對在該等情形下债測到圖框速率之 ❹/咸小並不是非常敏感。事實上,當該等突然:改變出現時, 看來似乎人的視覺系統專注於追蹤該等改變,且若圖框速 率暫時自60 fps下降至3〇 fps且接著立即返回至6()枷,則 =的視覺系統不會注意到。此外,在非常急劇之轉變(如 突然場景改變)的狀況下,若圖框速率下降至2〇 fps或甚至 15 fps且接著立即返回至6〇加,則人的視覺系統不會注意 到。只要圖框速率減小僅偶爾出現,對於人觀察者而言, 看來似乎視訊係以60 fps不斷地執行。 藉由圖外中所說明之技術來利用人的視覺系統之此特 136720.doc • 85 - 200941233= =:) The former party occupied most of the lower half of the screen, and /1 was filled with the roads, buildings and landscapes that were approaching, and X*疋 was in motion. If the grinding logic 4〇4 will give an equal number of bits to each block, then the image block (image block 4_7) on the lower half of the picture frame a! It is compressed by the buckle between the image block (image block 曰3) in the upper half of the (four) 72 (middle) screen of the unrestricted (four) 72l. Township knows that this particular scene of this particular game or game has material characteristics 'Mt丨 Host Generation f Service 21()'s #商可组缘房缩逻辑404 to assign more bits to the image block at the top of the screen (Compared to the bit of the image block at the bottom of the screen assigned to the screen). Alternatively, compression logic 404 may estimate the compression quality of the image block after compressing the frame (using one or more of a number of compression quality metrics, such as peak signal to noise ratio (PSNR)), and if determined to be on a particular time window, When a particular image block consistently produces better quality results, it gradually assigns more bits to the image blocks that produce lower quality results until the various image blocks reach a similar level of quality. In an alternate embodiment, the compressor logic 4〇4 assigns bits to a higher quality in a particular image block or image block group. For example, it can provide a better overall perceived appearance' to have a higher quality at the center of the screen than at the edges. In one embodiment, in order to improve the resolution of a particular region of the video stream, video compression logic 404 uses a smaller image block to encode a region of the video stream that has relatively more scene complexity and/or motion (with video stream). Relatively small compared to the complexity of the scene and/or the area of motion). For example, as illustrated in Figure 8, in an area of R frame 811 (possibly followed by a series of R frames (not shown) having the same image block size 136720.doc -81 - 200941233 J) A smaller image block is used around the moving character 805. Then, when the character 8〇5 moves to a new area of the image, a smaller image block is used around the new area in the other-R frame 812. . As mentioned above, various sizes and shapes can be used as "image blocks" while still complying with these basic principles. Although the cyclic I/P image block described above substantially reduces the peak in the data rate of the video stream, it does not completely eliminate the peak, especially in fast changing or highly complex video images (such as in movies, video). In the case of games and under an application software). For example, during a sudden scene transition, a complex frame may be followed by another complex frame that is completely different. Even if several I image blocks can lead the scene transition by only a few frame times, it does not help in this case because the material of the new frame is independent of the previous I image block. In such a situation (and in other situations where a large number of images change, even if not everything changes), video compressor 404 will determine that many, if not all, p-image blocks are more efficiently coded as image blocks. And the resulting result is a very large peak in the data rate of the frame. As previously discussed, it is only for most consumer-grade Internet connections (and many office connections), which can only be "blocked" beyond the maximum data rate available and the maximum data rate shown in Figure 6c as 622. 621 information. Note that the nominal maximum data rate of 621 (e.g., "6 Mbps DSL") is essentially a sales figure for users considering Internet access, but generally does not guarantee performance levels. For the purposes of this application, it is not the same as the maximum data rate 622 available when streaming video over a connection. Therefore, in Figure 9a and %, when the solution to the peak problem is described in 136720.doc • 82· 200941233, the nominal maximum data rate is omitted from the graph and only the maximum available data rate 922 is shown. The video streaming data rate must not exceed the maximum available data rate of 922. To solve this problem, the first thing the video compressor 404 does is to determine the peak data rate 941, which is the data rate at which the channel can be processed steadily. This rate can be determined by a number of techniques. One technique is to gradually increase the data rate test stream from the colocation service 21 to the user terminal 415 (Figs. 4a and 4b), and to cause the client to lose information about the packet loss and delay. The quasi-feedback is provided to the colocation service. When the packet is lost and/or the delay begins to show a sharp increase, it is indicative of the maximum data rate 922 available. Thereafter, the colocation service 21 can gradually reduce the data rate of the test stream until the client 415 reports that the test stream has been received within a reasonable period of time (the packet loss and the acceptable level of the delay are near minimum). This determines the peak maximum data rate 941, which will then be used as the peak data rate for streaming video. Over time, the peak data rate 941 will fluctuate (eg, the other in the theater - the user begins to seriously use the internet connection), and the client 415 will need to monitor the peak rate 941 to see the packet loss. Or whether the delay is increased (indicating that the available maximum data rate 922T falls below the previously determined value (4), and if so 'the peak data rate 941. Similarly, if the user 415 finds the loss and delay Keeping the money standard can ask the video compressor to slowly increase the data rate to increase the data rate (for example, if the family chooses another serious use of the Internet connection), and wait again until the 136720.doc • 83- 200941233 The missing/or longer delay indication has exceeded the maximum data rate 922 available, and the lower level for the peak data rate 941 can be found again, but the lower level may be higher than the increased test data. The level before the rate. Therefore, the peak data rate 941 can be found by using this technique (and other techniques like it) and periodically as needed. The line data rate 941 determines the maximum data rate that can be used by the video compressor 4〇4 to stream the video to the user. The logic for determining the peak data rate can be at the user location 211 and/or at the host generation. The service is implemented on the server 21. At the location 211, the client device 415 performs a calculation to determine the peak data rate and transmits this information back to the colocation service 21; at the colocation service 210, the host The server 4〇2 of the hosting service performs calculations to determine the peak data rate based on statistics received from the client 415 (e.g., peak loss, delay, maximum data rate, etc.) Figure 9a shows substantial scene complexity And/or an instance of the video stream data rate 934, which is generated using the cyclic I/P block compression technique described previously and illustrated in Figures & Figures, and 8. Video Navigator U 404 The video is configured to be below the peak data rate 941, and note that most of the time, the video stream is held below the peak data rate 941. Data rate 934 and Figure 6c A comparison of the video stream data rate 634 shown in the figure (which is generated using I/p/B or I/p frames) shows that the cyclic/P image block compression produces a much smoother data rate. However, in frame 2 The peak data 952 (which is close to 2 times the peak data rate 942) and the frame * times the peak 954 (which is close to 4 times the peak data rate of 944) are still exceeding the peak data rate 941, which is unacceptable. In practice Even for 136720.doc -84 - 200941233 high-motion video from fast-changing video games, the peak value above the ridge data rate 941 appears in the frame of less than 2%, and the peak value of the peak data rate 942 is less than 2 times. Occurs, and the peak of more than 3 times the peak data rate 943 is rare. However, when it does occur (for example, during a scene transition), the data rate required must produce a good quality video image. One way to solve this problem is to simply configure the video compressor 404 to have its maximum data rate output as the peak data rate 941. Unfortunately, the resulting video output during the peak © value frame is poor because the compression algorithm is extremely lacking. What is caused is that compression artifacts occur when there is a sudden transition or rapid motion, and in time, the user begins to realize that the artifact always suddenly appears when there is a sudden change or rapid motion, and it can become quite annoying. . The visual system of the person is quite sensitive to visual artifacts that occur during sudden changes or rapid movements, but is not very sensitive to the small/salty of the frame rate measured in such cases. In fact, when these sudden: changes occur, it seems that the human visual system is focused on tracking the changes, and if the frame rate temporarily drops from 60 fps to 3 〇 fps and then immediately returns to 6 () 枷, Then the visual system of = will not notice. In addition, in the case of very sharp transitions (such as sudden scene changes), if the frame rate drops to 2 〇 fps or even 15 fps and then immediately returns to 6 〇, the human visual system will not notice. As long as the frame rate reduction occurs only occasionally, it seems to the human observer that the video system is continuously executed at 60 fps. Utilizing the technology described in the figure to take advantage of the human visual system 136720.doc • 85 - 200941233
性。伺服器402(來自圖4a及圖4b)以穩定圖框速率(在一實 施例中,在60 fps下)產生未經壓縮之視訊輸出流。時刻表 展示每一 1/60秒每一圖框961-970輸出。自圖框961開始, 將每一未經壓縮之視訊圖框輸出至低延時視訊壓縮器 404,低延時視訊壓縮器4〇4在小於一圖框時間之時間中壓 縮該圖框,產生用於第一圖框之經壓縮之圖框〗981。經 產生用於經壓縮之圖框1 98丨的資料可視如先前所描述之 許多因素而較大或較小。若資料足夠小以致可以峰值資料 速率941在一圖框時間(1/6〇秒)或小於一圖框時間内將其傳 輸至用戶端415,則在傳輸時間(xmit時間)991(指示傳輸時 間之持續時間的箭頭之長度)期間將其傳輸。在下一個圖 才I:時間中,伺服器402產生未經壓縮之圖框2 962,將其壓 縮成經壓縮之圖框2 982 ’且在小於—圖框時間之傳輸時 間992期間以峰值資料速率941將其傳輸至用戶端415。 接著,在下一個圖框時間中,伺服器402產生未經壓縮 之圖框3 963 °當由視訊壓縮㈣4來壓縮未經壓縮之圖框 3 963時所得的經壓縮之圖框3 983為比可以峰值資料速 率94〗在一圖框時間中傳輸之資料多的資料。因此,在傳 輸時間(2倍峰值)993期間將其傳輸,其㈣所㈣框時間 及下個圖框時間之一部分。現在’在下一個圖框時間期 間伺服器402產生另一未經藶縮之圖框4 964且將其輸出 至視訊壓縮器4G4 ’但資料被忽略且藉由974來說明。此係 因為視訊壓縮器404經組態以忽略在其仍傳輸先前經壓縮 之圖框時到達的其他未經壓縮之視訊圖框。當然,用戶端 I36720.doc -86 - 200941233 41 5之視訊解壓縮器將未能接收到圖框4,但其簡單地繼續 在顯示器件422上顯示圖框3歷時2個圖框時間(亦即,暫時 將圖框速率自60 fps減小至3〇 fpS)。 對於下一個圖框5,伺服器402輸出未經壓縮之圖框5 965,將其壓縮成經壓縮之圖框5 985且在傳輸時間的5期 間在1圖框内將其傳輸。用戶端415之視訊解I缩器解麼縮 圖框5並將其顯示於顯示器件422上。接著,伺服器牝2輸 出未經壓縮之圖框6 966,視訊壓縮器4〇4將其壓縮成經壓 〇 縮之圖框6 986,但此時所得的f料非常大^在傳輸時間(4 倍峰值)996期間以峰值資料速率941傳輸經壓縮之圖框, 但花費幾乎4個圖框時間來傳輸圖框。在接下來的3個圖框 時間期間,視訊壓縮器404忽略來自伺服器4〇2之3個圖 框,且用戶端415之解壓縮器將圖框6穩定地保持在顯示器 件422上歷時4個圖框時間(亦即,暫時將圖框速率自6〇 fps 減小至15 fps)。接著最後,伺服器4〇2輸出圖框1〇 97〇,視 訊壓縮器404將其壓縮成經壓縮之圖框10 987 ,且在傳輸 時間997期間將其傳輸,且用戶端4丨5之解壓縮器解壓縮圖 框1〇並將其顯示於顯示器件422上且再一次視訊以6〇 fps重 新開始。 庄意,儘管視讯壓縮器404丟棄了來自由伺服器4〇2產生 之視訊流的視訊圖框,但其不會丟棄音訊資料(不管音訊 係以什麼形式來的)’且當丟棄視訊圖框時視訊壓縮器4〇4 繼續壓縮音訊資料並將其傳輸至用戶端415 ’用戶端415繼 續解壓縮音訊資料並將音訊提供至由使用者使用以回放音 136720.doc •87- 200941233 訊之無論什麼器件。因此在丢棄圖框之週期期間,音訊繼 續而不減弱。與經壓縮之視訊相比,經壓縮之音訊消耗相 對小百分比之頻寬,且因此不會對總資料速率有較大影 響。儘管在資料速率圖中之任一者中皆未說明,但峰值資 料速率941内總是存在經保留用於經壓縮音訊流的資料速 率容量。 選擇剛剛在圖9b中所描述之實例來說明在資料速率峰值Sex. Server 402 (from Figures 4a and 4b) produces an uncompressed video output stream at a stable frame rate (in one embodiment, at 60 fps). The timetable shows the output of each frame 961-970 for each 1/60 second. Starting from frame 961, each uncompressed video frame is output to the low latency video compressor 404, and the low latency video compressor 4〇4 compresses the frame for less than one frame time, resulting in The compressed frame of the first frame is 981. The data generated for the compressed frame 1 98 can be larger or smaller depending on many factors as previously described. If the data is small enough to transmit the peak data rate 941 to the client 415 at frame time (1/6 sec) or less than one frame time, then at the transmission time (xmit time) 991 (indicating the transmission time) It is transmitted during the length of the arrow of duration. In the next Figure I: time, the server 402 generates an uncompressed frame 2 962, which is compressed into a compressed frame 2 982 'and at a peak data rate during a transmission time 992 less than the frame time. 941 transmits it to the client 415. Next, in the next frame time, the server 402 generates an uncompressed frame 3 963 ° when compressed by the video compression (4) 4 to compress the uncompressed frame 3 963, the compressed frame 3 983 is comparable The peak data rate 94 is the data that is transmitted in a frame time. Therefore, it is transmitted during the transmission time (2 times peak) 993, which is part of the (four) frame time and the next frame time. Now, during the next frame time, the server 402 generates another un-collapsed frame 4 964 and outputs it to the video compressor 4G4' but the data is ignored and illustrated by 974. This is because video compressor 404 is configured to ignore other uncompressed video frames that arrive when they are still transmitting previously compressed frames. Of course, the video decompressor of the client I36720.doc -86 - 200941233 41 5 will not receive the frame 4, but it simply continues to display the frame 3 on the display device 422 for 2 frame times (ie , temporarily reduce the frame rate from 60 fps to 3〇fpS). For the next frame 5, server 402 outputs uncompressed frame 5 965, compresses it into compressed frame 5 985 and transmits it in a frame during the 5th transmission time. The video decoder of the client 415 solves the frame 5 and displays it on the display device 422. Next, the server 牝 2 outputs the uncompressed frame 6 966, and the video compressor 4 〇 4 compresses it into a frame 6 986 which is compressed and collapsed, but the f material obtained at this time is very large ^ at the transmission time ( 4 times peak) During the 996 period, the compressed frame is transmitted at the peak data rate 941, but it takes almost 4 frame times to transmit the frame. During the next three frame times, the video compressor 404 ignores the three frames from the server 4〇2, and the decompressor of the client 415 stably holds the frame 6 on the display device 422 for a period of time 4 Frame time (ie, temporarily reduce the frame rate from 6〇fps to 15 fps). Finally, the server 4〇2 outputs the frame 1〇97〇, and the video compressor 404 compresses it into the compressed frame 10 987 and transmits it during the transmission time 997, and the solution of the user terminal 4丨5 The compressor decompresses the frame 1 〇 and displays it on the display device 422 and restarts the video again at 6 〇 fps. In the meantime, although the video compressor 404 discards the video frame from the video stream generated by the server 4〇2, it does not discard the audio material (regardless of the form of the audio system)' and when discarding the videogram The frame-time video compressor 4〇4 continues to compress the audio data and transmits it to the client 415. The client 415 continues to decompress the audio data and provides the audio to the user for playback of the sound 136720.doc •87-200941233 No matter what device. Therefore, during the period in which the frame is discarded, the audio continues without being attenuated. Compressed audio consumes a relatively small percentage of the bandwidth compared to compressed video and therefore does not have a significant impact on the overall data rate. Although not illustrated in any of the data rate maps, there is always a data rate capacity reserved for the compressed audio stream within the peak data rate 941. Select the example just described in Figure 9b to illustrate the peak data rate
期間圖框速率如何下降,但未說明的係#使用先前所描述 之循環Ι/P影像塊技術時,該等資料速率峰值及隨之發生的 丢棄的圖框很少’即使在高場景複雜度/高動作序列(諸如 在視訊遊戲、電影及某—應用程式軟體中出現的彼等)期 間亦如此。因A ’減小的圖框速率罕有且暫時,且人的視 覺系統不會偵測到它們。 右將剛剛所描述之圖框速率減小機制應用於圖% =視Γ資料速率’則在圖9c中說明所得的視訊流資料 速率。在此實例中,2倍峰值952已減小至平坦 = 值⑸,倍峰值955已減小至平坦化的4倍峰值9的55倍: 9整41個視錢資料料934保持處於或低於峰值資料速率 消費者級網際網路:: 可經由通用網際網路及 另外,在(例〜 時來傳輸高動作視訊流。 ,100 Mbs乙太網路或8〇2 路)上或私用網路(例如,資料中心與辦公a L線網 Mbps連接)上之辦 a至之間的100 至環可在無峰值情況下傳輸高 136720.doc •88- 200941233 動作視訊流,以使得多個使用者(例如,以45Mbps傳輸6〇 fps下之192〇χ1080)可使用LAN或共用私用資料連接,而不 使重疊峰值淹沒網路或網路交換器底板。 資料速率調整 在一實施例中,主機代管服務210最初評估頻道之可用 最大資料速率622及延時以判定用於視訊流之適當資料速 率且接著回應於此而動態地調整資料速率。為了調整資料 速率,主機代管服務210可(例如)修改待發送至用戶端415 〇 之視訊流的影像解析度及/或每秒圖框數。又,主機代管 服務可調整經壓縮視訊的品質位準。當改變視訊流之解析 度時(例如’自1280X720解析度至640x360),用戶端415上 之視訊解壓縮邏輯412可將影像按比例增加以在顯示螢幕 上維持相同影像大小。 在一實施例中,在頻道完全退出之情形下,主機代管服 務210將遊戲暫停。在多人遊戲之狀況下,主機代管服務 向其他使用者報告該使用者已退出遊戲及/或將遊戲暫停 以用於其他使用者。 丟棄或廷遲的封包 在一實施例中,若資料由於圖4a或圖4b中的視訊壓縮器 4〇4與用戶端415之間的封包丟失而丟失,或由於到達得過 晚以致不能解壓縮及滿足經解壓縮圖框之延時要求的封包 被無次序地接收而丟失,則視訊解壓縮邏輯412能夠減輕 視覺假影。在串流Ι/P圖框實施中,若存在丟失/延遲的封 包,則整個螢幕受影響,從而可能引起螢幕完全凍結歷時 136720.doc -89- 200941233 ❹ 一時間週期或展示其他螢幕寬視覺假影。舉例而言,若去 失/延遲的封包引起!圖框之丢失’則在接收新的^圖框之 前,解壓縮器將缺乏用於跟隨的所有p圖框之參考。若丟 失P圖框,則其將影響跟隨的用於整個螢幕之?圖框^視工 圖框出現之前有多A,此將具有較長或較短之視覺影響。 使用如圖7a及圖7b中所展示之交錯I/p影像塊,丟失/延遲 的封包不太可能影響整個榮幕’因為其僅影響受影響之封 包中所含有的影像I若每-影像塊之㈣係在個別封包 内發送’則若封包丢失’則其僅影響一影像塊。當然,視 覺假影之持續時間將取決於丨影像塊封包是否丟失及在p影 像塊丟失之情況下在〗影像塊出現之前將花費多少個圖 框。但是,假定登幕上之不同影像塊係藉由i圖框非常頻 繁地(可能每個圖框)更新,則即使螢幕上之—影像塊受影 響,其他影像塊亦可能不受影響。另外,若 若干封包同時丢失(例如,鄰接DSL線之電力中的暫時中斷 資料流之尖峰信號)’則—些影像塊將比其他影像塊受到 更大影響’但因為—些影像塊將藉由新^影像塊迅速地 更新所以其僅暫時受影響。又,在•流Ι/P®框實施之情 況下’不僅I圖框為最關鍵圖框,而且丨圖框極大,因此若 存在引起丢棄/延遲的封包之事件,則與小得多的【影像塊 t比1圖框受影響存在較高機率(亦即,若I圖框之任何部 分丟失,則根本不可能可解壓縮丨圖框卜由於所有此等原 、圖框之情況相比,當封包被丟棄/延遲時,使用 Ι/p影像塊導致小得多的視覺假影。 136720.doc 200941233 一實施例試圖藉由將經壓縮之影像塊 啊傳輸㈣協定跑或卿_者資料=裝= 而減少丢失封包之效應。舉例而言,在-實施例中封= 可心’即將影像塊與封包邊界對準。圖iGa說明 不實施此特徵之情況下將影像塊封裝於—系列封包^ ΟDuring the period when the frame rate drops, but the undescribed system # uses the cyclic Ι/P image block technique described previously, the data rate peaks and the consequent discarded frames are few 'even in high scene complexity. This is also true during periods of high/high motion, such as those found in video games, movies, and some application software. The frame rate reduced by A' is rare and temporary, and the human visual system does not detect them. Right, the frame rate reduction mechanism just described is applied to the graph % = visual data rate, and the resulting video stream data rate is illustrated in Figure 9c. In this example, the 2x peak 952 has been reduced to a flat = value (5), and the double peak 955 has been reduced to 55 times the flattened 4 times the peak 9: 9 full 41 data items 934 remain at or below Peak Data Rate Consumer Internet:: Via the Universal Internet and, in addition, (in the case of ~ high-speed video streaming, 100 Mbs Ethernet or 8 〇 2) or private network The 100-to-loop between the roads (for example, the data center and the office a L-line network Mbps connection) can transmit the high 136720.doc •88- 200941233 motion video stream without peaking, so that multiple uses (for example, transmitting 192 〇χ 1080 at 6 Mbps at 45 Mbps) can use LAN or shared private data connections without flooding the network or network switch backplane. Data Rate Adjustment In one embodiment, the colocation service 210 initially evaluates the channel's available maximum data rate 622 and latency to determine the appropriate data rate for the video stream and then dynamically adjusts the data rate in response thereto. To adjust the data rate, the colocation service 210 can, for example, modify the image resolution and/or the number of frames per second of the video stream to be sent to the client 415. In addition, the colocation service can adjust the quality level of the compressed video. When changing the resolution of the video stream (e.g., from 1280X720 resolution to 640x360), the video decompression logic 412 on the client 415 can scale the image to maintain the same image size on the display screen. In one embodiment, the colocation service 210 suspends the game in the event that the channel is completely exited. In the case of a multiplayer game, the colocation service reports to other users that the user has quit the game and/or paused the game for other users. Discarded or delayed packet In one embodiment, if the data is lost due to packet loss between video compressor 4〇4 and client 415 in Figure 4a or Figure 4b, or cannot be decompressed due to late arrival And the packets satisfying the delay requirements of the decompressed frame are lost without being received in order, and the video decompression logic 412 can mitigate visual artifacts. In the streaming/P-frame implementation, if there is a lost/delayed packet, the entire screen is affected, which may cause the screen to freeze completely. 136720.doc -89- 200941233 ❹ One time period or other screen wide visual false Shadow. For example, if a lost/delayed packet is caused! The frame is missing' then the decompressor will lack a reference for all p-frames to follow before receiving a new frame. If you lose the P frame, will it affect the following for the entire screen? Frame ^ Vision The number of A before the frame appears, this will have a longer or shorter visual impact. Using the interleaved I/p blocks shown in Figures 7a and 7b, the lost/delayed packets are unlikely to affect the entire screen' because it only affects the image I contained in the affected packet. (4) Sending 'If the packet is lost' in an individual packet, it only affects one image block. Of course, the duration of the visual artifact will depend on whether the image block is lost and how many frames will be spent before the image block appears in the event of a loss of the image block. However, assuming that the different image blocks on the screen are updated very frequently (perhaps each frame) by the i-frame, even if the image block on the screen is affected, other image blocks may not be affected. In addition, if several packets are lost at the same time (for example, the spike of the temporarily interrupted data stream in the power adjacent to the DSL line), then some of the image blocks will be more affected than other image blocks, but because some image blocks will be used by The new image block is updated quickly so it is only temporarily affected. Also, in the case of • rogue/P® box implementation, 'not only the I frame is the most critical frame, but the frame is extremely large, so if there is an event that causes a drop/delay packet, it is much smaller. [Image block t is more likely to be affected than the 1 frame (that is, if any part of the I frame is lost, it is impossible to decompress the frame) because of all the original and frame cases. Using a Ι/p image block results in a much smaller visual artifact when the packet is discarded/delayed. 136720.doc 200941233 An embodiment attempts to transmit (four) protocol run or __ data by compressing the image block = Install = to reduce the effect of missing packets. For example, in the embodiment - the seal = can 'align the image block with the packet boundary. Figure iGa shows that the image block is packaged in the series without implementing this feature Packet ^ Ο
刪内。具體言之,在圖1Gat,影像塊越過封包邊界且 經無效率地封裝以致單一封包之丢失導致多個圖 失。舉例而言,若封包圆或_4*失m 塊,導致視覺假影。 &像 相比之下’圖㈣說明用於將影像塊智慧地封裝於封包 内以減少封包丟失之效應的影像塊封裝邏輯1〇1〇。首先, 影像塊封裝邏輯1010將影像塊與封包邊界對準。因此,影 像塊Ti、T3、T4、T7及T2分別與封包贿1〇〇5之邊界= 準。影像塊封裝邏輯亦試圖以T能的更有效之方式將影像 塊組合於封包内’而不越過封包邊界。基於影像塊中^每 一者的大小,將影像塊丁丨與冗組合於一封包1〇〇1中;將 Τ3與Τ5組合於一封包1002中;將影像塊以與以組合於一 封包1〇〇3中;將影像塊丁8添加至封包1〇〇4;且將影像塊τ2 添加至封包1005。因此,在此方案下,單一封包丟失將導 致不多於2個影像塊(而非如圖10a中所說明的3個影像塊)之 丟失。 圖10b中所展示之實施例的一額外益處在於:影像塊係 以其在景> 像内被顯示之不同次序進行傳輸。若鄰近封包由 於干擾傳輸之同一事件(其將影響螢幕上彼此不接近之區 136720.doc •91 · 200941233 域)而丟失,則此方式在顯示器上產生較不引人注意的假 影。 一實施例使用前向錯誤校正(FEC)技術來保護視訊流之 特定部分以使其免受頻道錯誤之影響。如此項技術中已 知,諸如里德-所羅門及Viterbi2FEC技術產生錯誤校正資 料資訊並將其附加至經由通信頻道而傳輸之資料。若錯誤 在基本資料(例如,I圖框)中出現,則FEC可用於校正該錯 誤。 〇 FEC碼增加傳輸之資料速率,因此理想地,其僅在最需 要時使用。若資料正被發送,且其將不導致非常引人注意 之視覺假影,則可較佳不使用FEC碼來保護資料。舉例而 言,緊接於丟失的I影像塊之前的p影像塊將僅在螢幕上產 生1/60秒之視覺假影(亦即,螢幕上之影像塊將不被更 新)。此種視覺假影幾乎不能被人眼偵測到。隨著P影像塊 自I影像塊進一步向後,丟失P影像塊愈加變得更引人注 意。舉例而言’若影像塊循環型樣為在I影像塊再次可用 ® 之則一 1影像塊繼之以15個P影像塊,則若緊接於I影像塊 之後之P影像塊丟失,則其導致彼影像塊展示不正確之影 像歷時15個圖框時間(在6〇印3下,彼將為25〇毫秒)。人眼 將容易偵測到250毫秒的流之中斷。因此,p影像塊距新的 I影像塊愈向後(亦即,P影像塊跟隨〗影像塊愈接近),則假 影愈引人注意。如先前所論述,儘管如此,但一般而言, P影像塊跟隨I影像塊愈接近,用於彼p影像塊之資料愈 小。因此’跟隨I影像塊之p影像塊不僅對於保護以免丟失 136720.doc -92- 200941233 而言更關鍵’而且其大小較小。此外,一般而言,需要保 護之資料愈小,保護其所需之FEC碼愈小。 因此,如圖11 a中所說明,在一實施例中,由於I影像塊 在視訊流中之重要性,僅〗影像塊具備FEC碼。因此’ FEC 1101含有用於1影像塊1100之錯誤校正碼且FEC 1104含有 用於I影像塊1103之錯誤校正碼。在此實施例中,對於p影 像塊不產生FEC。 在圖lib中所說明之一實施例中,對於在丟失時最可能 Ο 引起視覺假影之P影像塊亦產生FEC碼。在此實施例中, FEC 1105提供用於前3個p影像塊但不用於跟隨的p影像塊 之錯誤校正碼。在另一實施例中,對於資料大小最小之p 影像塊產生FEC碼(其將傾向於自選在τ影像塊之後最早出 現的Ρ影像塊,其對於保護最為關鍵)。 在另一實施例中,並非將FEC碼連同影像塊一起發送, 而是將影像塊傳輸兩次,每次在不同封包中傳輸。若一封 包丟失/延遲,則使用另一封包。 ❹在圖lie中所展示之一實施例中,產生分別用於與視訊 同時自主機代管服務傳輸之音訊封包111〇及1112的fec碼 1111及1113。維持視訊流中之音訊之完整性特別重要,因 為失真之音訊(例如,滴答聲或嘶嘶聲)將導致特別不入需 要之使用者體驗。FEC碼幫助確保音訊内容在用戶端^腦 415處無失真地再現。 ν %s玳貢料一起 送,而是將音訊資料傳輸兩次,每次 母人在不问封包中傳輸 I36720.doc •93- 200941233 若一封包丟失/延遲,則使用另一封包。 另外’在圖lid中所說明之一實施例中,FEC碼1121及 1123分別用於自用戶端415上行傳輸至主機代管服務210之 使用者輸入命令(例如,按紐按壓)112〇及1122。此係重要 的’因為在視訊遊戲或應用程式中漏掉按鈕按壓或滑鼠運 動可能導致不合需要之使用者體驗。 在另一實施例中,並非將FEC碼連同使用者輸入命令資 料一起發送,而是將使用者輸入命令資料傳輸兩次,每次 © 在不同封包中傳輸。若一封包丟失/延遲’則使用另一封 包。 在一實施例中’主機代管服務21〇評估與用戶端415之通 信頻道之品質,以判定是否使用FEC,且若使用,則判定 應對視訊、音訊及使用者命令之何部分應用FEC。評估頻 道之「品質」可包括如上所述的諸如估計封包丟失、延時 等之功能。若頻道特別不可靠,則主機代管服務21〇可對 所有I影像塊、p影像塊、音訊及使用者命令應用FEc。相 比之下,若頻道可靠,則主機代管服務21〇可僅對音訊及 使用者命令應用FEC,或可不對音訊或視訊應用FEc,或 可根本不使用FEC。可使用FEC之應用之各種其他排列, 同時仍遵守此等基本原理。在一實施例中,主機代管服務 210不斷地監視頻道之狀況且相應地改變策略。 在另一實施例中,參看圖4&及圖4b,當封包吾失/延 遲,從而導致影像塊資料之吾失時,或若可能由於特別糟 之封包丟失而使得FEC不能夠校正丟失的影像塊資料,用 136720.doc -94- 200941233 戶端415評估在將接收新的i影像塊之前剩餘多少個圖框且 將其與自用戶端41 5至主機代管服務210之來回行程延時相 比較。若來回行程延時小於新的】影像塊應到達之前的圖 框之數目,則用戶端415向主機代管服務21〇發送訊息,請 求新的1影像塊。將此訊息路由至視訊壓縮器404,且其並 非產生用於資料已丟失之影像塊的p影像塊,而是產生^影 像塊。假定圖4a及圖4b中所展示之系統經設計以提供通常 小於80毫秒之來回行程延時,則此導致影像塊被校正於 © 毫秒内(在60 fpS下’圖框具有j 6 毫秒之持續時間,因此 在全圖框時間中,80毫秒延時將導致83.33毫秒内的經校 正之影像塊,83.33毫秒為5個圖框時間,其為引人注意的 中斷’但遠不及(例如)對於15個圖框25〇毫秒中斷引人注 意)。當壓縮器404脫離其通常的循環次序而產生此種丨影像 塊時,若I影像塊將引起彼圖框之頻寬超過可用頻寬,則 壓縮器404將延遲其他影像塊之循環,以使得其他影像塊 在彼圖框時間期間接收P影像塊(即使在彼圖框期間一影像 塊通常將應為I影像塊),且接著通常的循環將自下一個圖 框開始繼續,且通常將已接收到先前圖框中之工影像塊的 衫像塊將接收I影像塊。儘管此動作暫時延遲R圖框循環之 階段’但其通常將在視覺上不引人注意。 視訊及音訊壓缩器/解壓缩器實施 圖12說明一特定實施例,其中使用多核及/或多處理器 1200來並行地壓縮8個影像塊。在一實施例中,使用在 。…◦出或更高下執行之雙核處理^四核又⑽㈣電腦 136720.doc -95- 200941233 系統’每一核心作為獨立過程實施開源x264 Η.264壓縮 器。然而,可使用各種其他硬體/軟體組態,同時仍遵守 此等基本原理。舉例而言,CPU核心中之每一者可藉由以 FPGA實施之H. 264壓縮器來替換。在圖12中所展示之實例 中’核心1201-1208用於作為八個獨立線緒來同時處理 像塊及P影像塊。如此項技術中眾所熟知的,當前多核及 多處理器電腦系統與諸如Microsoft Windows XP專業版(64 位元版或者32位元版)及Linux之多線緒處理作業系統整合 〇 時,其固有地能夠進行多線緒處理。 在圖12中所說明之實施例中,因為該8個核心中之每一 者僅負責一影像塊,所以其很大程度上獨立於其他核心而 操作,每一者執行x264之單獨實例化。使用以PCI Express xl為基礎之DVI俘獲卡(諸如,來自Netherlands的 Microtronix of Oosterhout 之 Sendero 視訊成像 ip 開發板)來 俘獲640x480、8 00x600或1280x720解析度下的未經壓縮之 視訊,且卡上之FPGA使用直接記憶體存取(DMA)來將所 ❹ 俘獲之視訊經由DVI匯流排傳送至系統ram中。將該等影 像塊配置成4x2配置1205(儘管其說明為方形影像塊,但在 此實施例中’其具有160x240解析度)。x264之每一實例化 經組態以壓縮該8個160x240影像塊中之一者,且其經同步 化以使得在初始I影像塊壓縮之後每一核心進入一循環, 每一圖框與另一圖框不同相’以壓縮一 I影像塊繼之以七 個P影像塊,如圖12中所說明。 在每一圖框時間,使用先前所描述之技術將所得的經壓 136720.doc •96- 200941233 縮影像塊組合成封包流,且接著將經壓縮影像塊傳輸至目 的地用戶端4 1 5。 儘管圖12中未說明,但若組合的8個影像塊之資料速率 超過指定峰值資料速率941,則所有8個x264過程將暫時中 止歷時達必要的圖框時間,直至已傳輸用於組合的8個影 像塊之資料為止。 在一實施例中,將用戶端415實施為執行FFmpeg之8個 實例化之PC上的軟體。接收過程接收8個影像塊,且將每 〇 一影像塊路由至FFmpeg實例化,FFmpeg實例化解壓縮影 像塊並將其再現至顯示器件422上之適當影像塊位置。 用戶端415接收來自PC之輸入器件驅動器的鍵盤、滑鼠 或遊戲控制器輸入並將其傳輸至伺服器402。伺服器402接 著應用所接收之輸入器件資料並將其應用於在伺服器402 上執行之遊戲或應用程式,伺服器402為使用Intel 2.16 GHz雙核CPU執行Windows之PC。伺服器402接著產生新圖 框並經由其DVI輸出端將新圖框自以主機板為基礎之圖形 ® 系統或者經由NVIDIA 8800GTX PCI Express卡之DVI輸出 端輸出。 同時,伺服器402經由其數位音訊輸出端(例如, S/PDIF)輸出由遊戲或應用程式產生之音訊,該數位音訊 輸出端耦合至實施視訊壓縮的以雙四核Xeon為基礎之PC 上的數位音訊輸入端。Vorbis開源音訊壓縮器用於使用可 用於處理線緒之無論什麼核心來與視訊同時地壓縮音訊。 在一實施例中,完成壓縮其影像塊之核心首先執行音訊壓 136720.doc -97- 200941233 縮。接著將經壓縮之音訊連同經壓縮之視訊一起傳輸,並 在用戶端415上使用Vorbis音訊解壓縮器來解壓縮經壓縮之 音訊。 主機代管服務伺服器中心分配 經由玻璃(諸如,光纖)之光以光在真空中之速度的某一 分率行進,且因此可判定光在光纖中之確切傳播速度。但 是,在實踐中,考慮用於路由延遲、傳輸無效率及其他耗 用之時間,吾人觀察到網際網路上之最佳延時反映較接近 © 光速之50%的傳輸速度。因此,最佳1〇〇〇英里來回行程延 時為約22毫秒,且最佳3〇〇〇英里來回行程延時為約㈣毫 秒。因此,一美國海岸上之單一伺服器將距離過遠以致不 能以所要之延時伺服另一海岸上之用戶端(其可能達3〇〇〇 英里遠)。然而’如圖13a中所說明,若主機代管服務21〇 祠服器中心1300定位於美國之中心(例如,Kansas、 Nebraska等),以致至美國大陸中之任何點之距離為約i5〇〇 ^ 英里或15 00英里以下’來回行程網際網路延時可低至32毫 秒。參看圖4b,注意:儘管使用者ISP 453所允許之最糟狀 況延時為25毫秒’但通常,在DSL及電纜數據機系統之情 況下吾人觀察到較接近10-15毫秒之延時。又,圖4b假定 自使用者場所211至主機代管中心210之最大距離為1〇〇〇英 里。因此’在所使用的典型的丨5毫秒之使用者ISp來回行 程延時及對於32毫秒之來回行程延時的15〇〇英里之最大網 際網路距離的情況下,自使用者致動輸入器件421之時刻 至在顯示器件422上看見回應的總來回行程延時為 136720.doc -98 · 200941233 1 + 1+ 15+32 + 1+ 16+6+8=80毫秒。因此,通常可在15〇〇英里 之網際網路距離上達成80毫秒回應時間。此將允許美國大 陸中具有足夠短之使用者ISP延時453的任何使用者場所存 取在中心定位之單一伺服器中心。 在圖13b中所說明之另一實施例中,主機代管服務21〇伺 服器中心HS1-HS6戰略上定位於美國(或其他地理區域)之 周圍,特定較大之主機代管服務伺服器中心接近高人口中 心而定位(例如,HS2及HS5)。在一實施例中,伺服器中心 G hS1-HS6經由網路13()1交換f訊,網路13G1可為網際網路 或私用網路或兩者之組合。在多個伺服器中心之情況下, 可以較低延時向具有高使用者Isp延時453之使用者提供服 務。 儘S網際網路上之距離的確為對經由網際網路之來回行 程延時有影響的因素,但有時很大程度上與延時無關之其 他因素亦起作用。有時經由網際網路將封包流路由至距離 〇 ^之位置且再次返回,從而導致來自長循環之延時。有時 在路徑上存在不冑當操作之路由設備,從巾導致傳輸之延 遲。有時存在使路徑超載之訊務,其引入延遲。此外,有 時’根本係存在防止使用者之lsp路由至給定目的地的故 障。因此,儘管通用網際網路通常以相當可靠且最佳之路 由及延時來提供自-點至另一點之連接,該相當可靠且最 佳之路線及延時很大程度上係藉由距離來判定(尤其是在 導路由至使用者之本端區域之外部的長距離連接的情況 下)但該可靠性及延時得不到任何保證且常常不可自使 136720.doc -99· 200941233 用者之場所至通用網際網路上之給定目的地而達成。 々在一實施例中,當使用者用戶端415最初連接至主機代 管服務210以玩視訊遊戲或使用應用程式時,用戶端在啟 動時與可用的主機代管服務伺服器中心HS1_HS6中之每一 者通信(例如’使用上文所描述之技術)。若延時對於特定 連接而言足夠低,則使用彼連接。在一實施例中,用戶端 與所有主機代管服務飼服器中心或主機代管服務飼服器令 〜集通k,選擇具有最低延時連接之主機代管服務 ©飼服器中心。用戶端可選擇具有最低延時連接之服務中 心,或伺服器中心可識別具有最低延時連接之伺服器中心 並將此資訊(例如,以網際網路位址之形式)提供給用戶 端。 若特定主機代管服務伺服器中心超載及/或使用者之遊 戲或應用程式可容忍至另一、較少載入之主機代管服務词 服器中心的延時,則可將用戶端415重定向至另一主機代 官服務飼服器中心。在此種情形下,將使使用者正執行之 遊戲或應用程式在使用者之超載伺服器中心處的伺服器 402上暫仔,且將遊戲或應用程式狀態資料傳送至另一主 機代管服務祠服器中心處之伺服器4〇2。接著將重新開始 該遊戲或應用程式。在一實施例中,主機代管服務21〇將 等待直至遊戲或應用程式達到自然暫停點(例如,遊戲中 之級别之間或者在使用者在應用程式中起始「保存」操 作之後)才進行傳送。在又一實施例中,主機代管服務21〇 將等待直至使用者活動停止歷時指定時間週期(例如,^分 136720.doc -100· 200941233 鐘)為止且接者將在彼時起始傳送。 如上所述,在一實施例中,主機代管服務210訂用圖i4 之網際網路繞過服務440以試圖將得到保證的延時提供給 其用戶端。如本文中所使用之網際網路繞過服務係提供自 網際網路上之一點至另一點之具有得到保證之特性(例 如,延時、資料速率等)的私用網路路線的服務。舉例而 5 ’若主機代管服務210正使用在San Francisco提供的 AT&T之DSL服務接收來自使用者之大量訊務(而非路由至 © 以AT&T2 San Francisco為基地的中央辦公室),則主機代 管服務210將在以San Francisco為基地之中央辦公室與用 於主機代管服務210之伺服器中心中的一或多者之間租用 來自服務提供者(可能為AT&T本身或另一提供者)之高容量 私用資料連接。接著,若自所有主機代管服務伺服器中心 HS1-HS6經由通用網際網路至San卜抓…⑺中使用at&t DSL之使用者的路線導致過高延時,射改為使用私用資 #連接。儘管私用資料連接通常比經由通用網際網路之路 線更昂貴,但只要其保持主機代管服務21〇之一小百分比 連接至使用者,總成本影響就低,且使用者將體驗到更一 貫之服務體驗。 在電力故障之情況下,伺服器中心常常具有兩個備用電 力層第層通常為來自電池(或來自替代的立即可用之 能量源,諸如保持運轉且附接至發電機之飛輪)之備用電 力’其在電力幹線出故障時立即提供電力且保持伺服器中 〜運轉。若電力故障為暫時的,且電力幹線迅速返回(例 136720.doc 200941233 如,在一分鐘内),則電池所需的係保持飼服器中心運 轉。但若電力故障歷時較長之時間週期,則通常啟動發電 機(例如’柴油機供電)來取代電池且發電機只要具有燃料 即可運轉。該等發電機極昂貴,因為其必須能夠產生多 伺服器中心通常自電力幹線所得到的電力。 在一實施例中’主機代管服務聰-HS5中之每一者彼此 共用使用者資料,以便在一祠服器中心具有電力故_ > Λ可將在進行中的遊戲及應用程式暫停’且接著將遊戲咬 ©冑用程式狀態資料自每一飼服器4〇2傳送至其他伺服器中 心處之飼服器402,且接著將通知每一使用者之用戶端化 以指導其傳達至新的飼服器術。假定該等情形偶爾出 現,則將使用者轉移至不能夠提供最佳延時之主機代管服 務伺服器中心(亦即,使用者將僅必須容忍較高延時歷時 電力故障之持續時⑴可為可接受的,其將允_心㈣ 使用者之寬得多的範圍的選項。舉例而言,給定跨越美國 ❹之夺區I _東海岸上之使用者在11:3〇ρΜ可能將要睡 R巾西海岸上之使用者在8:3QpMi開始在視訊遊戲使用 上達到峰值。若彼時西海岸上之主機代管服務飼服器中心 中存在電力故障,則其他主機代管服務飼服器中心處可能 不存在用於處理所有使用者之足夠的西海岸飼月艮器術。 在此種情形下,可將一些使用者轉移至東海岸上具有可用 飼服器402之主機代管服務飼服器中心,且對於使用者而 :的唯一後果將係較高延時。一旦將使用者自失去電力之 5服器中。轉移,伺服器中心接著就可開始其伺服器及設 136720.doc 200941233 備之有序切斷,以便在電池(或其他立即電力備用)耗盡之 前切斷所有設備。以此方式,可避免用於伺服器中心之發 電機的成本。 在-實施例中,在主機代管服務21〇之嚴重載入之時間 期間(或者由於峰值使用者載入,或者因為一或多個飼服 器中心出故障),基於使用者正使用之遊戲或應用程式之 延時要求將使用者轉移至其他伺服器中心。因此,將為使 用需要低延時之遊戲或應用程式的使用者給出對存在有限 © 供應之可用低延時伺服器連接的優選。 主機代管服務特徵 圖15說明在以下特徵描述中利用的用於主機代管服務 210之伺服器中心之組件的實施例。如同圖以中所說明之 主機代管服務210—樣,除非另外有條件,否則此伺服器 中心之組件由主機代管服務21〇控制系統4〇1來控制及協 調。 將來自使用者用戶端415之入埠網際網路訊務15〇1指引 至入埠路由1502。通常,入埠網際網路訊務1501將經由至 網際網路之高速光纖連接而進入伺服器中心,但具有足夠 頻寬、可靠性及低延時之任何網路連接構件將係足夠的。 入埠路由1502係網路(該網路可實施為乙太網路、光纖頻 道網路,或經由任何其他輸送構件)交換器及支援該等交 換器之路由伺服器的系統,其取得到達的封包且將每一封 包路由至適當應用程式/遊戲伺服器1521_1525。在一實施 例中’遞送至特定應用程式/遊戲伺服器之封包表示自用 136720.doc -103- 200941233 戶端所接收之資料之一子集及/或可由資料中心内之其他 組件(例如’網路連接組件,諸如閘道器及路由器)來轉譯/ 改變。在一些狀況下,(例如)若遊戲或應用程式同時並行 地在多個伺服器上執行,則每次將封包路由至一個以上伺 服器1521-1525。RAID陣列15 11-1512連接至入埠路由網路 1502,以使得應用程式/遊戲伺服器1521_1525可讀取raid 陣列1511-1512及寫入1^1£)陣列1511_1512。另外,1^1〇 陣列1515(其可實施為多個RAID陣列)亦連接至入槔路由 Ο 1502 ’且來自RAID陣列1515之資料可自應用程式/遊戲飼 服器1521-1525來讀取。入埠路由15〇2可在多種先前技術 網路架構(包括樹結構之交換器,入琿網際網路訊務15〇1 在其根部)中實施;在互連所有各種器件之網狀結構中實 施;或作為互連之子網路序列(互通器件當中之集中訊務 與其他器件當中之集中訊務隔離)來實施。一類型之網路 組態為S AN,其儘管通常用於儲存器件,但其亦可用於器 件之間的通用尚速資料傳送。又,應用程式/遊戲伺服器 1521-1525可各自具有至入埠路由15〇2之多個網路連接。 舉例而言,伺服器1521-1525可具有至附接至RAID陣列 1511-1512之子網路的網路連接及至附接至其他器件之子 網路的另一網路連接。 應用程式/遊戲伺服器1521-1525可經相同地、有些不同 地或全部不同地來組態,如先前關於圖牦中所說明之實施 例中之伺服器402所描述的。在一實施例中,每一使用者 备使用主機代管服務時通常為至少一應用程式/遊戲伺服 136720.doc 200941233 器1521-1525。出於說明之簡單起見,將假定給定使用者 正使用應用程式/遊戲伺服器1 52 1,但多個伺服器可由一 使用者使用,且多個使用者可共用單一應用程式/遊戲伺 服器1521-1525。自用戶端415(如先前所描述)所發送的使 用者之控制輸入經接收為入埠網際網路訊務15〇1,且經由 入埠路由1502而路由至應用程式/遊戲伺服器1521。應用 程式/遊戲伺服器1521使用使用者之控制輸入作為至在伺 服器上執行之遊戲或應用程式的控制輸入,且計算視訊及 © 與其相關聯之音訊的下一個圖框。應用程式/遊戲飼服器 1521接著將未經壓縮之視訊/音訊1529輸出至共用視訊壓 縮1530。應用程式/遊戲伺服器可經由任何構件(包括一或 多個超高速乙太網路連接)而輸出未經壓縮之視訊,但在 一實施例中,視訊係經由DVI連接而輸出,且音訊及其他 壓縮及通Ί吕頻道狀態資訊係經由通用串列匯流排(USB)連 接而輸出。 共用視訊壓縮1530壓縮來自應用程式/遊戲词服器mi· ® 1525的未經壓縮之視訊及音訊。該壓縮可完全以硬體或以 執行軟體之硬體來實施。可存在用於每一應用程式/遊戲 伺服器1521-1525之專用壓縮器,或若壓縮器足夠快,則 可使用給定壓縮器來壓縮來自一個以上應用程式/遊戲伺 服器1521-1525之視訊/音訊。舉例而言,在加下,視 訊圖框時間為16.67毫秒。若一壓縮器能夠在i毫秒内壓縮 1圖框,則彼壓縮器可用於藉由取得來自一個接一個之伺 服器的輸入而壓縮來自多達16個應用程式/遊戲飼服器 136720.doc •105· 200941233 1521-1525之視訊/音訊,該壓縮器保存每一視訊/音訊壓縮 過程之狀態且當其在來自伺服器之視訊/音訊流當中循環 時切換背景。此導致壓縮硬體的實質成本節省。因為不同 词服器將在不同時間完成圖框,所以在一實施例中,壓縮 器資源係處於具有用於儲存每-壓縮過程之狀態之共用儲 存構件(例如,RAM,快閃記憶體)的共用集區1530中,且 當伺服器1521-1525圖框完整且準備被壓縮時,控制構件 判疋彼時哪個壓縮資源可用,為該壓縮資源提供伺服器之 Ο 麼縮過程之狀態及待壓縮的未經壓縮之視訊/音訊之圖 框。 注意,用於每一伺服器之壓縮過程的狀態之一部封包化 括關於壓縮本身之資訊,諸如先前圖框之經解壓縮之圖框 緩衝資料(其可用作用於P影像塊之參考)、視訊輸出之解 析度;壓縮之品質;影像塊結構;每影像塊之位元之分 配;壓縮品質、音訊格式(例如,立體聲、環繞音效、 Dolby® AC-3)。但是壓縮過程狀態亦包括關於以下之通信 ® 頻道狀態資訊:峰值資料速率941’及先前圖框(如圖处中 所說明)當前是否正被輸出(且因此應忽略當前圖框),及潛 在地是否存在應在壓縮中考慮的(諸如,過多封包吾失)影 響壓縮決策(例如,在I影像塊之頻率方面,等)的頻道特 性。因為峰值資料速率941或其他頻道特性隨著時間而改 變,如由支援每一使用者監視自用戶端415所發送之資料 的應用程式/遊戲伺服器1521-1525所判定的,所以應用程 式/遊戲伺服器1521-1525將相關資訊發送至共用硬體壓縮 136720.doc •106· 200941233 1530。 共用硬體壓縮1530亦使用諸如先前所描述之彼等構件之 構件將經壓縮之視訊/音訊封包化,且在適當時,應用FEc 碼,複製特定資料,或採取其他步驟,以便充分地確保視 訊/音訊資料流由用戶端41 5接收且以可行之高品質及可靠 性解壓縮的能力。 些應用程式(諸如,下文所描述之彼等應用程式)需要 給定應用程式/遊戲伺服器1521_1525之視訊/音訊輸出同時 © 在多個解析度下(或以其他多個格式)可用。若應用程式/遊 戲伺服器1521-1525如此通知共用硬體壓縮153〇資源,則 彼應用程式/遊戲伺服器1521_1525的未經壓縮之視訊音訊 1529將被以不同格式、不同解析度及/或在不同封包/錯誤 校正結構中同時壓縮。在一些狀況下,一些壓縮資源可在 壓縮同一視訊/音訊之多個壓縮過程當中共用(例如,在許 多壓縮演算法中’存在藉以在應用壓縮之前將影像按比例 調整至多個大小的步驟。若需要輸出不同大小之影像,則 此步驟可用於同時伺服若干個壓縮過程)。在其他狀況 下,對於每一格式將需要單獨的壓縮資源。在任何狀況 下,將用於給定應用程式/遊戲伺服器1521_1525( 一或多 個)所需的所有各種解析度及格式的經壓縮之視訊/音訊 1539同時輸出至出皡路由154()。在—實施例中,經壓縮之 視訊/音訊1539之輸出係處sUDp格式,因此其為單向封包 流。 出埠路由網路1540包含-系列路由飼服器及交換器,該 136720.doc 200941233 系列路由伺服器及交換器將每一經壓縮之視訊/音訊流經 由出埠網際網路訊務1599介面(其通常將連接至至網際網 路之光纖介面)而指引至所欲使用者或其他目的地及/或返 回至延遲緩衝器1515,及/或返回至入埠路由15〇2,及/或 經由私用網路(未圖示)而輸出以供進行視訊分配。注意(如 下所述):出埠路由1540可將給定視訊/音訊流同時輸出至 夕個目的地。在一實施例中,此係使用網際網路協定(IP) 多播來實施’丨中廣播意欲同時串流至多個目的地之給定 O UDP流,且該廣播由出埠路由⑽中之路由飼服器及交換 器來重複。廣播之該多個目的地可係經由網際網路而至多 個使用者之用戶端415、經由入埠路由15〇2而至多個應用 程式/遊戲祠服器152M525,及/或至一或多個延遲緩衝器 1515。因此,將給定飼服器1521_1522之輸出壓縮成一或 多個格式,且將每一經壓縮之流指引至一或多個目的地。 另外,在另-實施例中,若多個應用程式/遊戲飼服器 1521-1525同時由一使用者使用(例如,在用於產生具有複 雜場景之3D輸出的並行處理組態中)且每一伺服器產生所 得影像之部分,則可由共用硬體壓縮153〇將多個伺服器 1521-1525之視訊輸出組合成—組合圖框,且自彼點向前 如上所述處理該組合圖框,好像其來自單一應用程式/遊 戲伺服器1521-1525。 注意’在一實施例中’將由應用程式/遊戲祠服器1521-1525產生之所有視訊的複本(至少以由使用者檢視之視訊 之解析度或更高解析度)記錄於延遲緩衝器Η"中歷時至 136720.doc -108- 200941233 少某一數目之分鐘(在一實施例中為15分鐘)。此允許每一 使用者「回倒」來自每一會話之視訊,以便核查先前工作 或業績(在遊戲之狀況下)。因此,在一實施例中,將路由 至使用者用戶端415的每一經壓縮視訊/音訊輸出1539流亦 多播至延遲緩衝器1515。當將視訊/音訊儲存於延遲緩衝 器1515上時’延遲緩衝器1515上之目錄提供應用程式/遊 戲伺服器152 1-1525(其為延遲之視訊/音訊之來源)之網路 位址與延遲緩衝器1515上可發現延遲之視訊/音訊之位置 © 之間的交又參考。 現場直播的、可即刻檢視的、可即刻播放的遊戲 應用程式/遊戲伺服器1521-1525不僅可用於執行使用者 之給定應用程式或視訊遊戲,而且其可用於建立用於支援 經由主機代管服務21〇之導航及其他特徵之主機代管服務 210的使用者介面應用程式。一種該使用者介面應用程式 之螢幕拍攝展示於圖16中(「遊戲取景器」螢幕)。此特定 *用者介面螢幕允許使用者觀看由其他使用者現場玩的 (或延遲的)15個遊戲。「縮略圖」視訊窗中之每一者(諸 如,1600)為在運動中的現場直播之視訊窗,其展示來自 一使用者之遊戲的一視訊。縮略圖中所展示之視圖可為使 用者正看之同一視圖,或其可為延遲的視圖(例如,若使 用者正玩搏鬥遊戲,則使用者可能不希望其他使用者看見 其隱藏在哪裡且其可選擇將其遊戲播放之任何視圖延遲一 時間週期(例如’ 1G分鐘)卜視圖亦可為不同於任何使用者 之視圖的遊戲之相機視圖。使用者可基於多種標準而經由 136720.doc -109- 200941233 選單選擇(此說明中未圖示)來選擇待同時檢視之遊戲之選 擇。作為例示性選擇之小取樣,使用者可選擇遊戲之隨機 選擇(諸如圖16中所展示之彼等遊戲)、所有一類別之遊戲 (均由不同玩家來玩)、僅遊戲之頂級玩家、遊戲中之給定 級別的玩家,或較低級玩家(例如,若玩家正學習基礎)、 為「搭檔」(或為競爭者)之玩家、具有最多數目檢視者的 遊戲等。 注意,通常,每一使用者將決定來自其遊戲或應用程式 © 之視訊是否可由他人檢視’且若如此,則決定該視訊可由 哪些他人檢視及何時可由他人檢視,決定該視訊是否僅可 在具有延遲之情況下檢視β 產生圖16中所展示之使用者介面螢幕的應用程式/遊戲 伺服器1521-1525藉由向每一使用者(該應用程式/遊戲伺服 器1521-1525正請求來自該使用者之遊戲)之應用程式/遊戲 伺服器1521-1525發送訊息而獲取該15個視訊/音訊饋送。 該訊息係經由入埠路由1502或另一網路來發送。該訊息將 包括被凊求之視訊/音訊之大小及格式,且將識別檢視使 用者介面螢幕之使用者。給定使用者可選擇選擇「盜版」 模式且不准許任何其他使用者檢視其遊戲之視訊/音訊(自 其檢視點或者自另一檢視點)’或如先前段中所描述,使 用者可選擇允許檢視來自其遊戲之視訊/音訊,但延遲所 檢視之視訊/音訊。使用者應用程式/遊戲伺服器1521_ 1525(其接收並接受允許其視訊/音訊被檢視之請求)將因此 向請求伺服器確認,且其亦將通知共用硬體壓縮153〇需要 136720.doc •110· 200941233 產生被請求格式或螢幕大小(假定格式及榮幕大小不同於 已經產生的格式及螢幕大小)的額外經壓縮視訊流,且其 亦將#曰示經壓縮視訊的目的地(亦即,請求飼服器卜若被 請求的視訊/音訊僅被延遲,則請求應用程式/遊戲伺服器 1521-1525將被如此通知,且其將藉由查找延遲緩衝器 1515上之目錄中的視訊/音訊之位置及為延遲的視訊/音訊 之來源的應用程式/遊戲伺服器1521_1525之網路位址而自 延遲緩衝器1515獲取延遲的視訊/音訊。一旦所有此等請 © 求被產生並處理,則將高達1 5個現場直播之縮略圖大小之 視訊流自出埠路由1540路由至入埠路由15〇2、至產生使用 者介面螢幕之應用程式/遊戲伺服器1521_1525,且將由該 伺服器來解壓縮及顯示。延遲的視訊/音訊流可能處於過 大之螢幕大小,且若如此,則應用程式/遊戲伺服器1521_ 1525將解壓縮該等流並將視訊流按比例縮減至縮略圖大 小。在一實施例中,將對音訊/視訊之請求發送至與圖“ 之主機代管服務控制系統類似之中央「管理」服務(圖15 中未展示)(且由中央「管理」服務來管理),中央「管理」 服務接著將該等請求重定向至適當應用程式/遊戲伺服器 1521-1525。此外,在一實施例中,可能不需要請求,因 為縮略圖被「推送」至允許其之彼等使用者的用戶端。 來自15個遊戲之所有同時混合的音訊可能產生刺耳的聲 音。使用者可選擇以此方式將所有聲音混合在一起(可能 就為得到由被檢視之所有動作產生的「喧囂」之感覺), 或者使用者可選擇每次僅聽取來自一遊戲之音訊。單一遊 136720.doc 111 200941233 戲之選擇係藉由將黃色選擇框1601移動至給定遊戲來完成 (黃色框移動可藉由使用鍵盤上之箭頭鍵、藉由移動滑 鼠、藉由移動操縱桿或藉由推動諸如行動電話之另一器件 上之方向按鈕來完成)。一旦選擇了單一遊戲,則僅來自 彼遊戲之音訊播放。又,展示遊戲資訊16〇2。在此遊戲之 狀況下’例如,出版商標誌(r EA」)及遊戲標誌「極品飛 車卡本峽谷」及橙色橫條在相對條件下指示在彼特定時刻 玩遊戲或檢視遊戲之人的數目(在此狀況下,許多,因此 © 遊戲為「熱門」)。另外提供「狀態」,指示存在145個玩 豕正積極地玩極品飛車遊戲之8〇個不同實例化(亦即,該 遊戲可藉由個別玩家遊戲或多人遊戲來玩),且存在68〇個 檢視者(此使用者係其中之一)。注意,此等統計資料(及其 他統計資料)由主機代管服務控制系統4〇 1來收集並儲存於 RAID陣列15 11 -1512上,以用於保持主機代管服務21 〇操作 之曰諸且用於適當地向使用者計費並向提供内容之出版商 支付費用》—些統計資料係由於由服務控制系統40丨進行 之動作而記錄,且一些統計資料係由個別應用程式/遊戲 飼服器1521-1525報告給服務控制系統401。舉例而言,當 遊戲正被檢視時(及當遊戲被停止檢視時),執行此遊戲取 景器應用程式之應用程式/遊戲伺服器152卜1525向主機代 管服務控制系統401發送訊息,以使得主機代管服務控制 系統401可更新多少個遊戲處於檢視中的統計資料。一些 統計資料可為使用者介面應用程式(諸如,此遊戲取景器 應用程式)所用。 136720.doc -112- 200941233 若使用者單擊其輸入器件上之啟動按鈕,則其將看見黃 色框中之縮略圖視訊放大同時縮略圖視訊保持現場直播為 全螢幕大小。此效應展示於圖17中之過程中。注意,視訊 窗1700之大小增大。為了實施此效應’應用程式/遊戲伺 服器1521-1525自執行選定之遊戲之應用程式/遊戲伺服器 1521-1525請求具有路由至其之遊戲之全螢幕大小(以使用 者之顯不器件422之解析度)的視訊流之複本。執行遊戲之 應用程式/遊戲伺服器1521-1525通知共用硬體壓縮器1530 〇 不再需要遊戲之縮略圖大小之複本(除非另一應用程式/遊 戲伺服器1521-1525需要此種縮略圖),且接著其指引共用 硬體壓縮器1530將視訊之全螢幕大小之複本發送至放大視 讯之應用程式/遊戲伺服器1521_1525。玩該遊戲之使用者 可或可不具有解析度與將遊戲放大之使用者之彼顯示器件 的解析度相同的顯示器件422。另外,遊戲之其他檢視者 可或可不具有解析度與將遊戲放大之使用者相同的顯示器 ^ 件422(且可具有不同的音訊回放構件,例如,立體聲或環 繞音效)。因此,共用硬體壓縮器153〇判定是否已經產生 滿足請求視訊/音訊流之使用者之要求的合適的經壓縮視 訊/音訊流,且若合適的經壓縮視訊/音訊流確實存在,則 共用硬體壓縮器1530通知出琿路由1540將該流之複本路由 至放大該視訊之應用程式/遊戲伺服器1521_1525,且若合 適的經壓縮視訊/音訊流不存在,則壓縮視訊之適合於彼 使用者的另一複本並指導出埠路由將該流發送回至入埠路 由1502及放大該視訊之應用程式/遊戲伺服器1521_1525。 136720.doc -113· 200941233 現在接收選定視訊之全螢幕版本的此伺服器將解壓縮該全 螢幕版本並將其逐漸地按比例放大至全大小。 圖18說明在將遊戲完全放大至全螢幕且以使用者之顯示 器件422之全解析度展示遊戲之後螢幕看起來如何(如藉由 箭頭1 800指向之影像所指示的)。執行遊戲取景器應用程 式之應用程式/遊戲伺服器1521-1525向提供縮略圖之其他 應用程式/遊戲伺服器1521-1525發送訊息以指示該等縮略 圖不再需要且向主機代管服務控制伺服器4〇1發送訊息以 © 指不不再檢視其他遊戲。此時,產生的唯一顯示為螢幕頂 部的上覆1 8 01 ’其將資訊及選單控制提供給使用者。注 意’隨著此遊戲進展,觀眾增長至2,5〇3個檢視者。在如 此多的檢視者之情況下,必然存在具有顯示器件422之許 多檢視者,該等顯示器件422具有相同或接近之解析度(每 一應用程式/遊戲伺服器1521-1525具有按比例調整視訊以 用於調整配合度之能力)。 〇 因為所展示之遊戲為多人遊戲’所以使用者可決定在某 時刻加入該遊戲。由於多種原因,主機代管服務21〇可或 可不允許使用者加入該遊戲。舉例而言,使用者可能必須 支付玩遊戲之費用而選擇不支付,使用者可能不具有足以 加入彼特定遊戲之足夠等級(例如,對於其他玩家而言, 其將不有競爭性),或者使用者之網際網路連接可能不具 有足以允許使用者玩的足夠低之延時(例如,不存在用於 檢視遊戲之延時約束,因此可在無延時關注之情況下檢視 被遠距離地(實際上,在另一大陸上)玩的遊戲,但對於待 136720.doc -114- 200941233 玩之遊戲而言,延時必須足夠低以使使用者(a)享受該遊 戲’且(b)處於與可能具有較低延時連接之其他玩家相等的 地位)。若不准許使用者玩,則為使用者提供遊戲取景器 使用者介面之應用程式/遊戲伺服器152ΐ_ι525將請求主機 代管服務控制飼服器4 0 1起始(亦即’定位並啟動)經合適地 組態以用於播放特定遊戲之應用程式/遊戲伺服器1 52 J _ 1525以自RAID陣列1511-1512載入該遊戲,且接著主機代 管服務控制伺服器401將指導入琿路由1502將來自使用者 © 之控制信號傳送至現在主機代管遊戲之應用程式/遊戲伺 服器且現在主機代管遊戲之應用程式/遊戲伺服器將指導 共用硬體壓縮1530自壓縮來自主機代管遊戲取景器應用程 式之應用程式/遊戲伺服器之視訊/音訊切換至壓縮來自現 在主機代管遊戲之應用程式/遊戲飼服器之視訊/音訊。遊 戲取景器應用程式/遊戲服務與主機代管遊戲之新的應用 程式/遊戲伺服器之垂直同步並不同步,且因此在該兩個 同步之間可能存在時間差。因為共用視訊壓縮硬體1530將 在應用程式/遊戲伺服器1521-1525完成視訊圖框之後即開 始壓縮視訊’所以來自新伺服器之第一圖框可比舊伺服器 之全圖框時間完成得早,來自新伺服器之第一圖框可能在 先前經壓縮之圖框完成其傳輸之前(例如,考慮圖朴之傳 輸時間992 :若未經壓縮之圖框3 963完成地早一圖框時間 之一半,則其將衝擊傳輸時間992)。在此種情形下,共用 視訊壓縮硬體1530將忽略來自新伺服器之第一圖框(例 如,如忽略(974)圖框4 964),且用戶端41 5將來自舊伺服 136720.doc -115- 200941233 器之最末圖框保持一額外圖框時間,且共用視訊壓縮硬體 1530將開始壓縮來自主機代管遊戲之新應用程式/遊戲伺 服器的下一圖框時間視訊。對於使用者而言,在視覺上, 自一應用程式/遊戲伺服器至另一應用程式/遊戲伺服器之 轉變將係無縫的。主機代管服務控制伺服器4〇丨接著將通 知主機代管遊戲取景器之應用程式/遊戲伺服器1521·1525 切換至閒置狀態,直至再次需要其為止。 使用者接著能夠玩該遊戲。此外’例外的係遊戲將在感 © 知上係即刻地播放(因為遊戲已被以十億位元/秒速度自 1^1心車列1511-1512載入至應用程式/遊戲伺服器1521_1525 上),且將藉由理想的驅動器、暫存器組態(在wind〇WS2 狀況下)將遊戲連同經確切組態以用於該遊戲之作業系統 一起載入至確切適合於該遊戲之伺服器上,且無可能與該 遊戲之操作競爭的其他應用程式在該伺服器上執行。 又,隨著使用者在遊戲中進展,遊戲之片段中之每一者 將以十億位元/秒速度(亦即,8秒1次十億位元組載入)自 ® RaID陣列1511·1512載入伺服器中,且由於RAm陣列 1511-15 12之巨大儲存容量(因為其為許多使用者之共用資 源,所以其可能非常大,但仍具成本效益),使得可預先 計算幾何形狀設置或其他遊戲片段設置並將其儲存於 RAID陣列1511-1512上且極快速地進行載入。此外,因為 每-應用程式/遊戲伺服n 1521_1525之硬體組態及計算能 力係已知的,所以可預先計算像素及頂點著色。 因此,遊戲可幾乎即刻啟動,其將在理想環境中執行, 136720.doc -116 - 200941233 且隨後之片段將幾乎即刻載入。 但是,除此等優點之外,❹者將能夠檢視他人玩遊戲 (經由先前所描述之遊戲取景器,及其他構件),且兩者均 決定遊戲是否有趣,且若如此,則自觀看他人而學習技 巧。此外,使用者將能夠即刻地演示該遊戲,而不必等待 大的下載及/或安裝,且使用者將能夠即刻玩該遊戲(可能 在較小費用之試用基礎上,或在較長期基礎上)。此外, 使用者將能夠藉由足夠低延時之無'線連接而在wind〇ws © PC、Macintosh上、在電視機上、在家襄、在行進時且甚 至在行動電話上玩該遊戲。此外,此均可在並非曾經實體 擁有遊戲複本的情況下完成。Deleted. Specifically, in Figure 1 Gat, the image block crosses the packet boundary and is inefficiently packaged such that the loss of a single packet results in multiple losses. For example, if the packet circle or _4* loses m block, it causes visual artifacts. & In contrast, Figure (4) illustrates the image block encapsulation logic used to wrap image blocks intelligently in a packet to reduce the effects of packet loss. First, image block encapsulation logic 1010 aligns the image block with the packet boundary. Therefore, the boundary between the image blocks Ti, T3, T4, T7, and T2 and the packet bribe 1〇〇5 = standard. The image block encapsulation logic also attempts to combine the image blocks into the packet in a more efficient manner of T's without crossing the packet boundary. Based on the size of each of the image blocks, the image blocks are combined in a packet 1〇〇1; the Τ3 and Τ5 are combined in a packet 1002; the image blocks are combined in a package 1 In 〇〇3; the image block D8 is added to the packet 1〇〇4; and the image block τ2 is added to the packet 1005. Therefore, under this scheme, a single packet loss will result in the loss of no more than 2 image blocks (rather than the 3 image blocks as illustrated in Figure 10a). An additional benefit of the embodiment shown in Figure 10b is that the image blocks are transmitted in a different order in which they are displayed within the scene> image. If the adjacent packet is due to the same event that interferes with the transmission (which will affect the area on the screen that is not close to each other 136720. Doc •91 · 200941233 domain) is missing, this method produces less noticeable artifacts on the display. An embodiment uses forward error correction (FEC) techniques to protect a particular portion of the video stream from channel errors. As is known in the art, techniques such as Reed-Solomon and Viterbi2FEC generate error correction information and attach it to the material transmitted via the communication channel. If an error occurs in the basic data (for example, I frame), FEC can be used to correct the error. 〇 The FEC code increases the data rate of the transmission, so ideally it is used only when it is most needed. If the material is being sent and it will not result in a very noticeable visual artifact, then the FEC code may preferably not be used to protect the material. For example, a p-image block immediately before a lost I-picture block will only produce a 1/60 second visual artifact on the screen (ie, the image block on the screen will not be updated). This visual artifact can hardly be detected by the human eye. As the P image block is further backward from the I image block, the loss of the P image block becomes more and more noticeable. For example, if the image block cycle pattern is used again in the I image block, then one image block is followed by 15 P image blocks, then if the P image block immediately after the I image block is lost, then The image that caused the image block to display an incorrect image lasted for 15 frame times (under 6 inches, it will be 25 milliseconds). The human eye will easily detect a 250 millisecond flow interruption. Therefore, the more the p image block is from the new I image block (that is, the closer the P image block follows the image block), the more noticeable the artifact is. As discussed earlier, in spite of this, in general, the closer a P-picture block follows an I-picture block, the smaller the data used for the P-picture block. Therefore, the p-image block following the I image block is not only protected from loss 136720. Doc -92- 200941233 is more critical' and its size is smaller. In addition, in general, the smaller the information that needs to be protected, the smaller the FEC code needed to protect it. Thus, as illustrated in Figure 11a, in one embodiment, only the image block has an FEC code due to the importance of the I-picture block in the video stream. Therefore, the FEC 1101 contains an error correction code for the 1 video block 1100 and the FEC 1104 contains an error correction code for the I picture block 1103. In this embodiment, no FEC is generated for the p-picture block. In one embodiment illustrated in Figure lib, an FEC code is also generated for P-picture blocks that are most likely to cause visual artifacts when lost. In this embodiment, FEC 1105 provides error correction codes for the first 3 p-image blocks but not for the following p-picture blocks. In another embodiment, an FEC code is generated for the p-image block with the smallest data size (which would tend to be the first Ρ image block that appears after the τ image block, which is most critical for protection). In another embodiment, instead of transmitting the FEC code along with the image block, the image block is transmitted twice, each time in a different packet. If one packet is lost/delayed, another packet is used. In one embodiment shown in Figure lie, fec codes 1111 and 1113 are generated for audio packets 111 and 1112, respectively, for simultaneous transmission from video to the colocation service. Maintaining the integrity of the audio in the video stream is especially important because distorted audio (eg, clicks or clicks) will result in a particularly inconvenient user experience. The FEC code helps ensure that the audio content is reproduced without distortion at the user's end 415. The ν %s玳 tribute is sent together, but the audio data is transmitted twice, each time the mother transmits I36720 without asking the packet. Doc •93- 200941233 If one packet is lost/delayed, another packet is used. In addition, in one embodiment illustrated in FIG. 9D, FEC codes 1121 and 1123 are respectively used for user input commands (eg, button presses) 112〇 and 1122 for uplink transmission from the client terminal 415 to the colocation service 210. . This is important because 'missing button presses or mouse movements in video games or applications can lead to an undesirable user experience. In another embodiment, rather than transmitting the FEC code along with the user input command data, the user input command data is transmitted twice, each time in a different packet. If one packet is lost/delayed, another packet is used. In one embodiment, the colocation service 21 evaluates the quality of the communication channel with the client 415 to determine whether to use the FEC, and if so, determines which portion of the video, audio, and user commands should be applied for FEC. The "quality" of the evaluation channel may include functions such as estimating packet loss, delay, etc. as described above. If the channel is particularly unreliable, the colocation service 21 can apply FEc to all I video blocks, p video blocks, audio and user commands. In contrast, if the channel is reliable, the colocation service 21 can apply FEC only for audio and user commands, or FEC may not be applied to audio or video, or may not use FEC at all. Various other arrangements of FEC applications can be used while still adhering to these basic principles. In an embodiment, the colocation service 210 constantly monitors the status of the channel and changes the policy accordingly. In another embodiment, referring to FIG. 4 & and FIG. 4b, when the packet is lost/delayed, resulting in loss of image block data, or if the packet may be lost due to a particularly bad packet, the FEC cannot correct the lost image. Block data, with 136720. Doc -94 - 200941233 The client 415 evaluates how many frames remain before receiving a new i-picture block and compares it to the round-trip delay from the client 41 5 to the colocation service 210. If the round trip delay is less than the number of the new image block that should arrive at the previous frame, the client 415 sends a message to the colocation service 21 to request a new 1 image block. This message is routed to the video compressor 404, and it does not generate a p-picture block for the image block in which the data has been lost, but instead generates a video block. Assuming that the system shown in Figures 4a and 4b is designed to provide a round trip delay of typically less than 80 milliseconds, this results in the image block being corrected within © milliseconds (at 60 fpS, the frame has a duration of j 6 milliseconds) Therefore, in the full frame time, the 80 millisecond delay will result in 83. The corrected image block within 33 milliseconds, 83. 33 milliseconds is 5 frame times, which is an attractive interruption 'but far less (for example) for 15 frames with 25 milliseconds of interruption being noticeable). When the compressor 404 is out of its normal cyclic order to generate such a block of image blocks, if the I block will cause the bandwidth of the frame to exceed the available bandwidth, the compressor 404 will delay the loop of the other blocks so that The other image blocks receive the P image block during the frame time (even if the image block will normally be an I image block during the frame), and then the usual loop will continue from the next frame, and will usually The jersey block that received the image block in the previous frame will receive the I image block. Although this action temporarily delays the phase of the R frame cycle, it will generally be visually unobtrusive. Video and Audio Compressor/Decompressor Implementation Figure 12 illustrates a particular embodiment in which multiple cores and/or multiple processors 1200 are used to compress eight image blocks in parallel. In an embodiment, it is used in . ...Double-core processing performed at a higher or higher level ^ quad-core and (10) (four) computer 136720. Doc -95- 200941233 System 'Each core as an independent process to implement open source x264 Η. 264 compressor. However, a variety of other hardware/software configurations can be used while still adhering to these basic principles. For example, each of the CPU cores can be implemented by an FPGA. 264 compressor to replace. In the example shown in Figure 12, the core 1201-1208 is used to simultaneously process the image block and the P image block as eight independent threads. As is well known in the art, current multi-core and multi-processor computer systems are inherently integrated with Microsoft Windows XP Professional (64-bit or 32-bit versions) and Linux multi-threaded processing systems. The ground can perform multi-line processing. In the embodiment illustrated in Figure 12, since each of the eight cores is only responsible for one image block, it operates largely independently of the other cores, each performing a separate instantiation of x264. Use a PCI Express xl-based DVI capture card (such as the Sendero video imaging ip development board from Microtronix of Oosterhout in the Netherlands) to capture uncompressed video at 640x480, 800x600 or 1280x720 resolution, and on the card The FPGA uses Direct Memory Access (DMA) to transfer the captured video to the system ram via the DVI bus. The image blocks are configured in a 4x2 configuration 1205 (although this is illustrated as a square image block, in this embodiment 'which has a 160x240 resolution). Each instantiation of x264 is configured to compress one of the eight 160x240 image blocks and is synchronized such that each core enters a loop after initial I image block compression, each frame and another The frame is out of phase' to compress an I image block followed by seven P image blocks, as illustrated in FIG. At each frame time, the resulting pressure is 136720 using the techniques previously described. Doc • 96- 200941233 The reduced image blocks are combined into a packet stream, and then the compressed image block is transmitted to the destination client terminal 4 1 5 . Although not illustrated in Figure 12, if the data rate of the combined 8 image blocks exceeds the specified peak data rate 941, all 8 x264 processes will temporarily suspend the necessary frame time until the 8 for the combination has been transmitted. The data of the image block. In one embodiment, client 415 is implemented as a software executing on 8 instantiated PCs of FFmpeg. The receiving process receives eight image blocks and routes each image block to FFmpeg for instantiation, and FFmpeg instantiates the decompressed image block and reproduces it to the appropriate image block location on display device 422. The client 415 receives the keyboard, mouse or game controller input from the input device driver of the PC and transmits it to the server 402. The server 402 then receives the input device data received by the application and applies it to the game or application executed on the server 402. The server 402 uses Intel 2. The 16 GHz dual-core CPU executes the Windows PC. Server 402 then generates a new frame and outputs the new frame via the DVI output to the motherboard-based graphics ® system or via the DVI output of the NVIDIA 8800GTX PCI Express card. At the same time, the server 402 outputs audio generated by the game or application via its digital audio output (eg, S/PDIF), which is coupled to a dual quad-core Xeon-based PC that implements video compression. Digital audio input. The Vorbis open source audio compressor is used to compress audio simultaneously with video, regardless of the core that can be used to process the thread. In one embodiment, the core of the image block is first compressed to first perform audio pressure 136720. Doc -97- 200941233 Contraction. The compressed audio is then transmitted along with the compressed video and the compressed audio is decompressed at the client 415 using a Vorbis audio decompressor. The colocation service server center distributes light traveling through the glass (such as an optical fiber) at a fraction of the speed of the light in the vacuum, and thus the exact propagation speed of the light in the fiber can be determined. However, in practice, considering the routing delay, transmission inefficiency, and other elapsed time, we have observed that the optimal delay on the Internet reflects a transmission speed that is closer to 50% of the speed of light. Therefore, the optimal 1 mile round trip delay is about 22 milliseconds, and the best 3 mile round trip delay is about (four) milliseconds. Therefore, a single server on the US coast will be too far apart to serve the client on the other coast (which may be up to 3 miles away) with the desired delay. However, as illustrated in Figure 13a, if the colocation service 21 is located at the center of the United States (e.g., Kansas, Nebraska, etc.), the distance to any point in the continental United States is about i5〇〇. ^ Miles or less than 150 miles 'The round trip internet latency can be as low as 32 milliseconds. Referring to Figure 4b, note that although the worst case delay allowed by the user ISP 453 is 25 milliseconds, it is generally observed that in the case of DSL and cable modem systems, a delay of approximately 10-15 milliseconds is observed. Further, Fig. 4b assumes that the maximum distance from the user premises 211 to the colocation center 210 is 1 mile. Thus, in the case of the typical IS5 millisecond user ISp round trip delay used and the maximum internet distance of 15 mile for a 32 millisecond round trip delay, the input device 421 is actuated from the user. The total round trip delay from the moment to the response on the display device 422 is 136,720. Doc -98 · 200941233 1 + 1+ 15+32 + 1+ 16+6+8=80ms. As a result, an 80-millisecond response time is typically achieved over an Internet distance of 15 miles. This will allow any user location in the US mainland with a sufficiently short user ISP delay of 453 to be accessed in a centrally located single server center. In another embodiment illustrated in Figure 13b, the colocation service 21" server centers HS1-HS6 are strategically located around the United States (or other geographic area), a particular larger colocation service server center Positioned close to high population centers (eg, HS2 and HS5). In one embodiment, the server centers G hS1-HS6 exchange f signals via the network 13 (1), and the network 13G1 may be an internet or private network or a combination of the two. In the case of multiple server centers, users with high user Isp delays 453 can be served at lower latency. The distance on the S-Internet is indeed a factor that affects the latency of travel through the Internet, but sometimes other factors that are largely unrelated to latency also work. Sometimes the packet flow is routed to the distance 〇 ^ via the Internet and returned again, resulting in a delay from the long loop. Sometimes there is a routing device on the path that does not operate properly, causing delays in transmission from the towel. There are sometimes traffic that overloads the path, which introduces delays. In addition, sometimes there is a failure to prevent the user's lsp from routing to a given destination. Thus, while the universal Internet usually provides connections from one point to another with fairly reliable and optimal routing and latency, this fairly reliable and optimal route and delay is largely determined by distance ( Especially in the case of long-distance connections that are routed to the outside of the user's local area), but the reliability and delay are not guaranteed and often cannot be 136720. Doc -99· 200941233 The user's place is reached to a given destination on the universal Internet. In one embodiment, when the user client 415 is initially connected to the colocation service 210 to play a video game or use an application, the client initiates and each of the available colocation service server centers HS1_HS6 at startup. One communication (eg 'using the techniques described above). If the delay is low enough for a particular connection, use the connection. In one embodiment, the client and all of the courier service feeders or colocation services are configured to select the colocation service with the lowest latency connection. The client can select the service center with the lowest latency connection, or the server center can identify the server center with the lowest latency connection and provide this information (for example, in the form of an internet address) to the client. The client 415 can be redirected if the specific colocation service server center is overloaded and/or the user's game or application can tolerate the delay to another, less loaded colocation service terminator center. Go to another host agency service center. In this case, the game or application being executed by the user will be temporarily placed on the server 402 at the user's overloaded server center, and the game or application status data will be transferred to another colocation service. The server at the server center is 4〇2. The game or application will then restart. In one embodiment, the colocation service 21 will wait until the game or application reaches a natural pause point (eg, between levels in the game or after the user initiates a "save" operation in the application). Transfer. In yet another embodiment, the colocation service 21 will wait until the user activity ceases for a specified period of time (eg, ^ 136720. Doc -100· 200941233 clock) and the receiver will start transmission at that time. As described above, in one embodiment, the colocation service 210 subscribes to the Internet bypass service 440 of Figure i4 in an attempt to provide a guaranteed delay to its client. The Internet Bypass Service, as used herein, provides a service for private network routes with guaranteed features (e.g., latency, data rate, etc.) from one point to another on the Internet. For example, if the host hosting service 210 is using the AT&T DSL service provided by San Francisco to receive a large amount of traffic from the user (rather than to the central office based on AT&T San Francisco), The colocation service 210 will then lease from the service provider between one or more of the central office based in San Francisco and the server center for the colocation service 210 (possibly AT&T itself or another A high-capacity private data connection for a provider). Then, if all the hosted service server centers HS1-HS6 go through the universal Internet to Sanbu... (7), the route using the user of at&t DSL causes excessive delay, and the shot is changed to use private funds# connection. Although private data connections are usually more expensive than routes over a common Internet, as long as they maintain a small percentage of the colocation service 21 to the user, the total cost impact is low and the user will experience more consistent Service experience. In the event of a power failure, the server center often has two spare power layers. The first layer is typically the backup power from the battery (or from an alternate ready-to-use energy source, such as a flywheel that remains operational and attached to the generator) It immediately supplies power when the mains fails, and keeps the server running. If the power failure is temporary and the mains return quickly (eg 136720. Doc 200941233 For example, within one minute), the battery is required to keep the center of the feeder running. However, if the power failure lasts for a long period of time, the generator (e.g., 'diesel power) is typically activated to replace the battery and the generator can operate as long as it has fuel. These generators are extremely expensive because they must be capable of generating the power typically obtained from the mains of the server. In one embodiment, each of the 'hosting services Cong-HS5 shares user data with each other to have power in a server center _ > pauses in ongoing games and applications' And then the game bite status data is transmitted from each of the feeding machines 4〇2 to the feeding device 402 at the other server center, and then the user is notified to each user to guide the communication to the user. New feeding machine. Assuming that such occasions occur occasionally, the user is transferred to a hosted service server center that is not capable of providing the best latency (ie, the user will only have to tolerate the duration of the higher latency duration power failure (1) may be Accepted, it will allow the user to have a much wider range of options. For example, a user who is on the East Coast of the United States will be able to sleep at 11:3 〇ρΜ Users on the West Coast began to peak in video game usage at 8:3QpMi. If there is a power failure in the hosted service server center on the West Coast, other hosted service server centers may not There are sufficient West Coast Feeding Machines for handling all users. In this case, some users can be transferred to the hosted service feeder center with available feeders 402 on the East Coast, and for The only consequence of the user: will be a higher delay. Once the user loses power from the 5 servers, the server center can then start its server and set 136720. Doc 200941233 is shut down in an orderly manner to shut down all equipment before the battery (or other immediate power backup) is exhausted. In this way, the cost of the generator for the servo center can be avoided. In an embodiment, during the time of severe loading of the colocation service 21 (or due to peak user loading, or because one or more feeder centers fail), based on the game the user is using. Or the application's delay requires the user to be transferred to another server center. Therefore, users of games or applications that require low latency will be given the preference for available low latency server connections with limited © supply. Hosted Hosting Service Features Figure 15 illustrates an embodiment of the components of the server center for the hosted hosting service 210 utilized in the following description of the features. As with the colocation service 210 illustrated in the figure, unless otherwise conditional, the components of the server center are controlled and coordinated by the colocation service 21〇 control system 〇1. The incoming Internet traffic 15〇1 from the user client 415 is directed to the incoming route 1502. Typically, incoming Internet traffic 1501 will enter the server center via a high-speed fiber connection to the Internet, but any network connectivity component with sufficient bandwidth, reliability, and low latency will suffice. Inbound routing 1502 is a network (which can be implemented as an Ethernet, fiber channel network, or via any other transport component) switch and a system that supports the routing servers of the switches, which arrives Packets are routed and routed to the appropriate application/game server 1521_1525. In one embodiment, the 'delivery to a particular application/game server's packet indicates its own usage 136720. Doc -103- 200941233 A subset of the data received by the client and/or can be translated/changed by other components in the data center, such as 'network connection components such as gateways and routers. In some cases, the packet is routed to more than one server 1521-1525 each time, for example, if the game or application is executing concurrently on multiple servers. The RAID arrays 15 11-1512 are connected to the incoming routing network 1502 such that the application/game server 1521_1525 can read the raid arrays 1511-1512 and the write arrays 1511_1512. In addition, an array 1515 (which can be implemented as a plurality of RAID arrays) is also coupled to the routing router 1502' and the data from the RAID array 1515 can be read from the application/game feeders 1521-1525. Incoming routing 15〇2 can be implemented in a variety of prior art network architectures (including tree-structured switches, inbound Internet traffic 15〇1 at its root); in a mesh structure interconnecting all of the various devices Implemented; or implemented as a sub-network sequence of interconnects (concentrated traffic among interworking devices and centralized traffic isolation among other devices). One type of network is configured as S AN, which, although commonly used for storage devices, can also be used for general purpose data transfer between devices. Also, the application/game servers 1521-1525 can each have multiple network connections to the incoming route 15〇2. For example, servers 1521-1525 may have a network connection to a subnet attached to RAID arrays 1511-1512 and another network connection to a subnet attached to other devices. The application/game servers 1521-1525 can be configured identically, somewhat differently, or all differently, as previously described with respect to the server 402 in the embodiment illustrated in the drawings. In one embodiment, each user is typically at least one application/game servo 136720 when using the colocation service. Doc 200941233 1521-1525. For the sake of simplicity of description, it will be assumed that a given user is using the application/game server 1 52 1, but multiple servers can be used by one user, and multiple users can share a single application/game server. 1521-1525. The user's control input sent from the client 415 (as previously described) is received as an incoming Internet service 15〇1 and routed to the application/game server 1521 via the incoming route 1502. The application/game server 1521 uses the user's control input as a control input to the game or application executing on the server and calculates the next frame of the video and © associated audio. The application/game feeder 1521 then outputs the uncompressed video/audio 1529 to the shared video compression 1530. The application/game server can output uncompressed video via any component (including one or more ultra-high speed Ethernet connections), but in one embodiment, the video is output via a DVI connection, and the audio and Other compression and communication channel status information is output via a universal serial bus (USB) connection. Shared Video Compression 1530 compresses uncompressed video and audio from the app/game vocabulary mi·® 1525. This compression can be implemented entirely in hardware or in hardware that executes the software. There may be a dedicated compressor for each application/game server 1521-1525, or if the compressor is fast enough, a given compressor may be used to compress video from more than one application/game server 1521-1525 / Audio. For example, when added, the video frame time is 16. 67 milliseconds. If a compressor is capable of compressing a frame within i milliseconds, then the compressor can be used to compress from up to 16 applications/games 136720 by taking input from one server after the other. Doc • 105· 200941233 1521-1525 video/audio, which stores the state of each video/audio compression process and switches the background as it cycles through the video/audio stream from the server. This results in substantial cost savings for the compressed hardware. Because the different word processors will complete the frame at different times, in one embodiment, the compressor resources are in a shared storage component (eg, RAM, flash memory) having a state for storing each compression process. In the shared pool 1530, and when the server 1521-1525 is complete and ready to be compressed, the control component determines which compressed resource is available at the time, provides the server with the status of the compressed resource and the state to be compressed. Uncompressed video/audio frame. Note that one of the states of the compression process for each server includes information about the compression itself, such as the decompressed frame buffer data of the previous frame (which can be used as a reference for the P image block), Resolution of video output; quality of compression; image block structure; allocation of bits per image block; compression quality, audio format (eg stereo, surround sound, Dolby® AC-3). However, the compression process status also includes information about the following communication channel status: peak data rate 941' and whether the previous frame (as illustrated in the figure) is currently being output (and therefore the current frame should be ignored), and potentially Is there a channel characteristic that should be considered in compression (such as excessive packet loss) affecting compression decisions (eg, in terms of the frequency of I-picture blocks, etc.). Since the peak data rate 941 or other channel characteristics change over time, as determined by the application/game server 1521-1525 that supports each user monitoring the data sent from the client 415, the application/game The server 1521-1525 sends the relevant information to the shared hardware compression 136720. Doc •106· 200941233 1530. The shared hardware compression 1530 also encapsulates the compressed video/audio using components such as those previously described, and, where appropriate, applies the FEC code, copies specific material, or takes other steps to adequately ensure video. The audio data stream is received by the client 4155 and is decompressed with a viable high quality and reliability. Some applications (such as those described below) require the video/audio output of a given application/game server 1521_1525 to be available at multiple resolutions (or in multiple other formats). If the application/game server 1521-1525 thus notifies the shared hardware compression 153 resource, the uncompressed video audio 1529 of the application/game server 1521_1525 will be in a different format, with different resolutions and/or Simultaneous compression in different packet/error correction structures. In some cases, some compression resources may be shared among multiple compression processes that compress the same video/audio (eg, in many compression algorithms) there are steps to scale the image to multiple sizes before applying compression. If you need to output images of different sizes, this step can be used to servo several compression processes at the same time). In other cases, separate compression resources will be required for each format. In any event, the compressed video/audio 1539 for all of the various resolutions and formats required for a given application/game server 1521_1525 (one or more) is simultaneously output to the outgoing route 154(). In the embodiment, the output of the compressed video/audio 1539 is in the sUDp format, so it is a unidirectional packet stream. The outgoing routing network 1540 contains a series of routing feeders and switches, the 136720. Doc 200941233 Series Routing Servers and Switches direct each compressed video/audio stream to the intended user via the outgoing Internet service 1599 interface, which is typically connected to the optical interface of the Internet Other destinations and/or return to delay buffer 1515, and/or return to incoming route 15〇2, and/or output via a private network (not shown) for video distribution. Note (as described below): Outbound Routing 1540 can simultaneously output a given video/audio stream to a destination. In one embodiment, this uses Internet Protocol (IP) multicasting to implement a given O UDP stream intended for simultaneous streaming to multiple destinations, and the broadcast is routed by the outgoing route (10). The feeder and the exchanger are repeated. The plurality of destinations of the broadcast may be via the Internet to the user terminals 415 of the plurality of users, to the plurality of application/game servers 152M525 via the routing route 15〇2, and/or to one or more Delay buffer 1515. Thus, the output of a given feeder 1521_1522 is compressed into one or more formats and each compressed stream is directed to one or more destinations. Additionally, in another embodiment, if multiple application/game feeders 1521-1525 are simultaneously used by a user (eg, in a parallel processing configuration for generating 3D output with complex scenes) and each If a server generates a portion of the obtained image, the video output of the plurality of servers 1521-1525 may be combined into a combined frame by the shared hardware compression 153, and the combined frame is processed as described above from the other side. It seems like it comes from a single application/game server 1521-1525. Note that 'in one embodiment, 'a copy of all video generated by the application/game server 1521-1525 (at least at the resolution of the video viewed by the user or higher resolution) is recorded in the delay buffer Η" The time is up to 136720. Doc -108- 200941233 Less than a certain number of minutes (15 minutes in one embodiment). This allows each user to "rewind" the video from each session to check previous work or performance (in the case of the game). Thus, in one embodiment, each compressed video/audio output 1539 stream routed to user client 415 is also multicast to delay buffer 1515. When the video/audio is stored on the delay buffer 1515, the directory on the delay buffer 1515 provides the network address and delay of the application/game server 152 1-1525, which is the source of the delayed video/audio. A reference between the location of the delayed video/audio © can be found on the buffer 1515. The live, instantly viewable, instantly playable game application/game server 1521-1525 can be used not only to execute a given application or video game of the user, but also to establish support for hosting via the host A user interface application for the hosted service 210 of the navigation and other features of the service. A screen shot of the user interface application is shown in Figure 16 ("Game Viewfinder" screen). This particular *user interface screen allows the user to view 15 games played (or delayed) by other users on the spot. Each of the "thumbnail" video windows (e.g., 1600) is a live video window in motion that displays a video from a user's game. The view shown in the thumbnail may be the same view that the user is looking at, or it may be a delayed view (eg, if the user is playing a fighting game, the user may not want other users to see where they are hidden and It can choose to delay any view of its game play for a period of time (eg '1G minutes). The view can also be a camera view of the game different from the view of any user. The user can pass 136720 based on various criteria. Doc -109- 200941233 Menu selection (not shown in this description) to select the game to be viewed at the same time. As a small sample of exemplary choices, the user may select a random selection of games (such as those shown in Figure 16), all categories of games (both played by different players), only top players of the game, games A player of a given level, or a lower level player (for example, if the player is learning the basics), a player who is a "partner" (or a competitor), a game with the largest number of viewers, and the like. Note that usually, each user will decide whether the video from their game or application © can be viewed by others' and if so, decide which other people can view and when they can be viewed by others, and decide whether the video can only have Viewing β in the case of a delay The application/game server 1521-1525 that produces the user interface screen shown in Figure 16 is being requested from each user (the application/game server 1521-1525 is requesting the use) The application/game server 1521-1525 sends a message to acquire the 15 video/audio feeds. The message is sent via the incoming route 1502 or another network. This message will include the size and format of the requested video/audio and will identify the user viewing the user interface screen. A given user may choose to select the "Piracy" mode and not allow any other user to view the video/audio of their game (from their view point or from another view point)' or as described in the previous paragraph, the user may choose Allow viewing of video/audio from its games, but delay the video/audio being viewed. The user application/game server 1521_1525 (which receives and accepts requests for its video/audio to be viewed) will therefore acknowledge to the requesting server and will also notify the shared hardware compression 153 that 136720 is required. Doc •110· 200941233 Generates an additional compressed video stream of the requested format or screen size (assuming the format and the size of the screen are different from the format and screen size already generated), and it also displays the destination of the compressed video ( That is, if the requested video/audio is only delayed, the requesting application/game server 1521-1525 will be notified as such, and it will be found in the directory on the delay buffer 1515. The location of the video/audio and the network address of the application/game server 1521_1525, which is the source of the delayed video/audio, and the delayed video/audio from the delay buffer 1515. Once all such requests are generated, Processing, the video stream of up to 15 live broadcast thumbnail sizes is routed from the outgoing route 1540 to the incoming route 15〇2, to the application/game server 1521_1525 that generates the user interface screen, and will be served by the servo Decompressed and displayed. The delayed video/audio stream may be oversized, and if so, the application/game server 1521_ 1525 will decompress the The stream is scaled down to the thumbnail size. In one embodiment, the request for audio/video is sent to a central "management" service similar to the "hosted service control system" of Figure (Figure 15 Not shown) (and managed by a central "management" service), the central "management" service then redirects the requests to the appropriate application/game server 1521-1525. Furthermore, in an embodiment, it may not be required Request, because the thumbnails are "pushed" to the users of their users who are allowed to. All of the simultaneously mixed audio from 15 games may produce harsh sounds. The user can choose to mix all the sounds together in this way. (Maybe to get the feeling of "喧嚣" generated by all the actions being viewed), or the user can choose to listen to the audio from one game at a time. Single tour 136720. Doc 111 200941233 The choice of play is done by moving the yellow selection box 1601 to a given game (the yellow frame can be moved by using the arrow keys on the keyboard, by moving the mouse, by moving the joystick or by pushing This is done by a direction button on another device such as a mobile phone. Once a single game is selected, it is only played from the audio of the game. Also, show game information 16〇2. In the context of this game 'for example, the publisher logo (r EA)) and the game logo "Need for Speed Card Canyon" and the orange bar indicate the number of people who play or view the game at a particular time under relative conditions ( In this case, many, so the © game is "hot". In addition, a "status" is provided indicating that there are 8.5 different instantiations in which 145 play players are actively playing Need for Speed games (ie, the game can be played by individual player games or multiplayer games), and there are 68〇 One viewer (this user is one of them). Note that such statistics (and other statistics) are collected by the hosted service control system 4.1 and stored on the RAID arrays 15 11 - 1512 for maintaining the hosted service 21 operations. Used to properly bill users and pay fees to publishers who provide content. - Some statistics are recorded as a result of actions performed by service control system 40, and some statistics are served by individual applications/games. The switches 1521-1525 report to the service control system 401. For example, when the game is being viewed (and when the game is stopped viewing), the application/game server 152 executing the game viewfinder application 152 1525 sends a message to the colocation service control system 401 to enable The colocation service control system 401 can update how many games are in the view of the statistics. Some statistics can be used by user interface applications such as this game viewfinder application. 136720. Doc -112- 200941233 If the user clicks the start button on their input device, they will see the thumbnail video in the yellow box and the thumbnail video will be live broadcast to full screen size. This effect is shown in the process of Figure 17. Note that the size of the video window 1700 is increased. In order to implement this effect, the application/game server 1521-1525 requests the full screen size of the game routed to it from the application/game server 1521-1525 executing the selected game (by the user's display device 422) Resolution of the video stream. The game-enabled application/game server 1521-1525 notifies the shared hardware compressor 1530 that a copy of the thumbnail size of the game is no longer needed (unless another application/game server 1521-1525 requires such a thumbnail), And then it directs the shared hardware compressor 1530 to send a copy of the full screen size of the video to the application/game server 1521_1525 that amplifies the video. The user playing the game may or may not have a display device 422 having the same resolution as the display device of the user who zooms in on the game. In addition, other viewers of the game may or may not have the same display 422 as the user who zoomed in on the game (and may have different audio playback components, such as stereo or surround sound). Therefore, the shared hardware compressor 153 determines whether a suitable compressed video/audio stream that satisfies the requirements of the user requesting the video/audio stream has been generated, and if the appropriate compressed video/audio stream does exist, the shared hard The volume compressor 1530 notifies the routing 1540 to route the duplicate of the stream to the application/game server 1521_1525 that amplifies the video, and if the appropriate compressed video/audio stream does not exist, the compressed video is suitable for the user. Another copy of the application/game server 1521_1525 that directs the routing to send the stream back to the incoming route 1502 and the video. 136720. Doc -113· 200941233 This server that now receives the full screen version of the selected video will decompress the full screen version and gradually scale it up to full size. Figure 18 illustrates how the screen looks after the game is fully enlarged to full screen and the game is displayed at full resolution of the user's display device 422 (as indicated by the image pointed by arrow 1 800). The application/game server 1521-1525 executing the game viewfinder application sends a message to other application/game servers 1521-1525 that provide thumbnails to indicate that the thumbnails are no longer needed and host the service control servo to the host 4〇1 sends a message to © means that no other games are viewed. At this point, the only display that appears is the top overlay of the top of the screen, which provides information and menu controls to the user. Note that as the game progressed, the audience grew to 2, 5, 3 viewers. In the case of so many viewers, there are necessarily many viewers with display devices 422 that have the same or close resolution (each application/game server 1521-1525 has a proportionally adjusted video) For the ability to adjust the fit). 〇 Because the game shown is a multiplayer game, the user can decide to join the game at some point. The colocation service 21 may or may not allow users to join the game for a variety of reasons. For example, the user may have to pay for the game and choose not to pay, the user may not have enough levels to join the particular game (eg, for other players, it will not be competitive), or use The Internet connection may not have a sufficiently low latency to allow the user to play (for example, there is no latency constraint for viewing the game, so the view can be viewed remotely without delay (actually, Play on another continent), but for 136720. Doc -114- 200941233 For games to play, the delay must be low enough for the user (a) to enjoy the game' and (b) to be in the same position as other players who may have lower latency connections. If the user is not allowed to play, the application/game server 152ΐ_ι525 providing the user interface of the game viewfinder user interface will request the host escrow service to control the feeding machine 4 0 1 start (ie, 'position and start) An application/game server 1 52 J _ 1525 suitably configured to play a particular game to load the game from the RAID arrays 1511-1512, and then the colocation service control server 401 will direct the routing 1502 Transfer the control signal from User© to the application/game server of the current hosted game and now the hosted game application/game server will guide the shared hardware compression 1530 self-compression from the hosted game viewfinder The video/audio of the application/game server of the app is switched to compress the video/audio of the app/game pad from the current hosted game. The vertical synchronization of the game viewfinder application/game service with the new application/game server of the colocation game is not synchronized, and thus there may be a time lag between the two synchronizations. Since the shared video compression hardware 1530 will begin to compress the video after the application/game server 1521-1525 completes the video frame, the first frame from the new server can be completed earlier than the full frame time of the old server. The first frame from the new server may be before the transmission is completed by the previously compressed frame (for example, consider the transmission time of GPU: 992: if the uncompressed frame 3 963 is completed earlier than the frame time In half, it will impact transmission time 992). In this case, the shared video compression hardware 1530 will ignore the first frame from the new server (e.g., ignore (974) frame 4 964), and the client 41 5 will come from the old servo 136720. Doc -115- 200941233 The last frame of the device maintains an extra frame time, and the shared video compression hardware 1530 will begin to compress the next frame time video from the new application/game server of the colocation game. For the user, the transition from one application/game server to another application/game server will be visually seamless. The colocation service control server 4 then switches the application/game server 1521·1525, which has notified the courier game viewfinder, to the idle state until it is needed again. The user can then play the game. In addition, the 'exceptional game will be played immediately on the Sense© (because the game has been loaded from the 1^1 car column 1511-512 to the app/game server 1521_1525 at a rate of one billion bits per second). ), and the game will be loaded with the ideal drive, register configuration (in the case of wind WS2) along with the operating system configured for the game to the server that is exactly suitable for the game Other applications that are not likely to compete with the operation of the game are executed on the server. Also, as the user progresses through the game, each of the segments of the game will be loaded at a rate of one billion bits per second (i.e., loaded in 8 seconds and one billionths) from the ® RaID array 1511· The 1512 is loaded into the server and due to the huge storage capacity of the RAm array 1511-15 12 (because it is a shared resource for many users, it can be very large, but still cost effective), allowing pre-computed geometry settings Or other game clip settings and store them on the RAID arrays 1511-1512 and load them very quickly. In addition, because the hardware configuration and computational capabilities of each application/game servo n 1521_1525 are known, pixel and vertex shading can be pre-computed. Therefore, the game can be launched almost instantly, it will be executed in an ideal environment, 136720. Doc -116 - 200941233 and the subsequent clips will be loaded almost instantly. However, in addition to these advantages, the latter will be able to view other people playing the game (via the previously described game viewfinder, and other components), and both determine whether the game is interesting, and if so, then watch others. Learning skills. In addition, the user will be able to present the game instantly without having to wait for a large download and/or installation, and the user will be able to play the game instantly (perhaps on a less expensive trial basis or on a longer term basis) . In addition, the user will be able to play the game on a windyws © PC, Macintosh, on a television, at home, on the go, and even on a mobile phone with a sufficiently low latency no-wire connection. In addition, this can be done without having a copy of the game.
如先前所敍述,使用者可決定不允許其遊戲播放可被他 人檢視允許其遊戲可在延遲之後檢視,允許其遊戲可被 選定使用者檢視,或允許其遊戲可被所有使用者檢視。不 β怎樣在實施例中,將視訊/音訊儲存於延遲緩衝器 1515中歷時15分鐘,且使用者將能夠「回倒」並檢視其先 前的遊戲播放,且將遊戲暫停,將遊戲緩慢地回放,將遊 戲快進等,正如其在觀看具有數位視訊記錄器(DVR)之τν 時所能夠進行的。儘管在此實例中,使用者係在玩遊戲, 但若使用者正使用應用程式,則相同「DVR」能力係可用 的。此在核查先前工作中及在如下詳述之其他應用中可係 有用的。另外,若遊戲經設計為具有基於利用遊戲狀態資 訊而回倒之能力,以便可改變相機視圖等,則亦將支援此 「3D DVR」能力,但其將需要將遊戲設計為支援「3D 136720.doc -117- 200941233 賺」能力。使用延遲緩衝器1515之「嫩」能力將連同 任何遊戲或應用程式(當然,限於在使用遊戲或應用程式 時所產生的視訊)一起起作用,但在具有3D 〇¥11能力之遊 戲的狀況下,使用者可控制先前所播放之片段的3〇「穿 越」’且使延遲緩衝器1515記錄所得視訊並記錄遊戲片段 之遊戲狀態。因此’將特定「穿越」記錄為經壓縮之視 讯,但因為亦將記錄遊戲狀態,所以不同的穿越將可能在 遊戲之同一片段之稍後日期。 如下所述,主機代管服務210上之使用者將各自具有一 使用者頁面,在該使用者頁面中,使用者可公布關於其本 身之資訊及其他資料。使用者將能夠公布之事情之一為來 自其已保存之遊戲播放之視訊片段。舉例而言,若使用者 已克服遊戲中之特別困難之挑戰,則使用者可剛好「回 倒」至其在遊戲中獲得其大成果之地點之前,且接著指導 主機代管服務210將某一持續時間(例如,3〇秒)之視訊片段 保存在使用者之使用者頁面上以供其他使用者觀看。為實 施此’使用者正使用之應用程式/遊戲伺服器1521_1525僅 要做的事情係將儲存於延遲緩衝器1515中之視訊回放至 RAID陣列1 5 11 -1 5 12且接著將彼視訊片段編索引於使用者 之使用者頁面上》 若遊戲具有3D DVR之能力’如上所述,則亦可由使用 者來記錄3D DVR所需之遊戲狀態資訊且使其為使用者之 使用者頁面可用。 在遊戲經設計為除具有活躍玩家外亦具有「旁觀者」 136720.doc 118- 200941233 (亦即,能夠在不參與的情況下在3D世界行進並觀察到動 作的使用者)的情況下,則遊戲取景器應用程式將使使用 者能夠作為旁觀者以及玩家加入遊戲。自檢視之實施點 看,對於主機代管系統210而言,使用者為旁觀者而非活 躍玩豕不存在差異。將遊戲載入應用程式/遊戲飼服器 1521 1525上且使用者將控制該遊戲(例如,控制檢視世界 之虛擬相機)。唯一差異將係使用者之遊戲體驗。 多個使用者合作 主機代管服務210之另一特徵係多個使用者在檢視現場 直播之視訊的同時合作的能力(即使使用迥然不同之器件 來檢視亦如此)。當玩遊戲時及當使用應用程式時,此均 有用。 許多PC及行動電話裝備有視訊相機且具有進行即時視訊 壓縮之能力(尤其當影像小時P又,小相機可用,可附接 至電視,且以軟體或使用用於壓縮視訊之許多硬體壓縮器 件中之一者來實施即時壓縮並不困難。又,許多pc及所有 行動電話具有麥克風,且耳機在具有麥克風情況下可用。 組合有本端視訊/音訊壓縮能力(特定言之,使用本文中 所描述之低延時視訊壓縮技術)之該等相機及/或麥克風將 使使用者能夠將視訊及/或音訊連同輸入器件控制資料一 起自使用者場所211傳輸至主機代管服務21〇。當使用該等 技術時,則可達成圖19中所說明之能力:使用者可使其視 訊及音訊19GG出現於另—使用者之遊戲或應用程式内的勞 幕上。此實例為多人遊戲,纟中隊友在賽車中合作。使用 136720.doc -119- 200941233 者之視訊/音訊僅可被其隊友選擇性地檢視/聽到,此外, 因為使用上文所描述之技術將有效地不存在延時,所以玩 家將能夠即時地彼此談話或進行運動而無可感知的延遲。 此視訊/音訊整合係藉由使來自使用者之相機/麥克風的 經壓縮視訊及/或音訊作為入埠網際網路訊務1501到達而 完成。接著,入埠路由1502將該視訊及/或音訊路由至被 准許檢視/聽到視訊及/或音訊之應用程式/遊戲伺服器 1521-1525。接著’選擇使用視訊及/或音訊之各別應用程 ® 式/遊戲伺服器I52的使用者解壓縮視訊及/或音訊且 視需要而將其整合以出現於遊戲或應用程式内,諸如藉由 1900所說明的。 圖19之實例展示如何在遊戲中使用該合作,但該合作可 為用於應用程式之極其強大的工具。考慮一情形:其中一 大建築物正由在芝加哥的建築師為以紐約為基地之房地產 開發商為紐約市設計,但該決策涉及在行進中且碰巧處於 ❹邁阿密機場之財務投資者,且需要關於建築物之特定設計 要素(在其如何搭配其附近之建築物方面)進行決策,以滿 足投資者與房地產開發商兩者。假定建築公司在芝加哥具 有具有附接至PC之相機的高解析度監視器,房地產開發商 在紐約具有具有相機的膝上型電腦,且投資者在邁阿密具 有具有相機的行動電話。建築公司可使用主機代管服務 210來主機代管能夠高度逼真3D再現的強大的建築設計應 用程式’且其可利用紐約市之建築物之大資料庫,以及正 設計的建築物之資料庫。建築設計應用程式將在應用程式/ 136720.doc -120- 200941233 遊戲伺服器1521-1525中之一者上(或若其需要大量計算能 力,則在若干者上)執行。處於全異位置處之3個使用者令 之每一者將連接至主機代管服務21〇,且每一者將具有對 建築設計應用程式之視訊輸出的同時檢視,但其將被針對 每一使用者具有的給定器件及網路連接特性而由共用硬體 壓縮1530適當地定大小(例如,建築公司可經由2〇商 用網際網路連接看見256〇xl44〇 6〇 fps顯示,紐約之房地 產開發商可經由其膝上型電腦上之6 Mbps 〇乩連接看見 © 1280x720 60 fps影像,且投f者可經由#㈣mu 250 Kbps蜂巢式資料連接看見32〇χΐ8〇 6〇 fps影像卜每一 方將聽到其他方之語音(將藉由應用程式/遊戲伺服器i52i_ 1525中的許多廣泛可用之會議呼叫套裝軟體中之任一者來 處理會議呼叫)’且經由使用者輸入器件上之按鈕之致 動,使用者將能夠使用其本端相機使視訊出現。隨著會議 =行,建築師將能夠藉由極具照片般逼真感之3D再現展示 泛當其使建築物旋轉且使其鄰接該區域中之另一建築物穿越 時建築物看起來像什麼,且所有方均將在各方之顯示器件 解析度下1"見到相同視訊。由任何方使用之本端器件中 之任一者均能夠以該真實感處理3D動畫不係問題,更不用 說下載或甚至儲存再現紐約市之周圍建築物所需的巨大資 庫自使用者中之每一者的觀點看,儘管距離很遠,且 儘管係全異本端器件,但其將簡單地在難以 程度下具有無縫體驗。此外,當一方希望其面部被=較 佳地傳達其情緒狀態時,其可如此進行。另外,若房地產 136720.doc -121 - 200941233 開發商或投資者希望控制建築程式且使用其自身的輸入器 件(其為鍵盤、滑氣、小鍵盤或觸摸榮幕),則其可Γ此 且其可以無感知的延時來回應(假定其網路連接不且有不 :理的延時)。舉例而言,在行動電話之狀況下;:: 電話連接至機場之侧網路,則其將具有非常低之延時。 但若其使用美關今可用之蜂m制路 ❹As previously stated, the user may decide not to allow his game play to be viewed by others to allow his game to be viewed after a delay, to allow his game to be viewed by a selected user, or to allow his game to be viewed by all users. In the embodiment, the video/audio is stored in the delay buffer 1515 for 15 minutes, and the user will be able to "rewind" and view his previous game play, and pause the game to slowly play back the game. Fast forward the game, etc., as it can be seen while watching τν with a digital video recorder (DVR). Although the user is playing the game in this example, the same "DVR" capability is available if the user is using the application. This may be useful in verifying previous work and in other applications as detailed below. In addition, if the game is designed to have the ability to fall back based on the use of game state information, so that the camera view can be changed, etc., the "3D DVR" capability will also be supported, but it will need to design the game to support "3D 136720. Doc -117- 200941233 earning ability. The "nen" ability to use the delay buffer 1515 will work in conjunction with any game or application (of course, limited to the video generated when using a game or application), but in the case of a game with 3D 11¥11 capability. The user can control the 3" "traversal" of the previously played clip and cause the delay buffer 1515 to record the video and record the game state of the game segment. Therefore, the specific "traversal" is recorded as compressed video, but since the game state will also be recorded, different crossings may be at a later date in the same segment of the game. As described below, users on the colocation service 210 will each have a user page where the user can post information about himself and other materials. One of the things that the user will be able to announce is a video clip from a game that has been saved. For example, if the user has overcome the particular difficulty of the game, the user may just "rewind" to the location where he or she has achieved great results in the game, and then instruct the colocation service 210 to Video clips of duration (eg, 3 seconds) are saved on the user's user page for viewing by other users. The only thing to do to implement the application/game server 1521_1525 that the user is using is to play back the video stored in the delay buffer 1515 to the RAID array 1 5 11 -1 5 12 and then edit the video clip. Indexed on the user's user page "If the game has 3D DVR capabilities" as described above, the user can also record the game state information required by the 3D DVR and make it available to the user's user page. In the case where the game is designed to have "bystanders" in addition to active players, 136720.doc 118- 200941233 (that is, users who can travel in the 3D world without observing and observe the action) The game viewfinder app will enable users to join the game as a bystander and player. From the point of view of the self-examination, there is no difference in the way that the host is a bystander rather than an active player. Load the game onto the app/game pad 1521 1525 and the user will control the game (eg, control the virtual camera viewing the world). The only difference will be the user's gaming experience. Multiple User Collaboration Another feature of the colocation service 210 is the ability of multiple users to collaborate while viewing live video (even with very different devices for viewing). This is useful when playing games and when using an application. Many PCs and mobile phones are equipped with video cameras and have the ability to perform instant video compression (especially when image hours are small, small cameras are available, can be attached to the TV, and many hardware compression devices for compressing video or using video compression) One of them is not difficult to implement instant compression. In addition, many PCs and all mobile phones have microphones, and the headphones are available with a microphone. The combination has local video/audio compression capabilities (specifically, use this article The cameras and/or microphones of the described low latency video compression technology will enable the user to transmit video and/or audio along with the input device control data from the user premises 211 to the colocation service 21 . When the technology is used, the ability illustrated in Figure 19 can be achieved: the user can have his video and audio 19GG appear on the screen of another user's game or application. This example is a multiplayer game. Teammates collaborate in the car. The video/audio of 136720.doc -119- 200941233 can only be selectively viewed/heard by their teammates. Since there is effectively no delay in using the techniques described above, the player will be able to talk to each other or exercise without noticeable delays in real time. This video/audio integration is achieved by taking the camera/microphone from the user. The compressed video and/or audio is completed as an incoming Internet service 1501. The incoming route 1502 then routes the video and/or audio to an application/game that is permitted to view/hear video and/or audio. Servers 1521-1525. Then select the user of the respective application/game server I52 using video and/or audio to decompress the video and/or audio and integrate it as needed to appear in the game or application. Within the program, such as illustrated by 1900. The example in Figure 19 shows how to use the collaboration in a game, but the collaboration can be an extremely powerful tool for the application. Consider a situation where one large building is being The architect in Chicago designed the New York City for a New York-based real estate developer, but the decision involved the move and happened to be at the Miami Airport Investors, and need to make decisions about specific design elements of the building (how they relate to the buildings in the vicinity) to meet both investors and real estate developers. Assume that the construction company has attached to the PC in Chicago. High-resolution cameras for cameras, real estate developers have laptops with cameras in New York, and investors have mobile phones with cameras in Miami. Construction companies can use colocation services 210 to host highly realistic A powerful architectural design application for 3D reproduction' and its access to a large database of buildings in New York City and a library of buildings being designed. The architectural design application will be available in the application / 136720.doc -120- 200941233 Execution is performed on one of the game servers 1521-1525 (or on several if it requires a large amount of computing power). Each of the three user orders at the disparate location will be connected to the colocation service 21, and each will have a simultaneous view of the video output of the architectural design application, but it will be targeted for each The user has a given device and network connectivity characteristics that are appropriately sized by the shared hardware compression 1530 (for example, a building company can see 256 〇 xl 44 〇 6 〇 fps display via a 2 〇 commercial internet connection, New York Real Estate Developers can see © 1280x720 60 fps images via a 6 Mbps connection on their laptops, and they can see 32〇χΐ8〇6〇fps images via the #(四)mu 250 Kbps cellular data connection. Hearing other parties' voices (which will be handled by any of the many widely available conference call suite software in the application/game server i52i_ 1525) and actuated via a button on the user input device Users will be able to use their local camera to make video appear. With the conference = line, the architect will be able to showcase the architecture through a photorealistic 3D rendering Rotate and make it look like what the building looks like when another building in the area traverses, and all parties will see the same video at the display resolution of each party. The local end used by any party Any one of the devices can handle 3D animation with this realism without problems, let alone download or even store the huge library needed to reproduce the surrounding buildings in New York City from the point of view of each of the users. Although it is far away, and although it is a disparate native device, it will simply have a seamless experience at a difficult level. Furthermore, when one wants its face to be better able to convey its emotional state, it can do so In addition, if the real estate 136720.doc -121 - 200941233 developer or investor wants to control the building program and use its own input device (which is keyboard, slippery, keypad or touch glory), then it can be It can respond without a perceived delay (assuming its network connection is not and has a reasonable delay). For example, in the case of a mobile phone;:: The phone is connected to the side of the airport, then its It has a very low latency. But if it is manufactured using bee m Lumei now available off the ❹
將遭受引人注意的滞後。但是,對於會議之大多數目的 (其中投資者正觀看建築師控制建築物穿越或正談論視訊 電話會議),甚至蜂巢式延時亦應係可接受的。 最後,在合作性會議呼叫結束時,房地產開發商及投資 者將進行其評論且自主機代管服務停播,建築公司將能夠 「回倒」已記錄於延遲緩衝器1515上之會議的視訊且核查 在會議期間進行的應用於建築物之3D模型的評論、面部表 情及/或動作。若存在其希望保存之特定片段,則可將視 訊/音訊之彼等片段自延遲緩衝器1515移動至raid陣列 1511-1512以用於檔案儲存及稍後回放。 又,自成本觀點看,若建築師僅需要使用紐約市之計算 能力及大資料庫歷時15分鐘之會射叫,則其僅需要支付 該等資源被使用之時間的費肖,而不必擁有高能力之工作 台且不必購買大資料庫之昂貴複本。 視訊豐富之社區服務 主機代管服務210致能用於在網際網路上建立視訊豐富 之社區服務的空前機會。圖2〇展 上之遊戲玩家的例示性使用者頁 示用於主機代管服務21〇 面。如同遊戲取景器應用 136720.doc -122- 200941233 程式一樣’使用者頁面為在應用程式/遊戲伺服器1521_ 1525中之一者上執行的應用程式。此頁面上之所有縮略圖 及視訊窗展示恆定地移動的視訊(若片段短,則其循環)。 使用視訊相機或藉由上載視訊,使用者(其用戶名為 「KILLHAZARD」)能夠公布其本身之視訊2〇〇〇(其他使用 者可檢視該視訊ρ該視訊儲存於rAID陣列1511-1512上。 又’當其他使用者來到KILLHAZARD之使用者頁面時,若 KILLHAZARD此時正使用主機代管服務21〇,則將展示其 正進行的無論什麼的現場直播之視訊2〇〇1(假定其准許檢 視其使用者頁面之使用者觀看其)。此將由主機代管使用 者頁面應用程式之應用程式/遊戲伺服器152ΐ_ι 525自服務 控制系統401请求KILLHAZARD是否為活躍的(且若如此, 則請求其正使用的應用程式/遊戲伺服器1521_1525)來完 成。接著,使用由遊戲取景器應用程式使用之相同方法, 將合適解析度及格式的經壓縮視訊流發送至執行使用者頁 面應用程式之應用程式/遊戲伺服器1521-1525且將其顯 示。若使用者選擇具有KILLHAZARD之現場直播之遊戲播 放的窗口且接著適當地單擊其輸入器件,則該窗口將放大 (再次使用與遊戲取景器應用程式相同之方法),且現場直 播之視訊將以觀看使用者之顯示器件422的解析度(適合於 觀看使用者之網際網路連接的特性)填充螢幕。 此優於先前技術方法之關鍵優點係:檢視使用者頁面之 使用者能夠看見使用者不擁有的現場直播地播放的遊戲, 且可不具有能夠玩該遊戲之本端電腦或遊戲控制台。其為 136720.doc -123- 200941233 使用者提供看使用者頁面中展示為「活動中」的使用者玩 遊戲之極好機會,且其為瞭解檢視使用者可能希望嘗試戋 較擅長之遊戲的機會。 來自KILLHAZARD之搭檔2002之相機記錄的或上載的視 訊剪輯亦展示於使用者頁面上,且每一視訊剪輯之下方為 指示該搭擋是否線上玩遊戲之文字(例如,six—sh〇t正玩遊 戲「龍騎士(Eragon)」且MrSnuggles99離線等)。藉由單擊 選單項(未圖示)’搭標視訊剪輯自展示已記錄的或上載的 ® 視訊切換至當前正玩主機代管服務210上之遊戲之搭檔在 彼時刻在其遊戲中正在進行的内容的現場直播之視訊。因 此,其變成為搭檔分群的遊戲取景器。若選擇搭檔之遊戲 且使用者單擊該遊戲’則該遊戲將放大至全螢幕,且使用 者將能夠觀看全螢幕現場直播地播放的遊戲。 再次’檢視搭檔之遊戲之使用者不擁有遊戲之複本,亦 不擁有用於玩該遊戲之本端計算/遊戲控制台資源。遊戲 檢視係有效瞬時的。 〇 如上文先前所描述,當使用者玩主機代管服務210上之 遊戲時,使用者能夠「回倒」遊戲且發現其希望保存之視 訊片段,且接著將該視訊片段保存至其使用者頁面。此等 被稱為「自賞剪輯(Brag Clip)」。視訊片段2003均為由 KILLHAZARD自其所玩的先前遊戲保存的自賞剪輯2〇〇3。 數字2004展示自賞剪輯已被檢視多少次,及自賞剪輯何時 被檢視’使用者具有對其評定等級之機會,且橙色鑰匙孔 形狀的圖示2005之數目指示等級係多高。當使用者檢視使 136720.doc -124- 200941233 用者頁面時,自賞剪輯2003連同頁面上之其餘視訊一起恆 定地循環。若使用者選擇並單擊自賞剪輯2〇〇3中之一者, 則其放大以呈現自賞剪輯2003,以及允許播放、暫停、回 倒、快進、步進等該剪輯之DVR控制。 自賞剪輯2003回放係藉由應用程式/遊戲伺服器1521_ 1525載入使用者記錄自賞剪輯時儲存於rAIE)陣列15 i_ 15 12上的經壓縮視訊片段且將其解壓縮並將其回放來實 施。 © 自賞剪輯2003亦可為來自支援3D DVR能力之遊戲的 3 D DVR」視訊片段(亦即,來自可被重放且允許使用者 改變相機檢視點之遊戲的遊戲狀態序列)„在此狀況下, 除使用者在記錄遊戲片段時進行的特定「穿越」的經壓縮 視訊記錄之外,亦儲存遊戲狀態資訊。當使用者頁面正被 檢視且所有縮略圖及視訊窗均恆定地循環時,3D dvr自 賞剪輯2003將使在使用者記錄遊戲片段之「穿越」時記錄 ❹ 為經壓縮視訊的自賞剪輯2003恆定地循環。但是,當使用 者選擇3D DVR自賞剪輯2003並單擊3D DVR自賞剪輯2〇〇3 時,除允許播放經壓縮視訊自賞剪輯的DVR控制之外,使 用者將能夠單擊給出其用於遊戲片段之3D DVR能力的按 鈕。其將能夠獨立地控制遊戲片段期間的相機「穿越」, 且若其希望(且擁有使用者頁面的使用者如此允許),則其 將能夠以經壓縮視訊之形式記錄替代性自賞剪輯「穿 越」,替代性自賞剪輯「穿越」將接著可為使用者頁面之 其他檢視者所用(立即地,或者在使用者頁面之擁有者具 I36720.doc •125· 200941233 有核查自賞剪輯之機會之後)。 此3D DVR自賞剪輯2003能力係藉由啟動將要在另一應 用程式/遊戲伺服器152卜1525上重放已記錄之遊戲狀態資 訊的遊戲來啟用。因為遊戲可被幾乎瞬時地啟動(如先前 所描述),所以啟動其(其播放限於由自賞剪輯片段記錄之 遊戲狀態)且接著允許使用者在將經麗縮視訊記錄至延遲 緩衝器1515的同時用相機進行「穿越」並不困難。一旦使 用者完成進行「穿越」,則將遊戲撤銷啟動。 © 自使用者之觀點看,啟動具有3D DVR自賞剪輯2003之 「穿越」並不比控制線性自賞剪輯2〇〇3之Dvr控制難。其 可不知道該遊戲或甚至不知道如何玩該遊戲。其僅為盯著 看另一操作者記錄的遊戲片段期間之3D世界的虛擬相機操 作者。 使用者將亦能夠將其自身的音訊加錄於自賞剪輯上(或 者自麥克風記錄或者上載)。以此方式,可使用自賞剪輯 來使用來自遊戲之人物及動作產生定製動畫。此動晝製作 技術通常被稱為「遊戲電影(machinima)」。 隨著使用者在遊戲中進展,其將達成不同技能級別。所 播放之遊戲將成果報告給服務控制系統4〇丨,且此等技能 級別亦將展示於使用者頁面上。 互動式動畫廣告 線上廣告已自文字轉變至靜態影像、視訊,且現在轉變 至互動式片段,通常係使用如Adobe Flash之動畫精簡型用 戶端來實施。使用動晝精簡型用戶端之原因在於:使用者 136720.doc -126- 200941233 通节對於因向其推銷產&或服務之特權而被延遲較無耐 心。又,精簡型用戶端在非常低效能之PC上執行,且因此 廣告商可具有高度信心:互動式廣告將適當地工作。遺懷 地,諸如Adobe Flash之動畫精簡型用戶端在互動性之程度 及體驗(以減少下載時間)之持續時間上受限制。 圖21說明一互動式廣告,其中使用者將在汽車在陳列室 中旋轉時選擇汽車之外部及内部色彩,同時即時射線追縱 展不汽車看起來如何^接著使用者選擇化身來駕駛汽車, © 且接著使用者可採用該汽車來用於在競赛軌道上或者穿過 諸如M〇naco之外國場所駕駛。使用者可選擇較大引擎或較 佳輪胎,且接著可看見改變的組態如何影響汽車加速或保 持穩定之能力。 當然’廣告有效地的為尖端的3D視訊遊戲。但對於可在 PC或視訊遊戲控制台上播放之此種廣告,其將需要可能 100 MB下載,且在pc之狀況下,其可能需要安裝特殊驅 ❹ 動器,且可能在PC缺乏足夠CPU或GPU計算能力時根本不 執行。因此,該等廣告在先前技術組態中不切實際。 在主機代管服務210中,該等廣告幾乎即刻地投放,且 較佳地執行,無論使用者之用戶端415能力如何。因此, 其比精簡型用戶端互動式廣告更迅速地投放,體驗上更加 豐富,且高度可靠。 即時動畫期間串流幾何形狀 RAID陣列15 11-15 12及入琿路由1502可提供如此快之資 料速率且具有如此低之延時’以致有可能設計依賴於 136720.doc -127· 200941233 RAID陣列1511-15 12及入埠路由15〇2來在即時動晝(例如, 具有複雜資料庫之穿越)期間於遊戲播放之中間或應用程 式中可靠地直接遞送幾何形狀的視訊遊戲及應用程式。 在先前技術系統(諸如,圖丨中所展示之視訊遊戲系統) 下,可用的大量儲存器件(尤其是在實用的家庭器件中)極 緩慢以致不能在遊戲播放期間串流幾何形狀(除了所需之 幾何形狀稍微可預測的情形之外舉例而言,在存在指 定道路之駕駛遊戲中,可合理地適當預測用於進入視野内 © 之建築物的幾何形狀且大量儲存器件可提前搜尋即將到來 的幾何形狀所定位的位置。 但在具有不可預測之改變的複雜場景中(例如,在周圍 具有複雜人物之戰役場景中)’若PC或視訊遊戲系統上之 RAM完全被填滿用於當前在視圖中之物件的幾何形狀,且 接著使用者突然將其人物轉向以檢視其人物之後為何,若 未將幾何形狀預先載入RAM中’則可能在可顯示幾何形狀 之前存在延遲。 在主機代管服務210中,RAID陣列1511-1512可以超過超 同速乙太網路速度之速度串流資料,且在san網路下,有 可月b達成優於1 0個十彳.¾位7L乙太網路或優於其他網路技術 的100億位元/秒之速度。1〇〇億位元/秒將在小於一秒内載 入十億位元組之資料。在60 fps圖框時間(16.67毫秒)内, 可載入約170百萬位元(21 MB)之資料。當然,甚至在 RAID組態中,旋轉媒體亦仍將招致大於一圖框時間之延 時,但以快閃記憶體為基礎之RAID儲存器最終將與旋轉 136720.doc -128- 200941233 媒體RAID陣列一般大且將不會招致該高延時。在一實施 例中,使用經由大量RAM寫入之快取來提供非常低延時之 存取。 因此,在足夠高之網路速度,以及足夠低延時的大量儲 存器下,可與CPU及/或GPU可處理3D資料一般快地將幾 何形狀串流至應用程式/遊戲伺服器152卜1525中❶因此’ 在先前所給出的實例中,其中使用者突然將其人物轉向且 向後看,可在人物完成旋轉之前載入其身後的所有人物之 〇 幾何形狀,且因此,對於使用者而言,將看來似乎其處於 與現場直播之動作一般真實的照片般逼真的世界中。 如先前所論述,照片般逼真的電腦動畫中之最後的邊界 中之一者為人面部,且由於人眼對於不完全性之敏感性’ 來自照片般逼真的面部之最輕微錯誤可導致來自檢視者之 負面反應。圖22展示使用Contour™真實性俘獲技術(以下 同在申請中之申請案的主題:2004年9月15日申請之第 10/942,609 號「Apparatus and method for capturing the ❿ motion of a performer」;2004年9月15曰申請之第 10/942,413 號「Apparatus and method for capturing the expression of a performer」;2005 年 2月 25 曰申請之第 11/066,954號 r Apparatus and method for improving marker identification within a motion capture system」;2005 年 3 月 10 曰申請之第 11/077,628 號「Apparatus and method for performing motion capture using shutter synchronization」; 2005 年 10 月 20 日申請之第 11/255,854 號「Apparatus and 136720.doc -129- 200941233 method for performing motion capture using a random pattern on capture surfaces」;2006 年 6月 7 曰申請之第 11/449,131 號「System and method for performing motion capture using phosphor application techniques」; 2006 年 6 月 7 日申請之第 11/449,043 號「System and method for performing motion capture by strobing a fluorescent lamp」;2006年 6月 7 日申請之第 1/449,127 號「System and method for three dimensional capture of stop-motion 〇 animated characters」,該等申請案中之每一者已讓於給本 CIP申請案之受讓人)俘獲的現場直播之表演如何導致非常 平滑之俘獲表面,既而達成高多邊形計數的追蹤表面(亦 即,多邊形運動精確地追隨面部之運動)。最後,當將現 場直播之表演之視訊映射於追蹤表面上以產生紋理表面 時,產生照片般逼真的結果。 儘管當前GPU技術能夠再現追蹤表面及紋理中的許多多 邊形且即時地照明該表面,但若多邊形及紋理每一圖框時 ® 間改變(其將產生最具照片般逼真感之結果),則其將迅速 地消耗現代PC或視訊遊戲控制台之所有可用RAM。 使用上文所描述之串流幾何形狀技術,將幾何形狀不斷 地饋送至應用程式/遊戲伺服器1521-1525中以使得其可不 斷地動畫製作照片般逼真的面部從而允許產生具有幾乎不 能區別於現場直播之動作面部之面部的視訊遊戲變得實 際。 線性内容舆互動式特徵之整合 136720.doc -130- 200941233 電影、電視節目及音訊材料(統稱「線性内容」)廣泛地 以許多形式可用於家庭及辦公室使用者。線性内容可在如 CD、DVD、HD_DVD及藍光媒體之實體媒體上獲取。其亦 可藉由來自衛星及電纜丁¥廣播之DVR來記錄。此外,其 可以經由衛星及電欖TV之即付即看(ppv)内容及以電規τν 上之視訊點播(VOD)可用。 日益增加的線性内容可經由網際網路以下載的内容及串 丨内 > 可用。現今,確實不存在—能體驗與線性媒體相關 〇聯之所有特徵的位置。舉例而言,DVD及其他視訊光學媒 體通常具有在其他位置處不可用之互動式特徵(如導演之 评淪、「花絮」短片等)。線上音樂站點具有通常在匸^^上不 可用之封面藝術及歌曲資訊,但並非所有CD線上可用。 且與電視節目相關聯之網站常常具有額外特徵、網志 (blog)及有時來自演員或創作人員之評論。 另外,在許多電影或運動事件之情況下,常常存在常常 連同線性媒體一起發行(在電影之狀況下)或(在運動之狀況 下)可緊密地聯繫至真實世界事件(例如,玩家之交易)的視 訊遊戲。 主機代管服務210非常適合於在將全異形式之相關内容 連結在一起時遞送線性内容。的確,遞送電影電影不如遞 送高度互動式視訊遊戲有挑戰,且主機代管服務210能夠 將線性内容遞送至家庭或辦公室中的多種器件,或遞送至 行動器件。圖23展示用於主機代管服務21〇之例示性使用 者介面頁面’其展示線性内容之選擇。 136720.doc -131- 200941233 但是,不同於大多數線性内容遞送系統,主機代管服務 210亦能夠遞送相關的互動式成份(例如,DVD上之選單及 特徵、HD-DVD上之互動式上覆,及網站上之Adobe Flash 動晝(如下文所說明))。因此,用戶端器件415限制不再引 入關於哪些特徵可用之限制。 另外,主機代管系統210能夠動態且即時地將線性内容 與視訊遊戲内容連結在一起。舉例而言,若使用者正觀看 哈利波特電影中之Quidditch比賽,且決定其願意嘗試玩 ® Quldditcl1,則其可僅僅單擊按鈕且電影將暫停且其將被立 即輸送至哈利波特視訊遊戲之Quidditeh片段。在玩Will suffer an lag that is noticeable. However, for most of the purposes of the conference (where investors are watching architects controlling building crossings or talking about video conference calls), even honeycomb delays should be acceptable. Finally, at the end of the cooperative conference call, the real estate developer and investor will make their comments and stop the colocation service, and the construction company will be able to "rewind" the video of the conference that has been recorded on the delay buffer 1515 and Review comments, facial expressions and/or actions applied to the 3D model of the building during the meeting. If there are specific segments that it wishes to save, then the segments of the video/audio can be moved from the delay buffer 1515 to the raid array 1511-1512 for archival storage and later playback. Also, from a cost perspective, if an architect only needs to use New York City's computing power and a large database for a 15-minute meeting, then it only needs to pay for the time when the resources are used, without having to have a high The ability of the workbench does not have to buy an expensive copy of the large database. Video-rich community services Hosting services 210 are an unprecedented opportunity to build video-rich community services on the Internet. The exemplary user page of the game player on the exhibition in Figure 2 is for the host hosting service. Like the game viewfinder application 136720.doc -122- 200941233 The same program as the user page is an application executed on one of the application/game servers 1521_ 1525. All thumbnails and video windows on this page show a constantly moving video (if the clip is short, it loops). By using a video camera or by uploading video, the user (the user name is "KILLHAZARD") can publish his own video 2 (other users can view the video ρ and the video is stored on the rAID array 1511-1512). Also, 'When other users come to the KILLHAZARD user page, if KILLHAZARD is using the colocation service 21〇 at this time, it will show the video of the live broadcast of whatever it is doing 2 (assuming its permission The user viewing the user page views it. This will request the KILLHAZARD to be active from the service control system 401 by the application/game server 152ΐ_ι 525 hosted by the host page application (and if so, request it) The application/game server 1521_1525 is being used. Then, using the same method used by the game viewfinder application, the compressed video stream of the appropriate resolution and format is sent to the application executing the user page application. / Game server 1521-1525 and display it. If the user selects a live broadcast game with KILLHAZARD The window and then appropriately click on its input device, the window will zoom in (again using the same method as the game viewfinder application), and the live video will be viewed by the user's display device 422 (suitable for Viewing the characteristics of the user's Internet connection) Filling the screen. This is a key advantage over the prior art method: the user who views the user's page can see the game played live by the user, and does not have the ability to Play the game's local computer or game console. It is 136720.doc -123- 200941233 users have an excellent opportunity to see the users on the user page displayed as "active", and it is a good view. Users may wish to try a better game. The video clips recorded or uploaded by the camera of KILLHAZARD's partner 2002 are also displayed on the user page, and below each video clip is a line indicating whether the partner is playing online. The text of the game (for example, six-sh〇t is playing the game "Eragon" and MrSnuggles99 is offline, etc.). By clicking on a menu item (not shown), the 'Billing Video Clip' is switched from displaying the recorded or uploaded® video to the partner of the game currently playing the colocation service 210 at the moment in the game. The live video of the content. Therefore, it becomes a game viewfinder that is grouped by the partner. If you select the game of the partner and the user clicks on the game, the game will be enlarged to the full screen and the user will be able to watch the full screen. The game played live on the spot. Again, the user of the game viewing the partner does not own the copy of the game, nor does it have the local computing/game console resources for playing the game. The game view is effective instantaneous. As previously described above, when a user plays a game on the colocation service 210, the user can "rewind" the game and find the video clip he wishes to save, and then save the video clip to his user page. . These are called "Brag Clips". Video clips 2003 are self-reward clips 2〇〇3 saved by KILLHAZARD from previous games played by them. The number 2004 shows how many times the self-reviewed clip has been viewed, and when the self-reward clip is viewed. The user has an opportunity to rate it, and the number of icons 2005 of the orange keyhole shape indicates how high the rating is. When the user views the 136720.doc -124- 200941233 user page, the self-review clip 2003 continually loops along with the rest of the video on the page. If the user selects and clicks on one of the self-review clips 2〇〇3, it is zoomed in to present the self-reward clip 2003, and DVR control that allows playback, pause, rewind, fast forward, step, and the like. The self-reward clip 2003 playback is loaded with the compressed video clip stored on the rAIE) array 15 i_ 15 12 by the application/game server 1521_ 1525 by the application/game server 1521_ 1525 and decompressed and played back. Implementation. © Self-recruiting clip 2003 can also be a 3D DVR" video clip from a 3D DVR-capable game (ie, a sequence of game states from a game that can be played back and allows the user to change the camera's view point) „ in this situation Next, game state information is also stored in addition to the specific "crossing" compressed video recordings that the user performs while recording the game segment. When the user page is being viewed and all thumbnails and video windows are constantly looping, the 3D dvr self-reward clip 2003 will cause the user to record the self-reward clip 2003 of the compressed video when the user records the "travel" of the game segment. Constantly circulate. However, when the user selects the 3D DVR self-reward clip 2003 and clicks the 3D DVR self-reward clip 2〇〇3, the user will be able to click to give it in addition to the DVR control that allows the playback of the compressed video self-reward clip. Button for 3D DVR capabilities of game clips. It will be able to independently control the camera "crossing" during the game segment, and if it wishes (and the user of the user page so allows), it will be able to record the alternate self-reward clip in the form of compressed video. The alternative self-reward clip "crossing" will then be available to other viewers of the user's page (immediately, or after the owner of the user's page has I36720.doc •125· 200941233 with the opportunity to verify the clip ). This 3D DVR Self-Camp Clip 2003 capability is enabled by launching a game that will replay the recorded game state information on another application/game server 152 1525. Since the game can be launched almost instantaneously (as previously described), it is activated (its playback is limited to the game state recorded by the self-reward clip) and then the user is allowed to record the video to the delay buffer 1515. It is not difficult to use the camera to "cross" at the same time. Once the user completes the "crossing", the game is deactivated. © From the user's point of view, launching the “crossing” with the 3D DVR Self-Camp Editing 2003 is no more difficult than controlling the Dvr control of the linear self-reward clip 2〇〇3. It does not know the game or even know how to play the game. It is only a virtual camera operator staring at the 3D world during the game segment recorded by another operator. The user will also be able to add their own audio to the self-reward clip (or record or upload from the microphone). In this way, a self-reward clip can be used to generate custom animations using characters and actions from the game. This dynamic production technique is often referred to as "machinima". As the user progresses through the game, they will reach different skill levels. The played game reports the results to the service control system 4 and these skill levels will also be displayed on the user page. Interactive animated ads Online ads have evolved from text to still images, video, and now to interactive snippets, often implemented using animated, thin-clients like Adobe Flash. The reason for using the thin client is that the user 136720.doc -126- 200941233 is delayed and less impatient with the privilege of selling the product & or service. Also, the thin client is executed on a very low performance PC, and therefore advertisers can have a high level of confidence: interactive ads will work properly. The legacy, such as Adobe Flash's animated streamlined client, is limited in the degree of interactivity and the duration of the experience (to reduce download time). Figure 21 illustrates an interactive advertisement in which the user selects the exterior and interior colors of the car as it rotates in the showroom, while the instant ray tracing shows how the car does not look. Then the user chooses the avatar to drive the car, © And then the user can use the car for driving on a race track or through a country other than M〇naco. The user can select a larger engine or a better tire and then see how the changed configuration affects the car's ability to accelerate or maintain stability. Of course, 'advertising is effective for cutting-edge 3D video games. However, for such advertisements that can be played on a PC or video game console, it will require 100 MB downloads, and in the case of a PC, it may require the installation of a special drive and may lack sufficient CPU or GPU computing power is not implemented at all. Therefore, such advertisements are impractical in prior art configurations. In the colocation service 210, the advertisements are placed almost immediately, and are preferably executed regardless of the capabilities of the user's client 415. As a result, it delivers more quickly than a streamlined, user-based interactive ad, with a richer experience and a higher level of reliability. Streaming geometry RAID arrays 15 11-15 12 and incoming routing 1502 can provide such fast data rates with such low latency during instant animations that the design is likely to depend on 136720.doc -127· 200941233 RAID Array 1511- 15 12 and the routing route 15〇2 to reliably deliver geometric video games and applications directly in the middle of the game play or in the application during live action (eg, traversal with complex databases). In prior art systems, such as the video game system shown in the figure, the large number of storage devices available (especially in practical home devices) is so slow that it is not possible to stream geometry during game play (except for the required In addition to the slightly predictable geometry, for example, in a driving game where a designated road exists, the geometry of the building used to enter the field of view can be reasonably properly predicted and a large number of storage devices can be searched for in advance. The location where the geometry is located. But in complex scenes with unpredictable changes (for example, in a battle scene with complex characters around) 'If the RAM on the PC or video game system is completely filled for the current view The geometry of the object, and then the user suddenly turns his character to view his character, if the geometry is not preloaded into the RAM' then there may be a delay before the geometry can be displayed. In 210, the RAID arrays 1511-1512 can exceed the speed stream data of the same speed Ethernet speed. Under the san network, there is a speed of 10 billion bits per second that is better than 10 ten. 3⁄4 7L Ethernet or better than other network technologies. 1 billion bit / The second will load 1 billion bytes of data in less than a second. In the 60 fps frame time (16.67 milliseconds), you can load about 170 million bits (21 MB) of data. Of course, even in RAID In the configuration, the rotating media will still incur a delay greater than one frame time, but the flash memory based on the flash memory will eventually be larger than the rotating 136720.doc -128- 200941233 media RAID array and will not This high latency is incurred. In one embodiment, a very low latency access is provided using a cache of large RAM writes. Therefore, at a sufficiently high network speed and a large amount of memory with low enough latency, The geometry and the GPU can process the 3D data to quickly stream the geometry to the application/game server 152, 1525. Thus in the example given above, the user suddenly turns his character and Looking back, you can load everyone behind them before the character finishes spinning. The geometric shape of the object, and therefore, for the user, it seems that it is in a real-life photo-realistic world with live action. As discussed earlier, the last of photo-realistic computer animations One of the boundaries is the human face, and because the human eye is sensitive to incompleteness' The slightest error from a photo-realistic face can lead to negative reactions from the viewer. Figure 22 shows the use of ContourTM authenticity capture. Technology (the following is the subject of the application in the application: No. 10/942,609, "Apparatus and method for capturing the ❿ motion of a performer"; September 10, 2004 /942,413 "Apparatus and method for capturing the expression of a performer"; February 25, 2005 曰 Application No. 11/066,954 r Apparatus and method for improving marker identification within a motion capture system"; March 10, 2005 Application No. 11/077,628 "Apparatus and method for performing motion capture using shutter synchronization Application No. 11/255,854, October 20, 2005, "Apparatus and 136720.doc -129- 200941233 method for performing motion capture using a random pattern on capture surfaces"; June 7, 2006 曰 Application No. 11/449 "System and method for performing motion capture using phosphor application techniques", No. 11/449,043, "System and method for performing motion capture by strobing a fluorescent lamp"; June 7, 2006 Japanese Application No. 1/449, 127 "System and method for three dimensional capture of stop-motion 〇animated characters", each of which has been captured by the assignee of this CIP application How the live broadcast performance results in a very smooth capture surface that achieves a high polygon count tracking surface (i.e., the polygon motion accurately follows the movement of the face). Finally, photo-realistic results are produced when the live broadcast of the live video is mapped onto the tracking surface to create a textured surface. While current GPU technology is capable of rendering many polygons in the tracking surface and texture and illuminating the surface in real time, if each of the polygons and textures changes between the frames (which will produce the most photorealistic results), then All available RAM for modern PC or video game consoles will be quickly consumed. Using the stream geometry technique described above, the geometry is continuously fed into the application/game server 1521-1525 so that it can continually animate a photo-realistic face to allow for almost indistinguishable The video game of the facial face of the live action becomes practical. Integration of Linear Content and Interactive Features 136720.doc -130- 200941233 Movies, TV shows and audio materials (collectively "Linear Content") are widely available in many forms for home and office users. Linear content is available on physical media such as CD, DVD, HD_DVD, and Blu-ray media. It can also be recorded by DVRs from satellite and cable broadcasts. In addition, it can be available via pay-as-you-go (ppv) content on satellite and TV, and video on demand (VOD) on the power meter τν. Increasingly linear content is available via the Internet for downloading content and strings > available. Today, there really is nowhere – you can experience the location of all the features associated with linear media. For example, DVDs and other video optical media typically have interactive features that are not available at other locations (such as director reviews, "tact" clips, etc.). Online music sites have cover art and song information that are not available on 匸^^, but not all CDs are available. And websites associated with television shows often have additional features, blogs, and sometimes comments from actors or creators. In addition, in the case of many movies or sports events, there are often issues that are often issued along with linear media (in the case of a movie) or (in the case of sports) can be closely linked to real-world events (eg, player transactions). Video game. The colocation service 210 is well suited for delivering linear content when linking disparate forms of related content together. Indeed, delivering a movie movie is less challenging than delivering a highly interactive video game, and the colocation service 210 can deliver linear content to a variety of devices in a home or office, or to a mobile device. Figure 23 shows an exemplary user interface page for a colocation service 21' which shows the choice of linear content. 136720.doc -131- 200941233 However, unlike most linear content delivery systems, the colocation service 210 is also capable of delivering relevant interactive components (eg, menus and features on DVDs, interactive overlays on HD-DVDs). And the Adobe Flash animation on the website (as explained below)). Therefore, the client device 415 limits no restrictions on which features are available. In addition, the colocation system 210 is capable of dynamically and instantly linking linear content to video game content. For example, if a user is watching a Quidditch game in a Harry Potter movie and decides that he is willing to try to play Quldditcl1, it can simply click the button and the movie will pause and it will be immediately delivered to Harry Potter. The Quidditeh clip of the video game. playing
Quidditch比賽之後,另一次單擊按鈕,且電影將即刻重新 開始。 在照片般逼真的圖形及製作技術之情況下,其中攝影俘 獲的視訊不能區別於現場直播之動作人物,當使用者進行 自現場直播之動作電影中之Quidditch遊戲至主機代管服務 ❹ 上之視訊遊戲中之Quidditch遊戲的轉變時(如本文中所描 述),該兩個場景實際上不能區別。此為線性内容與互動 式(例如,視訊遊戲)内容兩者之導演提供全新的創作選 項,因為該兩個世界之間的線變得不能區別。 利用圖14中所展示之主機代管服務架構,可將3D電影中 之虛擬相機之控制提供給檢視者。舉例而言,在發生於列 車内之場景中,將有可能允許檢視者在故事進展時控制虛 擬相機且%顧列車。此假定列車中之所有3D物件(「資 產」)以及能夠即時地再現該等場景以及原始電影的足夠 136720.doc -132- 200941233 計算能力位準可用。 且甚至對於非電腦產生之娛樂,存在可提供的非常刺激 之互動式特徵。攀例而言,2〇〇5電影「傲慢與偏見」具有 裝飾華麗的舊英國大廈中之許多場景。對於特定大廈場 景,使用者可將視訊暫停且接著控制相機以巡視大廈,或 可能的周圍區域。為實施此,可載運具有魚眼透鏡之相機 穿過大廈’當其追蹤其位置時’非常類似於實施先前技術 八—公司之QuickTime VR。各種圖框接著將被轉換,因 I像不失真,且接著其連同電影一起被儲存於陣 列1511-1512上,且在使用者選擇繼續虛擬巡視時被回 放。 在運動事件之情況下,可經由主機代管服務21〇來串流 現場直播之運動事件(諸如,籃球比赛)以供使用者觀看(如 同其對於常見TV所想要的那樣)。在使用者觀看特定播放 之後,遊戲之視訊遊戲(最終籃球玩家看起來與真實玩家 -般照片般逼真)可趕上在同一位置中開始的玩家,且使 用者(可能各自㈣一玩家)可重新玩以查看其是否可比該 等玩家做得更佳β 本文中所描述之主機代管服務210極其適合於支援此未 來世界,因為其能夠承受不切實際以致不能安裝於家庭中 或大多數辦公室背景中的計算能力及大容量儲存資源,而 且其計算資源總是最新的(在可用的最新的計算硬體之情 況下)’但是在家庭背景中,將總是存在具有較舊代之pi 及視訊遊戲的家庭。此外,在主機代管服務2 γ,使用 136720.doc •133· 200941233 者被隱瞒所有此計算複雜度,因此,即使使用者可能正使 用非常尖端之系統,自使用者之觀點看,亦如改變電視上 之頻道一般簡單。另外’使用者將能夠存取所有計算能力 及計算能力將自任何用戶端415帶來的體驗。 多人遊戲 至遊戲為多人遊戲之程度’則其將能夠不僅經由入埠路 由1502網路傳達至應用程式/遊戲伺服器152卜1525而且藉 〇After the Quidditch game, another click on the button and the movie will start again. In the case of photo-realistic graphics and production techniques, the video captured by the camera cannot be distinguished from the live action characters, when the user performs the video from the Quidditch game in the live action movie to the colocation service. When the Quidditch game in the game changes (as described in this article), the two scenes can't actually be distinguished. This is a new creative option for directors of both linear content and interactive (eg video game) content, as the lines between the two worlds become indistinguishable. Using the colocation service architecture shown in Figure 14, the control of the virtual camera in the 3D movie can be provided to the viewer. For example, in a scenario that occurs within a train, it will be possible to allow the viewer to control the virtual camera as the story progresses and to take care of the train. This assumes that all 3D objects in the train ("assets") and enough 136720.doc -132-200941233 computing power levels are available to instantly reproduce these scenes as well as the original movie. And even for non-computer-generated entertainment, there are very stimulating interactive features that can be provided. In terms of climbing, the 2〇〇5 film “Pride and Prejudice” has many scenes in the beautifully decorated old British mansion. For a particular building scene, the user can pause the video and then control the camera to patrol the building, or possibly the surrounding area. To accomplish this, a camera with a fisheye lens can be carried through the building 'when it tracks its position' very similar to implementing the prior art eight-company QuickTime VR. The various frames will then be converted, since the I image is not distorted, and then it is stored on arrays 1511 - 1512 along with the movie and is played back when the user chooses to continue the virtual tour. In the case of a sporting event, a live event (e.g., a basketball game) can be streamed via the colocation service 21 for viewing by the user (as it would be for a typical TV). After the user watches a particular play, the video game of the game (finally the basketball player looks realistic with the real player-like photo) can catch up with the player starting in the same position, and the user (possibly each (four) one player) can be re-played Play to see if it can do better than these players. The colocation service 210 described in this article is extremely suitable for supporting this future world because it can withstand unrealisticity and cannot be installed in the home or most office backgrounds. Computational power and large-capacity storage resources, and its computing resources are always up-to-date (in the case of the latest computing hardware available)' but in the family background, there will always be older generations of pi and video The family of the game. In addition, in the host hosting service 2 γ, the use of 136720.doc • 133· 200941233 is concealed of all this computational complexity, so even if the user may be using a very sophisticated system, from the user's point of view, Changing the channel on TV is generally simple. In addition, the user will be able to access all of the computing power and computing power that will result from any client 415. Multiplayer games to the extent that the game is multiplayer, then it will be able to communicate not only via the 1502 network to the application/game server 152b 1525 but also by borrowing
由網路橋接器傳達至具有不在主機代管服務21〇中執行之 伺服器或遊戲機器的網際網路(未圖示)。當藉由通用網際 網路上之電腦玩多人遊戲時,則應用程式/遊戲伺服器 1521-1525將具有極快存取網際網路之益處(與遊戲係在家 庭中之伺服器上執行的情況相比),但其將受在較緩慢連 接上玩遊戲之其他電腦的能力限制,且亦潛在地受網際網 路上之遊戲伺服器經設計以適應最少共同點(該等遊戲伺 服器將為相對緩慢之消費者網際網路連接上的家庭電腦) 的事實限制。 但當完全在主機代管服務21〇伺服器中心内玩多人遊戲 時,則可達成極大差異。主機代管用於使用者之遊戲之每 -應用程式/遊戲飼服n 1521_1525將與其他應用程式/遊戲 伺服器1 521 _ 1 525以及藉由極高速度、極低延時連接性及 巨大、非常快之儲存陣列主機代管對多人遊戲之中央控制 的任何飼服器互連。舉例而言,若超高速乙太網路用於入 埠路由1502網路,則應用程式/遊戲飼服器1521-1525將在 彼此當中傳達,且傳達至以十億位元,秒速度在潛在的僅ι 136720.doc •134· 200941233 毫秒或1毫秒以下之延時下主機代管對多人遊戲之中央控 制的任何伺服器。另外,11八11)陣列1511_1512將能夠非常 快速地回應且接著以十億位元/秒速度傳送資料。作為一 實例’若使用者在外表及服裝方面定製人物,以使得人物 具有對於人物而言唯一的大量幾何形狀及行為,在限於在 家庭中在PC或遊戲控制台上執行之遊戲用戶端的先前技術 系統下,若彼人物將進入另一使用者之視野中,則使用者 將必須等待直至長的緩慢下載完成為止,以便將所有幾何 ® 形狀及行為資料載入其電腦中。在主機代管服務210内, 彼相同下載可優於以十億位元/秒速度自rAID陣列1511_ 1512伺服的超高速乙太網路。即使家庭使用者具有8 Mbps 網際網路連接(其根據現今之標準來看極快),超高速乙太 網路亦快1 00倍。因此,在快的網際網路連接上花費一分 鐘進行的工作在超高速乙太網路上將花費小於一秒。 頂級玩家分群及錦摞赛 @ 主機代管服務210極其適合於錦標賽。因為無遊戲係在 本端用戶端中執行,所以不存在使用者作弊之機會。又, 由於輸出路由1540多播UDP流之能力,使得主機代管服務 210能夠同時向觀眾中的數千人廣播較大錦標賽。 事實上,當存在如此風行以致數千名使用者正接收相同 流的特定視訊流時(例如’展示較大錦標赛之視圖),將視 訊流發送至内容遞送網路(CDN)(諸如,Akamai或 Limelight)以供至大量分配至許多用戶端器件415可能更有 效0 136720.doc 135· 200941233 备使用CDN來展示頂級玩家分群之遊戲取景器頁面時, 可獲得類似位準之效率。 對於較大錦標賽,可使用現場直播的名人解說員來在特 疋比賽期間提供評論。儘管大量使用者將係在觀看較大錦 標赛’且相對小數目將係在錦標赛中玩。可將來自名人解 說員之音訊路由至主機代管在錦標賽中玩之使用者且主機 代管錦標賽中之遊戲之任何旁觀者模式複本的應用程式/ 遊戲伺服器1521-1525,且可將音訊加錄於遊戲音訊之 上。可在遊戲上(亦可能剛好在旁觀者視圖上)上覆名人解 說員之視訊。 網頁載入之加速 全球資訊網之主要輸送協定、超文字傳送協定(Ηττρ)係 經構想並界定於一其中僅商業具有高速網際網路連接,且 線上之消費者使用撥號數據機或ISDN的時代中。此時, 用於快速連接之「黃金標準」為丁丨線,其對稱地提供15 Mbps資料速率(亦即,兩個方向中具有相等資料速率)。 現今,情形完全不同。大量發達世界中經由DSL或電纜 數據機連接之平均家庭連接速度具有比丁丨線高得多的下行 資料速率。事實上,在世界之一些地方中,光纖至路邊 (fiber-to-the-curb)正將高達50 Mbps至 1〇〇 Mbps之資料速 率引入家庭。 遺憾地’ HTTP未經架構(亦未實施)以有效地利用此等急 劇速度改良。網站為遠端伺服器上之檔案之集合。非常簡 單地說’ HTTP請求第一槽案,等待下載該檔案,且接著 136720.doc •136· 200941233 θ束第一槽案’等待下载該播案等。事實上,HTTP允許 乂上開放連接」(亦即,每次請求一個以上檔案), 〜於議定#標準(及防止網路伺服器被超載之願望)而使 得僅准許非常j之開放連接。此外,由於網頁經構造之方 式’瀏覽器常常未意識到可用於立即下載之多個同時頁面 (亦即’僅在剖析一頁面之後才變得顯而易見:需要下載 如影像之新槽案)。因此,網站上之播案實質上係逐個地 ❹ 載入。此外,由於由HTTP使用之請求及回應協^,存在 與所載入之每一檔案相關聯的大致(存取美國的典型網路 伺服器)1 〇 〇毫秒之延時。 在相對低速連接之情況下,此不㈣人大㈣題,因為 :於檔案本身之下載時間決定網頁之等待時間。但是,隨 者連接速度增大(尤其是複雜網頁情況下),開始引起問 在圖24中所展不之實例中,展示典型商業網站(此特定 ❹㈣係來自較大運動鞋商標)。網站上具有M個槽案。標 案包括HTML、CSS、㈣、酸、JavaSedpiF丨_槽 案,且包括視訊内容。在現場直播網頁(亦即,使用者可 單擊其並開始使用其)之前,必須載人總共i 5 Μ位元組。 對於大量標案存在許多原因。首先,其為複雜且尖端之網 頁,且其次,其為基於關於存取該頁面之使用者之資訊動 態地組合的網頁(例如’使用者來自哪個國家,何種語 言,使用者之前是否進行購買等),且視所有此等因素而 下載不同槽案。但是,其仍為非常典型的商業網頁。 136720.doc -137- 200941233 圖24展示隨著連接速度增大在現場直播網頁之前消逝的 時間量。在1.5 Mbps連接速度24〇1下,使用具有習知網路 瀏覽器之習知網路飼服器,在現場直播網頁之前花費 移。在12 Mbps連接速度2402下,載入時間減少至6 5秒, 或約快一倍。但在96 Mbps連接速度2403下,載入時間僅 減少至約5.5秒。此之原因係因為在此種高下載速度下, 下載檔案本身之時間最小,但每檔案各自大致1〇〇毫秒之 延時仍保持,從而導致54個檔案*1〇〇毫秒=54秒之延時。 ® 因此,無論至家庭之連接多快,此網站在現場直播之前將 總是花費至少5.4秒。另一因素係伺服器側排入佇列;每 個HTTP π求係在仵列之後部添加,因此在忙碌词服器 上,此將具有顯著影響,因為對於待自網路伺服器得到的 每個小項目’ HTTP請求需要等待其返回。 解決此等問題之一方式係廢棄或重新界定Ηττρ。或 者,可能使網站擁有者較佳地將其檔案合併成單一檔案 〇 (例如,以Adobe Flash格式)。但是’作為一實際問題,此 a司以及許多他人在其網站架構中具有大量投資。另外’ 儘吕些豕庭具有12-100 Mbps連接,但大多數家庭仍具 有較緩慢之速度,且HTTP在緩慢速度下確實工作良好。 替代方法係將網路瀏覽器主機代管於應用程式/遊戲 伺服器1521-1525上,且將用於網路伺服器的檔案主機代 管於RAID陣列1511_1512上(或潛在地主機代管於主機代管 網路瀏覽器之應用程式/遊戲伺服器1521_1525上的RAM中 或本端儲存器上)。由於經由入埠路由15〇2(或至本端儲存 136720.doc -138· 200941233Communicated by the network bridge to an internet (not shown) having a server or gaming machine that is not executing in the colocation service 21〇. When playing multiplayer games on a computer on a universal Internet, the application/game server 1521-1525 will have the benefit of extremely fast access to the Internet (when the game is executed on a server in the home) In comparison, but it will be limited by the capabilities of other computers playing games on slower connections, and potentially by the game servers on the Internet to be designed to accommodate the least commonalities (the game servers will be relative) The factual limitations of slow consumer Internet connections on home computers). However, when playing a multiplayer game entirely in the colocation service 21 server center, a great difference can be achieved. Hosting the game for the user's game - app/game feeding n 1521_1525 will be connected to other apps/games server 1 521 _ 1 525 and by extremely high speed, very low latency connectivity and huge, very The Fast Storage Array Host hosts any feeder connected to the central control of the multiplayer game. For example, if an ultra-high-speed Ethernet network is used to route the 1502 network, the application/game feeders 1521-1525 will be communicated to each other and communicated to potentials at a billionth of a second. Only ι 136720.doc • 134· 200941233 milliseconds or less than 1 millisecond delay under the host to host any server for central control of multiplayer games. In addition, 11 8 11) arrays 1511_1512 will be able to respond very quickly and then transfer data at a rate of one billion bits per second. As an example 'If the user customizes the character in terms of appearance and clothing so that the character has a large number of geometric shapes and behaviors that are unique to the character, in front of the game client that is limited to execution on the PC or game console in the home Under the technical system, if a character enters the field of view of another user, the user will have to wait until a long slow download is completed in order to load all geometry® shape and behavior data into their computer. Within the colocation service 210, the same download can be superior to the ultra-high speed Ethernet from the rAID array 1511_1512 at a rate of one billion bits per second. Even if the home user has an 8 Mbps Internet connection (which is extremely fast based on today's standards), the ultra-fast Ethernet network is 100 times faster. Therefore, it takes less than a second to spend a minute on a fast internet connection on a super-fast Ethernet. Top Player Grouping and Koi Race @ Host Escrow Service 210 is perfect for tournaments. Since no game is executed in the local client, there is no chance for the user to cheat. Again, due to the ability of the output route 1540 to multicast UDP streams, the colocation service 210 can simultaneously broadcast larger tournaments to thousands of people in the audience. In fact, when there are so popular that thousands of users are receiving the same stream of specific video streams (such as 'showing a larger tournament view'), the video stream is sent to a content delivery network (CDN) (such as Akamai). Or Limelight) may be more efficient for distribution to a large number of client devices 415. 136720.doc 135· 200941233 When using a CDN to display a top-level player grouping game viewfinder page, a similar level of efficiency can be obtained. For larger tournaments, live celebrity commentators can be used to provide comments during the special event. Although a large number of users will be watching the larger championships and a relatively small number will be played in the tournament. The audio from the celebrity commentator can be routed to the application/game server 1521-1525 that hosts the host in the tournament and hosts any of the bystander mode copies of the game in the tournament, and the audio can be added Recorded on the game audio. The video of the celebrity commentator can be overlaid on the game (and possibly just on the bystander view). The main transport protocol and hypertext transfer protocol (Ηττρ) of the webpage loading acceleration global information network is conceived and defined in an era in which only commercial high-speed Internet connections are used, and online consumers use dial-up data machines or ISDN. in. At this point, the "gold standard" for fast connections is the Ding Hao line, which symmetrically provides a 15 Mbps data rate (ie, equal data rates in both directions). Today, the situation is completely different. The average home connection speed through a DSL or cable modem in a large number of developed worlds has a much higher downlink data rate than the Dingsian line. In fact, in some parts of the world, fiber-to-the-curb is introducing data rates of up to 50 Mbps to 1 Mbps into the home. Unfortunately, HTTP has not been architected (and not implemented) to make effective use of these rapid speed improvements. The website is a collection of files on the remote server. Quite simply, 'HTTP requests the first slot, waiting to download the file, and then 136720.doc • 136· 200941233 θ bundle first slot' waiting to download the broadcast. In fact, HTTP allows for open connections (that is, each time more than one file is requested), and only the agreed-up # standard (and the desire to prevent the web server from being overloaded) allows only very open connections. In addition, because web pages are constructed in a way that browsers are often unaware of multiple simultaneous pages that can be used for immediate downloading (i.e., it becomes apparent only after parsing a page: a new slot such as an image needs to be downloaded). Therefore, the broadcasts on the website are essentially loaded one by one. In addition, due to the request and response protocol used by HTTP, there is a delay of approximately 1 〇 milliseconds associated with each file loaded (accessing a typical US network server). In the case of a relatively low-speed connection, this is not the (four) NPC (four) question, because: the download time of the file itself determines the waiting time of the web page. However, as the connection speed increases (especially in the case of complex web pages), the question arises. In the example shown in Figure 24, a typical commercial website (this particular ❹(4) is from a larger athletic shoe trademark) is shown. There are M slots on the website. The draft includes HTML, CSS, (4), Acid, JavaSedpiF丨_ Slots, and includes video content. Before the live web page (that is, the user can click on it and start using it), a total of i 5 Μ bytes must be carried. There are many reasons for a large number of tenders. First, it is a complex and sophisticated web page, and secondly, it is a web page that is dynamically combined based on information about the user accessing the page (eg, 'Which country does the user come from, what language, whether the user previously made a purchase Etc.) and download different slots depending on all of these factors. However, it is still a very typical commercial web page. 136720.doc -137- 200941233 Figure 24 shows the amount of time that elapses before the live web page is live as the connection speed increases. At a connection speed of 2.4 Mbps at 1.5 Mbps, a conventional network feeder with a conventional web browser is used to take a shift before the live web page is broadcast. At 12 Mbps connection speed 2402, the load time is reduced to 65 seconds, or approximately doubled. However, at a connection speed of 2403 at 96 Mbps, the load time is reduced to only about 5.5 seconds. The reason for this is that at such high download speeds, the time to download the files themselves is minimal, but the delay of approximately 1 millisecond per file is maintained, resulting in a delay of 54 files * 1 〇〇 milliseconds = 54 seconds. ® So, no matter how fast the connection to the home, this site will always take at least 5.4 seconds before the live broadcast. Another factor is that the server side is queued up; each HTTP π request is added after the queue, so on a busy word server, this will have a significant impact because for each to be obtained from the web server A small project 'HTTP request needs to wait for it to return. One way to solve these problems is to discard or redefine Ηττρ. Alternatively, it may be possible for site owners to merge their files into a single file (for example, in Adobe Flash format). But as a practical matter, this division and many others have invested heavily in their website architecture. In addition, there are 12-100 Mbps connections, but most families still have slower speeds, and HTTP does work well at slow speeds. An alternative is to host the web browser host on the application/game server 1521-1525 and host the file host for the web server on the RAID array 1511_1512 (or potentially host the host) Hosting the web browser application/game server 1521_1525 in RAM or on the local storage). Due to the route through the port 15〇2 (or to the local storage 136720.doc -138· 200941233
❾ 器)之非常快之互連,並非在使用HTTP下每檔案具有loo 毫秒之延時,而是在使用HTTP下將存在每檔案最小延 時。接著,並非使家庭中之使用者經由HTTP存取網頁, 而是使用者可經由用戶端415存取網頁β接著,甚至在15 Mbps連接下(因為此網頁不需要大量頻寬來用於其視訊), 網頁亦將在每一線2400小於1秒之時間内處於現場直播。 實質上,在應用程式/遊戲伺服器1521_1525上執行之網路 瀏覽器顯示現場直播之頁面之前將不存在延時,且在用戶 端415顯示來自網路瀏覽器之視訊輸出之前將不存在可偵 測到的延時。當使用者使用滑鼠搜尋網頁及/或在網頁上 鍵入字時,將使用者之輸入資訊發送至在應用程式/遊戲 伺服器1521-1 525上執行之網路瀏覽器,且網路瀏覽器將 相應地作出回應。 此方法之-不利之處係:錢縮器正㈣地傳輸視訊資 料,則使用頻寬,即使網頁變成靜態亦如此。此可藉由组 態壓縮II以僅在(且若)網頁改變時才傳輸資料且接著僅將 資料傳輸至發生改變之頁面部分來補救。當存在具有恆定 地改變的快閃標語等之一些網頁時,該等網頁傾向於令人 讨厭、’且除非存在要移動某物(例如,視訊剪輯)之原因, :則:常網頁為靜態的。對於該等網頁,可能為以下狀 服二機代管服務210將傳輸較少資料(與習知網路词 ==因為將僅傳輸實際顯示的影像,無精簡型用 動翻轉影像丁)無可能從不被檢視之大物件(諸如,滾 136720.doc -139- 200941233 因此,使用主機代管服務210來主機代管舊版網頁,可 將網頁載入時間減少至打開網頁係類似改變電視上之頻道 的程度:有效地即刻地現場直播該網頁。 促進遊戲及應用程式之除錯 如先前所敍述’具有即時圖形之視訊遊戲及應用程式為 非常複雜之應用程式且通常當其被發行至該領域中時,其 含有缺陷。儘管軟體開發商將自使用者得到關於缺陷之反 饋,且其可能具有用於在崩潰之後將機器狀態傳回之一些 © 方式,但確切地識別是什麼引起遊戲或即時應用程式崩潰 或不適當地執行非常困難。 當遊戲或應用程式在主機代管服務21〇中執行時,將遊 戲或應用程式之視訊/音訊輸出恆定地記錄於延遲緩衝器 1515上。另外,看門狗過程執行每一應用程式/遊戲伺服 器1 52 1 -1 525 ’該看門狗過程將向主機代管服務控制系統 401定期地報告應用程式/遊戲伺服器ι521_1525正平滑地執 行。若看門狗過程未能報告,則伺服器控制系統401將試 圖與應用程式/遊戲伺服器1521_1525通信,且若成功,則 將收集*T用的無論什麼機器狀態。將無論什麼可用之資訊 連同由延遲緩衝器1515記錄之視訊/音訊一起發送至軟體 開發商。 因此,當遊戲或應用程式軟體開發商自主機代管服務 210得到崩潰之通知時,其得到導致崩潰之原因的圖框接 圖框之紀錄。此資訊在追蹤到缺陷並將其修復中可極具價 值。 136720.doc •140- 200941233 亦注意’當應用程式/遊戲伺服器152 1-1 525崩潰時,在 最近的可重新啟動之時刻重新啟動伺服器,且將訊息提供 給使用者,從而就技術困難道歉。 資源共用及成本節省 圖4a及圖4b中所展示之系統為終端使用者與遊戲及應用 程式開發商兩者提供多種益處。舉例而言,通常,家庭及 辦公室用戶端系統(例如,PC或遊戲控制台)僅在一週中之 小百分比之小時中處於使用中。根據由Nieisen娛樂「活 Ο 躍遊戲者基準點研究」(http://www.prnewswire.com/cgi- bin/StOrieS.Pl?ACCT=104&STORY=/www/story/10_05·2006/ 〇〇〇44461 15&EDATE=)的2〇〇6年1〇月5日通信稿,活躍遊戲 者一週平均花費14個小時來在視訊遊戲控制台上玩且約一 週17個小時在掌上型器件上玩。該報告亦陳述:對於所有 遊戲播放活動(包括控制台、掌上型器件及PC遊戲播放), 活躍遊戲者平均一週13個小時。考慮較高數字之控制台視 〇訊遊戲播放時間,存在一週24*7 = 168個小時,彼暗示在活 躍遊戲者之家中’視訊遊戲控制台僅在-週之17/168 = 10% 2小時中處於使用中。或者,9G%之時間,視訊遊戲控制 台係閒置的。給定視訊遊戲控制台之高成本,及製造 助該等器株夕吉域t 胃 實’此為昂貴資源之非常無效率之使用。 業内之PC通常亦僅在一週之一分率小時中使用 曰 高端應用程式、疋 【者如,Autodesk Maya)常常所需的非可攜 果上型PC。/杳 儘s —些商業在所有小時及假日操作且—些 r L (例如,.«( t_x^ α豕以用於在晚上進行工作的可攜式Pc)係在 136720.doc -141 - 200941233 ::二:及饭曰使用’但大多數商業活動傾向於在給定商 '、A集中於自週一至週五的約9 Am至5 ΜThe very fast interconnection of the device is not a delay of loo milliseconds per file under HTTP, but a minimum delay per file under HTTP. Then, instead of allowing the user in the home to access the webpage via HTTP, the user can access the webpage β via the client 415, and then even under the 15 Mbps connection (because the webpage does not require a large amount of bandwidth for its videoconferencing) ), the webpage will also be live broadcast in less than 1 second per line of 2400. In essence, there will be no delay before the web browser executing on the application/game server 1521_1525 displays the live broadcast page, and there will be no detectable before the user terminal 415 displays the video output from the web browser. The delay to arrive. When the user uses the mouse to search the webpage and/or type a word on the webpage, the user's input information is sent to the web browser executed on the application/game server 1521-1 525, and the web browser A response will be responded accordingly. The disadvantage of this method is that the money is being transmitted (4) to the video material, and the bandwidth is used, even if the web page becomes static. This can be remedied by configuring Compression II to transmit data only when (and if) the web page changes and then only transmit the data to the portion of the page where the change occurred. When there are some web pages with a constantly changing flash slogan, etc., the web pages tend to be annoying, and unless there is a reason to move something (eg, a video clip): then: the regular web page is static of. For these webpages, it may be possible to transmit less data for the following two services (there is no need to stream the actual displayed image, no simpler to flip the image) Large objects that are never viewed (for example, Roll 136720.doc -139- 200941233 Therefore, using the colocation service 210 to host the old web pages, the web page loading time can be reduced to open the web page similar to changing the TV. The degree of the channel: effectively and instantly broadcast the webpage lively. Promoting the debugging of games and applications as previously described, 'video games and applications with instant graphics are very complex applications and usually when they are released to the field. In the middle, it contains defects. Although the software developer will get feedback on the defect from the user, and it may have some © way to return the machine state after the crash, but exactly identify what caused the game or instant It is very difficult for an application to crash or not perform properly. When a game or application is executed in the colocation service 21, the game or should The video/audio output of the program is constantly recorded on the delay buffer 1515. In addition, the watchdog process executes each application/game server 1 52 1 -1 525 'The watchdog process will host the service control to the host System 401 periodically reports that application/game server ι521_1525 is executing smoothly. If the watchdog process fails to report, server control system 401 will attempt to communicate with application/game server 1521_1525, and if successful, No matter what machine state is used for the *T. Any information that is available is sent to the software developer along with the video/audio recorded by the delay buffer 1515. Therefore, when the game or application software developer self-hosting service 210 When notified of the crash, it gets a record of the frame that caused the crash. This information can be extremely valuable in tracking down defects and fixing them. 136720.doc •140- 200941233 Also note 'when the application / Game server 152 1-1 525 crashes, restarts the server at the most recent restartable time, and provides the message to the user Apologize for technical difficulties. Resource Sharing and Cost Savings The systems shown in Figures 4a and 4b provide multiple benefits for both end users and game and application developers. For example, typically, home and office clients The system (for example, a PC or game console) is only in use for a small percentage of the week. According to the Nieisen Entertainment "Live Jump Player Benchmark Study" (http://www.prnewswire.com/cgi - bin/StOrieS.Pl?ACCT=104&STORY=/www/story/10_05·2006/ 〇〇〇44461 15&EDATE=) 2nd, 6th, 1st, 5th, 5th, communication, active gamers average weekly It takes 14 hours to play on the video game console and play on the handheld device for about 17 hours a week. The report also states that active gamers average 13 hours a week for all game play activities, including consoles, handheld devices, and PC game play. Considering the higher number of consoles, the game play time is 24*7 = 168 hours a week, and he suggests that in the active gamer's home, the video game console is only at -17/168 = 10% 2 hours. Medium in use. Or, at 9G% of the time, the video game console is idle. Given the high cost of video game consoles, and the ability to manufacture these devices, this is a very inefficient use of expensive resources. PCs in the industry usually only use non-portable PCs that are often used in high-end applications, such as Autodesk Maya, in one-hours per week. / 杳 s - some businesses operate at all hours and holidays and some r L (for example, .« ( t_x ^ α 豕 for portable Pc working at night) is at 136720.doc -141 - 200941233 ::2: Use of rice cookers 'but most commercial activities tend to be in a given business', A concentrates on about 9 Am to 5 周一 from Monday to Friday
諸如,午餐)’且因為大多數職用在使用 :積極地利用Pc時出現’所以其遵循:桌上型PC利用傾 口於遵循此等操作小時數。若假定—週中之五天的自9 AM 至5 PM怪定地利用PC 1彼將暗示PC在一週之 8 24%之小時中被利用。高效能桌上型為用於商 業之非常昂貴的投資,且此反映非常低之利用度。在桌上 型電腦上教學之學校可在一週之甚至更小分率中使用電 腦且儘管其視教學之小時數而改變,但大多數教學在自 週-至週五之日間小時期間出現。因此,一般而言,pc及 視訊遊戲控制台僅在—週之小分率小時中被利用。 值得注意地,因為許多人在非假日之週—至週五之曰間 小時期間在商業或在學校工作,所以此等人通常在此等小 時期間不玩視訊遊戲,且因此#其確實玩視訊遊戲時,其 通常係在其他小時期間(諸如,晚上、週末及假日)。 給定圖4a中所展示的主機代管服務之組態則上述兩段 中所描述之使用型樣導致㈣之非^效之㈣。顯而易 見,存在對於可在給定時間由主機代管服務210來伺服之 使用者的數目的限制,尤其在使用者需要用於複雜應用程 式(如尖端3D視訊遊戲)之即時回應性的情況下。但是,不 同於家庭中之視訊遊戲控制台或由商業使用的pc(其通常 在大多數時間間置放置),伺服器4〇2可由不同使用者在不 同時間重新利用。舉例而言,具有高效能雙cpu及雙Gpu 136720.doc -142- 200941233 及大量RAM之高效能伺服器4〇2可由商業及學校在非假曰 之9 AM至5 PM利用,但由玩尖端視訊遊戲之遊戲者在晚 上、週末及假日利用。類似地,低效能應用程式可由商業 及學校在商業小時期間在具有Celer〇n cpu、無Gpu(或非 常低端之GPU)及有限ram之低效能伺服器402上利用且低 效能遊戲可在非商業小時期間利用低效能伺服器4〇2 ^ 另外,在本文中所描述之主機代管服務配置的情況下, 資源係在數千名(若非數百萬名)使用者當中有效地共用。 一般而言,線上服務僅具有其總使用者基礎的小百分比在 給定時間使用服務。若考慮先前所列出的Nielsen視訊遊戲 使用統計資料,則容易瞭解為什麼。若活躍遊戲者一週僅 17個小時玩控制台遊戲,且若假定遊戲之峰值使用時間係 在晚上(5-12 AM,7*5天=35小時/週)及週末(8 AM-12 AM,16*2=32小時/週)的典型非工作、非商業小時期間, 則對於17個小時之遊戲播放,一週存在35+32=65個峰值小 時。由於以下許多原因而使得難以估計系統上之確切峰值 使用者負載:一些使用者將在峰值外時間期間玩,可能存 在特疋曰間時間存在使用者之叢集峰值,峰值時間可受所 玩遊戲之類型(例如,孩子之遊戲將可能係在晚上的較早 時間玩)等影響。但是,假定當遊戲者可能玩遊戲時,遊 戲者玩的平均小時數遠小於曰間之小時數,則僅主機代管 服務210之一分率數目之使用者將係在給定時間使用主機 代管服務210。為此分析起見,將假定峰值負載為ns%。 因此,僅12.5%之計算、壓縮及頻寬資源係在給定時間使 136720.doc • 143· 200941233 用’從而由於資源之再使用而導致僅i 2.5%之硬體成本來 支援給定使用者玩效能遊戲之一給定級別。 此外,假定一些遊戲及應用程式需要比其他者多的計算 能力’則可基於被使用者玩之遊戲或由使用者執行之應用 程式來動態地分配資源。因此’選擇低效能遊戲或應用程 式之使用者將被分配低效能(較低廉)伺服器4〇2,且選擇高 效能遊戲或應用程式之使用者將被分配高效能(較昂貴)飼 服器402。實際上,給定遊戲或應用程式可能具有遊戲或 應用程式之較低效能及較高效能區,且可在遊戲或應用程 式之區之間將使用者自一伺服器402切換至另一伺服器 402 ’以保持使用者在滿足遊戲或應用程式之需要的最低 成本伺服器402上執行。注意’遠比單一磁碟快之RAID陣 列405將可為甚至低效能伺服器402所用,此具有較快磁碟 傳送速率之益處。因此,跨越所有所玩遊戲或所使用之應 用程式的每飼服器402平均成本比玩最高效能遊戲或應用 程式之大多數昂貴伺服器402之成本小得多,然而,即使 低效能伺服器402亦將自RAID陣列405得到磁碟效能益 處。 另外,主機代管服務210中之伺服器402可能僅為不具有 磁碟或周邊介面(不同於網路介面)之PC主機板,且恰好, 可向下整合至剛好具有至SAN 403之快速網路介面的單一 晶片。又,RAID陣列405可能將在比存在磁碟之情況多得 多的使用者當中共用’因此每一活躍使用者之磁碟成本將 遠小於一磁碟機。所有此設備將可能駐留於環境上受控制 136720.doc 200941233 之伺服器室環境中的支架中。若伺服器402出故障,則其 可备易地在主機代管服務21〇處進行修理或替換。相比之 下,家庭或辦公室中之pc或遊戲控制台必須堅固,必須能 夠倖免於合理之磨損及撕裂以防被重擊或降落的獨立器具 需要外殼,具有至少一磁碟機,必須倖免於不利的環境 條件(例如,被勉強塞入具有其他用具之過熱AV櫥櫃中), 需要服務保證’必須被封裝及裝運,且由可能收取零售利 潤之零售商來出售。另外,pC或遊戲控制台必須經組態以 ® 滿足將在未來某一時刻使用的計算上最密集之預期遊戲或 應用程式的峰值效能’即使較低效能遊戲或應用程式(或 遊戲或應用程式之區)亦可能在大多數時間玩。此外,若 pc或控制台出故障,則使其得到修理係一昂貴且耗時之過 程(不利地影響製造商、使用者及軟體開發商)。 因此’假定圖4a中所展示之系統將相當於本端計算資源 之體驗的體驗提供給使用者,以供使用者在家庭、辦公室 或學校中體驗給定位準之計算能力,則經由圖4a中所展示 ® 之架構提供彼計算能力要低廉得多。 消除對升級之需要 另外’使用者不必再擔憂將PC及/或控制台升級以玩新 遊戲或處理較高效能之新應用程式。主機代管服務210上 之任何遊戲或應用程式(不管彼等遊戲或應用程式需要何 類型之伺服器402)均可為使用者所用,且所有遊戲及應用 程式接近即刻地執行(亦即,快速地自RAID陣列405或伺服 器402上之本端儲存器載入)且適當地具有最新更新及缺陷 136720.doc -145- 200941233 修復(亦即,軟體開發商將能夠選擇用於執行給定遊戲或 應用程式之伺服器402的理想伺服器組態,且接著將伺服 器402組態有最佳驅動器,且接著隨著時間的推移,開發 商將能夠同時將更新、缺陷修復等提供給主機代管服務 210中之遊戲或應用程式之所有複本)。實際上,在使用者 開始使用主機代管服務21〇之後,使用者可能發現遊戲及 應用程式繼續提供較佳體驗(例如,經由更新及/或缺陷修 復)且可能為以下狀況:使用者一年後發現新遊戲或應用 程式可用於利用計算技術(例如,較高效能之GPU)(其在一 年刖甚至不存在)之服務21〇上,因此對於使用者而言,將 不可能購買將在一年後玩遊戲或執行應用程式的一年前之 技術。因為玩遊戲或執行應用程式之計算資源對於使用者 而言不可見(亦即,自使用者之觀點看,使用者僅係選擇 接近即刻地開始執行之遊戲或應用程式_更像使用者改變For example, lunch) 'and because most jobs are used: when Pc is actively used', it follows: desktop PCs use the slant to follow these hours of operation. If it is assumed that the five days of the week from 9 AM to 5 PM use PC 1 strangely, it will imply that the PC is utilized in 24 hours of the week. High-performance desktops are very expensive investments for business, and this reflects very low utilization. Schools that teach on a desktop can use the computer for a week or even less and although it varies depending on the number of hours taught, most of the teaching occurs during the hours of the week-week. Therefore, in general, pc and video game consoles are only used during the hour of the week. Notably, because many people work in business or at school during the non-holiday week-to-week hour, these people usually don’t play video games during these hours, and therefore #真真玩视频When playing, it is usually during other hours (such as evenings, weekends, and holidays). Given the configuration of the colocation service shown in Figure 4a, the usage patterns described in the two paragraphs above result in (4) non-effectiveness (4). It will be apparent that there are limits to the number of users that can be serviced by the colocation service 210 at a given time, especially if the user desires immediate responsiveness for complex applications, such as sophisticated 3D video games. However, unlike video game consoles in the home or PCs that are used commercially (which are typically placed most of the time), the server 4〇2 can be reused by different users at the same time. For example, a high-performance dual cpu and dual Gpu 136720.doc -142- 200941233 and a large amount of RAM high-performance server 4〇2 can be utilized by commercial and school in non-false 9 9 AM to 5 PM, but by the cutting edge Video game players are used at night, on weekends and on holidays. Similarly, low-performance applications can be utilized by businesses and schools during the business hours on low-performance servers 402 with Celer〇n cpu, no Gpu (or very low-end GPU) and limited rams. Using a low-performance server during business hours 4 〇 2 ^ In addition, in the case of the colocation service configuration described herein, resources are effectively shared among thousands (if not millions) of users. In general, online services only use a small percentage of their total user base to use the service at a given time. If you consider the Nielsen video game usage statistics listed previously, it's easy to understand why. If the active player plays the console game for only 17 hours a week, and if the peak usage time of the game is assumed to be at night (5-12 AM, 7*5 days = 35 hours/week) and weekend (8 AM-12 AM, During a typical non-working, non-commercial hour of 16*2=32 hours/week, there is 35+32=65 peak hours for a 17-hour game. It is difficult to estimate the exact peak user load on the system for a number of reasons: some users will play during the extra-peak time, there may be a peak time in the user's cluster, and the peak time may be affected by the game being played. Types (for example, children's games will probably play at an earlier time in the evening) and other effects. However, assuming that when the player is likely to play the game, the average number of hours played by the player is much less than the number of hours between the players, then only the number of users of the colocation service 210 will use the host generation at a given time. Tube service 210. For this analysis, the peak load will be assumed to be ns%. Therefore, only 12.5% of the computing, compression and bandwidth resources are used to support 136720.doc • 143· 200941233 at a given time, resulting in only 2.5% of hardware cost to support a given user due to resource reuse. Play one of the performance games given levels. In addition, assuming that some games and applications require more computing power than others, then resources can be dynamically allocated based on the game being played by the user or by the application executed by the user. Therefore, users who choose low-performance games or applications will be assigned low-performance (lower-cost) servers 4〇2, and users who choose high-performance games or applications will be assigned high-performance (more expensive) feeders. 402. In fact, a given game or application may have a lower performance and higher performance area of the game or application, and the user can switch from one server 402 to another between games or applications. 402 ' is performed on the lowest cost server 402 that keeps the user in need of a game or application. Note that RAID array 405, which is much faster than a single disk, will be used by even low performance server 402, which has the benefit of faster disk transfer rates. Thus, the average cost per feeder 402 across all played games or applications used is much less than the cost of playing most of the expensive servers 402 of the highest performance game or application, however, even the low performance server 402 Disk performance benefits will also be obtained from RAID array 405. In addition, the server 402 in the colocation service 210 may be only a PC motherboard that does not have a disk or peripheral interface (different from the network interface), and just can be integrated down to a fast network just to the SAN 403. A single wafer of the interface. Also, the RAID array 405 may be shared among a much larger number of users than in the presence of a disk. Thus, the cost per disk of each active user will be much less than that of a disk drive. All of this device will likely reside in a rack in the environment of the server room controlled by 136720.doc 200941233. If the server 402 fails, it can be easily repaired or replaced at the host escrow service 21 。. In contrast, a pc or game console in a home or office must be strong enough to be spared from reasonable wear and tear to prevent a single appliance from being hit or dropped, requiring at least one drive, and must be spared. Under adverse environmental conditions (for example, being forced into a heated AV cabinet with other appliances), a service guarantee is required 'must be packaged and shipped, and sold by a retailer that may receive retail profits. In addition, the pC or game console must be configured to meet the peak performance of the most computationally intensive game or application that will be used at some point in the future, even for lower performance games or applications (or games or applications). It is also possible to play most of the time. In addition, if a pc or console fails, it can be a costly and time consuming process (which adversely affects manufacturers, users, and software developers). Therefore, it is assumed that the system shown in Figure 4a provides the user with an experience equivalent to the experience of the local computing resource for the user to experience the computing power in the home, office or school, via Figure 4a. The architecture shown in the ® provides a much lower computational power. Eliminate the need for upgrades. ‘Users no longer have to worry about upgrading PCs and/or consoles to play new games or handle new applications with higher performance. Any game or application on the colocation service 210 (regardless of the type of server 402 that the game or application requires) can be used by the user and all games and applications are executed in close proximity (ie, fast) Loaded from the RAID array 405 or the local storage on the server 402) and suitably with the latest updates and defects 136720.doc -145- 200941233 fix (ie, the software developer will be able to choose to execute the given game) Or the ideal server configuration of the application server 402, and then the server 402 is configured with the best driver, and then over time, the developer will be able to provide updates, bug fixes, etc. to the host generation over time. Manage all copies of the game or application in service 210). In fact, after the user starts using the colocation service 21, the user may find that the game and the application continue to provide a better experience (for example, via update and/or defect repair) and may be the following: user one year Later, it was discovered that new games or applications can be used to take advantage of the computing technology (for example, a higher-performance GPU) (which does not even exist in a year), so it is impossible for the user to purchase A year ago, the technology to play games or execute applications a year later. Because the computing resources for playing games or executing applications are invisible to the user (i.e., from the user's point of view, the user only chooses a game or application that is close to being executed immediately).
電視上之頻道),所以使用者之硬體將在使用者甚至未意 識到升級之情況下已被「升級」。 消除對於備份之需要 學校及家庭中之使用者的另一較大問題係備 對於商業 份。若磁碟出故障,或若存在無意抹除,則儲存於本端pc 或視訊遊戲控制台中之資訊(例如,在控制台之狀況下, 使用者之遊戲成果及等級)可能丢失。存在提供用於心 手動或自動備份的許多可料應靠式,且可將遊戲控制 台狀態上載至線上伺服器以供備份 製至必須儲存於安全且有組織的某 ’但通常將本端備份複 處之另一本端磁碟(或 136720.doc •146- 200941233 八他非揮發性儲存器件),且由於經由典型低成本網際網 路連接可用之緩慢上行速度而使得對於線上服務之備份常 常有限。在圖4a之主機代管服務21〇下,儲存於rAID陣列 中之資料可使用為熟習此項技術者所熟知之先前技術 RAID組態技術來組態,以使得當磁碟出故障時,將不丟 失《料,且將通知容納出故障之磁碟之伺服器中心處的技 術員,且接著技術員將替換該磁碟,該磁碟接著將被自動 地更新以使得RAID陣列再一次容忍故障。另外,因為所 © 有磁碟機彼此接近且其間具有經由SAN 403之快速本端網 路,所以在伺服器中心中將所有磁碟系統配置為定期地備 份至次級儲存器(其可儲存於伺服器中心處或者經易地重 新定位)並不困難。自主機代管服務21〇之使用者之觀點 看,其資料始終完全安全,且其從不必考慮備份。 對演示之存取 使用者經常希望在購買遊戲或應用程式之前試用遊戲或 應用程式。如先前所描述,存在藉以演示(「演示」之動 詞形式意謂試用演示版本,演示版本亦被稱為「演示」, 但作為一名詞)遊戲及應用程式之先前技術構件,但其中 之每一者遭受限制及/或不便利,使用主機代管服務21〇, 對於使用者而言,容易且便於試用演示。實際上,使用者 所進行的係經由使用者介面(諸如,下文所描述之使用者 介面)選擇演示且試用該演示。演示將幾乎即刻地載入適 合於該演示之伺服器402上,且其將完全類似任何其他遊 戲或應用程式而執行。無論演示需要非常高效能之伺服器 136720.doc -147- 200941233 402還是低效能之伺服器402,且無論使用者使用之家庭或 辦公室用戶端41 5係何類型,自使用者之觀點看,演示均 將工作。遊戲演示或應用程式演示之軟體出版商將能夠確 切地控制准許使用者試用何演示及試用多長時間,且當 然,演示可包括為使用者提供獲得對所演示之遊戲或應用 程式之全版本的存取機會的使用者介面要素。 因為演示可能係低於成本價或免費提供,所以一些使用 者可能試圖使用重複的演示(尤其是重複地玩可能有趣的 ® 遊戲演示)。主機代管服務210可使用各種技術來限制用於 給定使用者之演示使用。最直接的方法係建立用於每一使 用者之使用者ID且限制允許給定使用者id播放演示之次 數。然而’使用者可設置多個使用者ID,尤其是其係自由 的情況下。用於解決此問題之一技術係限制允許給定用戶 端41 5播放演示之次數。若用戶端為獨立器件,則該器件 將具有一序號’且主機代管服務210可限制演示可由具有 彼序號之用戶端存取之次數。若用戶端415正以PC或其他 器件上之軟體執行’則可由主機代管服務21 〇來指派序號 且將該序號儲存於PC上並使用該序號來限制演示使用,但 假定PC可由使用者來重新程式化,且序號被抹除或改變, 則另一選項係主機代管服務210保持PC網路配接器媒體存 取控制(MAC)位址(及/或其他機器特定識別符,諸如硬碟 機序號等)之紀錄並將演示使用限制於該MAC位址。假定 可改變網路配接器之MAC位址,然而,此並非極簡單的方 法。另一方法係限制演示可被播放至給定IP位址之次數。 136720.doc -148- 200941233 儘管可由電纜數據機及DSL提供者來週期性地重新指派ιρ 位址,但其在實踐中不會非常頻繁地發生,且若可θ判定 (例如,藉由聯繫isP)ip係處於用於住宅DSL或電纜數據$ 存取之IP位址之區塊中,則通常可建立用於給定家庭的小 數目之演示使用。又,在家庭中在共用同一 Ip位址之NAT 路由器之後可能存在多個器件,但通常在住宅背景中,將 存在有限數目之該等器件。若IP位址係處於伺服商業之區 塊中,則可建立用於商業之較大數目之演示。但是,^ © 後,所有先前所述方法之組合係限制PC上之演示之數目的 最佳方式。儘管可能不存在使得所判定的且技術上熟練的 使用者可能在重複播放演示之數目中受到限制的極簡單之 方式,但建立大量障礙可建立足夠阻礙以使得大多數?〇使 用者不值得費神去溢用演示系統,且相反,其在其意欲試 用新遊戲及應用程式時使用演示。 對學校、商業及其他穢構之益處 顯著益處尤其出現於利用圖4a中所展示之系統之商業、The channel on the TV), so the user's hardware will be "upgraded" even if the user does not even know about the upgrade. Eliminating the need for backups Another big problem for users in schools and homes is for commercial use. If the disk fails, or if there is an inadvertent erasure, the information stored in the local PC or video game console (for example, in the case of the console, the user's game results and ratings) may be lost. There are many dependencies available for manual or automatic backup, and the game console status can be uploaded to an online server for backup to a safe and organized one, but usually the local backup Re-addressing another local disk (or 136720.doc • 146-200941233 eight non-volatile storage devices), and often makes backups for online services due to the slow upstream speed available via typical low-cost internet connections limited. In the hosted service 21 of Figure 4a, the data stored in the rAID array can be configured using prior art RAID configuration techniques well known to those skilled in the art, such that when the disk fails, The material is not lost and the technician at the server center hosting the failed disk will be notified, and then the technician will replace the disk, which will then be automatically updated to cause the RAID array to tolerate the failure again. In addition, because the drives are close to each other with a fast local network via the SAN 403, all disk systems are configured to be periodically backed up to secondary storage in the server center (which can be stored in It is not difficult to relocate at the center of the server or easily. From the point of view of the hosted service user, the data is always completely secure and never has to be considered for backup. Access to the presentation Users often want to try out a game or application before purchasing a game or application. As previously described, there are demonstrations (the "verb" form means a trial demo version, and the demo version is also called a "demo", but as a noun) a prior art component of a game and application, but each of them Subject to restrictions and/or inconvenience, the use of colocation services 21 is easy and convenient for the user to try out the demo. In effect, the user performs the presentation and trials the presentation via a user interface, such as the user interface described below. The presentation will load almost instantly onto the server 402 suitable for the presentation, and it will execute exactly like any other game or application. Regardless of whether the presentation requires a very efficient server 136720.doc -147- 200941233 402 is still a low-performance server 402, and regardless of the type of home or office client used by the user, from the perspective of the user, the presentation Will work. A software publisher of a game demo or application demo will be able to precisely control how long the demo and trials are allowed for the user to try, and of course, the demo may include providing the user with a full version of the game or application being demonstrated. The user interface element of the access opportunity. Because the presentation may be below cost or free of charge, some users may try to use repeated presentations (especially repeating the potentially interesting ® game demos). The colocation service 210 can use various techniques to limit the presentation usage for a given user. The most straightforward method is to establish a user ID for each user and limit the number of times the given user id is allowed to play the presentation. However, the user can set multiple user IDs, especially if they are free. One technique for solving this problem is to limit the number of times a given user 41 5 can play a presentation. If the client is a standalone device, the device will have a sequence number' and the colocation service 210 can limit the number of times the presentation can be accessed by the client with the serial number. If the client 415 is executing on a PC or other device's software, then the host can be assigned a serial number by the host server and the serial number is stored on the PC and the serial number is used to limit the presentation usage, but the PC is assumed to be available to the user. Reprogramming, and the sequence number is erased or changed, then another option is that the colocation service 210 maintains the PC network adapter media access control (MAC) address (and/or other machine specific identifiers, such as hard Record the number of the disc player, etc.) and limit the use of the demo to the MAC address. It is assumed that the MAC address of the network adapter can be changed, however, this is not an extremely simple method. Another method is to limit the number of times a presentation can be played to a given IP address. 136720.doc -148- 200941233 Although the IP address can be reassigned periodically by cable modems and DSL providers, it does not occur very frequently in practice, and if θ can be determined (eg, by contacting isP) The ip system is located in a block of IP addresses for residential DSL or cable data access, and typically a small number of presentations for a given home can be established. Also, there may be multiple devices in the home after a NAT router sharing the same IP address, but typically in a residential setting, there will be a limited number of such devices. If the IP address is in the servo commercial block, a larger number of presentations for the business can be established. However, after ^ ©, all combinations of the previously described methods are the best way to limit the number of presentations on the PC. While there may be no very simple way to make the determined and technically skilled user likely to be limited in the number of replayed presentations, creating a large number of obstacles can create enough obstacles to make the majority? 〇 Users are not worth the trouble to use the demo system, and instead, they use the demo when they want to try out new games and applications. Benefits to School, Business, and Other Structures Significant benefits especially occur in the commercial use of the system shown in Figure 4a,
學校及其他機構。商業及學校具有與安裝、維護及升級PC 相關聯之實質成本,尤其當談及執行諸如Maya之高效能應 用程式之PC如先前所陳述,PC通常僅在—週之小時 77率中被利用,且如在家庭中,具有給定位準之效能 能力的在辦公室或學校環境中之成本遠高於在舰器中 心環境中之成本。 在較大商業或學校(例如,大的大學)之狀況下該等實 體之IT部門設置伺服器中心且維護經由LAN級連接而遠端 136720.doc •149- 200941233 地存取之電版》可係實際的。存在用於經由LAN或經由辦公 室之間的私用高頻寬連接而遠端存取電腦的許多解決方 法。舉例而言’藉由Microsoft之Windows終端機伺服器, 或者藉由虛擬網路e十算應用程式(如來自ReaivNc有限公司 之VNC)或者藉由來自Sun Microsystems之精簡型用戶端構 件,使用者可獲得對PC或伺服器之遠端存取,在圖形回應 時間及使用者體驗中具有一系列品質。另外,該等自行管 理之伺服器中心通常專用於單一商業或學校,且因此不能 © 夠利用在全異應用程式(例如,娛樂及商業應用程式)在一 週之不同時間利用同一計算資源時所可能的使用之重疊。 因此,許多商業及學校缺乏獨立設置具有至每一使用者之 LAN速度之網路連接的伺服器中心之規模、資源或專門技 能。實際上,大百分比之學校及商業具有與家庭相同之網 際網路連接(例如,DSL、電纜數據機)。 然而,該等組織仍可能具有對於非常高效能之計算的需 要(或者定期地或者週期性地)。舉例而言,小建築公司可 能僅具有小數目之建築師,當進行設計工作時,具有相對 適度之計算需要,但其可能週期性地需要非常高效能之3D 計算(例如,當建立用於用戶端之新建築設計的扣穿越 時)。圖4a中所展示之系統極其適合於該等組織。該等組 織僅需要為提供至家庭之同一種類之網路連接(例如, DSL、電纜數據機)且通常非常低廉。其可利用低廉的?。 乍^用戶端415,或者完全沒有Pc亦可,而利用僅實施控 制信號邏輯413及低延時視訊解壓縮412之低廉的專用器 136720.doc 200941233 件此等特徵對於可能具有pc之偷竊或對pc内之專用組 件之損壞的問題的學校特別有吸引力。 此種配置解決了用於該等組織之許多問題(且許多此等 優點亦為進行通用計算之家庭使用者共用)。舉例而言, '成本(其最終必須以某種形式傳遞回至使用者以便具 有可行的商業)可能低得多,因為⑷計算資源係與在一週 中具有不同峰值使用時間的其他應用程式共用,⑻該等組 織可僅在需要時獲得(且招致成本)對高效能計算資源之存 ❹取’⑷該等組織不必提供用於備份或以其他方式維護高效 能計算資源之資源。 盜版之消除 另外’遊戲、應用程式、互動式電影等可能不再如現今 這樣被盜版。因為遊戲係在伺服器中心處執行,所以使用 者不具備對於基本程式碼之存取,因此不存在盜版。即使 使用者將要複製原始碼,使用者亦不能夠在標準遊戲控制 台或家庭電腦上執行該碼。此打開了標準視訊遊戲不可用 之世界各地(諸如’中國)的市場。已使用之遊戲之重新銷 售亦係不可能的。 對於遊戲開發商而言,如同現今之狀況,存在較少市場 不連續性。與全新的一代技術迫使使用者及開發商升級且 遊戲開發商係取決於硬體平台之及時遞送的當前情形對 比’可隨著時間隨著遊戲要求改變而逐漸地更新主機代管 服務2 1 0。 串流互動式視訊 136720.doc • 151 - 200941233 以上描述提供由以通用網際網路為基礎的低延時_流互 動式視訊(其隱含地亦包括連同視訊一起之音訊,如本文 中所使用)之新穎基本概念致能的多種應用。經由網際網 路而提供串流視訊之先前技術系統僅具有可藉由高延時互 動實施的所致能之應用。舉例而言,用於線性視訊之基本 回放控制(例如,暫停、回倒、快進)在高延時下適當地工 作,且有可能線上性視訊饋送當中進行選擇。此外,如先 前所陳述,一些視訊遊戲之性質允許其以高延時來播放。 ❹但是’用於串流視訊之先前技術方法之高延時(或低壓縮 比率)嚴重限制串流視訊的潛在應用或使其部署變窄至專 門化的網路環境,且甚至在該等環境中,先前技術亦引入 網路上之實質負擔。本文中所描述之技術打開了在經由網 際網路之低延時宰流互動式視訊下可能的多種應用的大 門’尤其是經由消費者級網際網路連接而致能之彼等應 465 一般小之用戶端器件Schools and other institutions. Businesses and schools have substantial costs associated with installing, maintaining, and upgrading PCs, especially when it comes to implementing PCs such as Maya's high-performance applications. As stated previously, PCs are typically only used in the hour-to-week rate of 77. And in the home, the cost in an office or school environment with the ability to position the quasi-performance is much higher than in the center of the ship. In the case of larger businesses or schools (eg, large universities), the IT department of these entities sets up the server center and maintains the electronic version accessed via the LAN-level connection and the remote 136720.doc • 149-200941233. It is actual. There are many solutions for remote access to a computer via a LAN or via a private high frequency wide connection between offices. For example, 'through Microsoft's Windows terminal server, or through a virtual network e-application (such as VNC from ReaivNc Ltd) or through a thin client-side component from Sun Microsystems, users can Get remote access to a PC or server with a range of qualities in graphical response time and user experience. In addition, these self-managed server centers are typically dedicated to a single business or school, and therefore cannot be used to exploit the same computing resources at different times of the week in disparate applications (eg, entertainment and business applications). The overlap of use. Therefore, many businesses and schools lack the scale, resources, or expertise to independently set up a server center with a network connection to each user's LAN speed. In fact, a large percentage of schools and businesses have the same Internet connections as homes (eg, DSL, cable modems). However, such organizations may still have the need for very high performance calculations (either periodically or periodically). For example, a small construction company may have only a small number of architects, with relatively modest computing needs when designing, but it may periodically require very efficient 3D calculations (for example, when building for users) When the buckle of the new architectural design is crossed,). The system shown in Figure 4a is extremely suitable for such organizations. These organizations only need to provide the same type of network connection (e.g., DSL, cable modem) to the home and are typically very inexpensive. It can be used at low cost.乍^Client 415, or no Pc at all, and using the low-cost dedicated device 136720.doc 200941233 which only implements control signal logic 413 and low-latency video decompression 412. These features may be stolen or against pc. Schools with problems with damaged special components are particularly attractive. This configuration solves many of the problems for such organizations (and many of these advantages are also shared by home users who perform general purpose computing). For example, 'cost (which ultimately must be passed back to the user in some form to have a viable business) may be much lower because (4) the computing resource is shared with other applications that have different peak usage times during the week, (8) These organizations may obtain (and incur costs) access to high-performance computing resources only when needed' (4) such organizations do not have to provide resources for backing up or otherwise maintaining high-performance computing resources. Elimination of piracy In addition, games, applications, interactive movies, etc. may no longer be pirated as they are today. Since the game is executed at the server center, the user does not have access to the basic code, so there is no piracy. Even if the user is going to copy the source code, the user cannot execute the code on a standard game console or home computer. This opens up markets around the world where standard video games are not available (such as 'China'). Resale of games that have already been used is also impossible. For game developers, there are fewer market discontinuities as they are today. With the new generation of technology forcing users and developers to upgrade and the game developers are dependent on the current situation of the timely delivery of the hardware platform. 'The escrow service can be gradually updated as the game requirements change over time. 2 1 0 . Streaming Interactive Video 136720.doc • 151 - 200941233 The above description provides low latency _ stream interactive video based on the Universal Internet (which also implicitly includes audio along with video, as used herein) The novel basic concepts enable multiple applications. Prior art systems that provide streaming video over the Internet have only those applications that can be implemented by high latency interactions. For example, basic playback controls (e.g., pause, rewind, fast forward) for linear video work properly at high latency, and it is possible to select among the online video feeds. Moreover, as previously stated, the nature of some video games allows them to be played with high latency. However, the high latency (or low compression ratio) of the prior art method for streaming video severely limits the potential application of streaming video or narrows its deployment to a specialized network environment, and even in such environments. The prior art also introduced a substantial burden on the Internet. The techniques described in this article open the door to a variety of applications that may be possible under low-latency, slaughter interactive video over the Internet, especially when enabled via consumer-grade Internet connectivity. Client device
實際上,在與圖4C之用 下,足以藉由有效的任意量之計篡 r异此力、任意量之快速儲 存及強大祠服器之間的極快網路 格運接而提供增強的使用者 體驗’其致能新的計算時代。另 奸么从 ^另外’因為頻寬要求並不隨 著系統之計算能力增長而增 θ㈣增長(亦即’因為頻寬要求僅係 關於顯示解析度、品質及圖框速率),所以 係 際網路連接性係普遍存在^ t頻帶網 無線⑼經由分布廣的低延時 無線涵幻、可㈣且具有足W足 件422之需要的足夠高之頻 I之顯4 則問題將係典型消費者及 136720.doc -152- 200941233 商業應用所必要的是厚重用戶端(諸如,執行偏應、In fact, with the use of Figure 4C, it is sufficient to provide enhanced by any amount of effective force, any amount of fast storage, and extremely fast network connection between powerful servers. The user experience 'enables a new era of computing. Others from the ^ other 'because the bandwidth requirements do not increase with the computing power of the system θ (four) growth (that is, because the bandwidth requirements are only about display resolution, quality and frame rate), so the network The road connectivity is ubiquitous. The problem is that typical wireless consumers (9) will be able to pass through a widely distributed low-latency wireless phantom, and (4) and have a sufficiently high frequency I for the needs of the W-foot 422. 136720.doc -152- 200941233 What is necessary for business applications is a thick client (such as performing bias,
LinuX、〇SX等之PC或行動電話)還是甚至精簡型用戶端(諸 如,Adobe Flash或 Java)。 串流互動式視訊之出現導致關於計算架構之結構的假定 之重新考慮。此之-實例係圖15中所展示之主機代管服務 210伺服器中心實施例。用於延遲緩衝〇器及/或分群視訊 1550之視訊路徑係反饋迴路,其中應用程式/遊戲词服器 ΟLinuX, 〇SX, etc. PC or mobile phone) is even a thin client (such as Adobe Flash or Java). The emergence of streaming interactive video has led to a reconsideration of assumptions about the structure of the computing architecture. This is an example of a colocation service 210 server center embodiment shown in FIG. For the delay buffer buffer and / or group video 1550 video path feedback loop, where the application / game word processor Ο
152U525之經多播之串流互動式視訊輸出經由路徑收 而即時地或者經由路徑1551在可選擇之延遲之後經反饋回 至應用程式/遊戲籠器〗521_1525中。此致能藉由先前技 術词服器或本端計算架構將係不可能或不可行的多種實際 應用(例如’諸如圖!6、圖17及圖2〇中所說明之彼等應 )4是作為更一般之架構特徵,反饋迴路155〇所提 供的為串流互動式視訊位準下之遞歸’因為可在應用程式 需要視訊時將視訊無限地循環。此致能之前從未可用的多 種應用可能性。 另一關鍵架構特徵在於:視訊流係單向1;]〇1>流。此有效 地致旎串流互動式視訊之任意程度的多播(相比之下諸 如TCP/IP流之雙向流將隨著使用者之數目増加而在來自來 回通售之網路上產生愈加更多的訊務停滯)。多播係伺服 17 之重要旎力,因為其允許系統對網際網路使用者 (且實際上,世界之人口)之增長的需要作出回應以在一對 多或甚至多對多基礎上通信。再次,本文中所論述的說明 互動式視訊遞歸與多播兩者之使用的實例(諸如,圖 136720.doc -153- 200941233 16)僅為具有可能性之非常大之冰山的央端。 在一實施例中’本文中所說明之各種功能模組及相關聯 之步驟可由含有用;^執行該等步驟之固線式邏輯的特定硬 體組件(諸如’特殊應用積體電路(「ASIC」))或由經程式 化之電腦組件與定製硬體組件之任何組合來執行。 實施例中,可將該等模組實施於諸如Texas儀器的 TMS320x 架構(例如 ’ TMS32〇C6〇〇〇、tmS32()C5⑼〇,The multicast streaming video output of the 152U525 is routed back to the application/game cage 521_1525 via the path or via the path 1551 after a selectable delay. This can be achieved by a variety of practical applications (such as those described in Figures 6 and 17 and Figure 2) that are not possible or feasible by the prior art word processor or the local computing architecture. The more general architectural feature, the feedback loop 155〇 provides recursiveness for streaming interactive video levels' because the video can be looped indefinitely when the application needs video. There are many application possibilities that have never been available before. Another key architectural feature is that the video stream is unidirectional 1;] 〇 1 > stream. This effectively results in any degree of multicasting of streaming interactive video (compared to a two-way stream such as TCP/IP streaming that will increase over the network from back and forth as the number of users increases) The traffic is stagnant). Multicast is an important force in the servo 17 because it allows the system to respond to the growing need of Internet users (and indeed the world's population) to communicate on a one-to-many or even many-to-many basis. Again, the examples discussed in this article that illustrate the use of both interactive video recursion and multicast (such as Figure 136720.doc -153 - 200941233 16) are only the central end of the very large iceberg. In one embodiment, the various functional modules and associated steps described herein may be comprised of specific hardware components (such as 'special application integrated circuits ("ASICs) that are used to perform the fixed-line logic of the steps. ")) or by any combination of stylized computer components and custom hardware components. In an embodiment, the modules can be implemented in a TMS320x architecture such as the Texas Instruments (e.g., 'TMS32〇C6〇〇〇, tmS32()C5(9)〇,
❹ 等)之可程式化數位信號處理器(「DSp」)上。可使用各種 不同的DSP,同時仍遵守此等基本原理。 實施例可包括如上文所闡述之各種步驟。該等步驟可體 現於引起通用或專用處理器執行特定步驟之機器可執行指 7中。已將與此等基本原理無關之各種元件(諸如,電腦 。己隐體、硬碟機、輸入器件)自圖中省去以避免混清相關 態樣。 所揭示之標的物之要素亦可作為用於儲存機器可執行指 令之機器可讀媒體來提供。機器可讀媒體可包括(但不限 於)快閃記憶體、光碟、CD-R0M、DVD R〇M、RAM、 EPROM、EEPR〇M、磁卡或光卡、傳播媒體或適合於儲存 電子指令之其他類型之機器可讀媒體。舉例而言,本發明 可作為電腦程式來下載,該電腦程式可經由通信鏈路(例 如,數據機或網路連接)藉助於體現於載波或其他傳播媒 體中之資料信號而自遠端電腦(例如,伺服器)傳送至請求 電腦(例如,用戶端)。 亦應理解,所揭*之標的物之要素亦可作為電腦程式產 I36720.doc -154- 200941233 ^來提供,該電卿式產品可包括在上 器可讀媒體,該等指令可佯有私令之機 哥钿7可用於程式化電腦(例如. 或其他電子器件)以勃并 ’處理器 电于器件)以執仃一序列操作。 藉由硬體與敕艚之细入水私 该等#作可 、軟體之組口來執行。機器可讀媒 二於)軟性磁碟、光碟、—及磁光碟= ❹❹, etc.) can be programmed on a digital signal processor ("DSp"). A variety of different DSPs can be used while still adhering to these basic principles. Embodiments may include various steps as set forth above. These steps may be embodied in a machine executable finger 7 that causes a general purpose or special purpose processor to perform particular steps. Various components (such as computers, camcorders, hard drives, input devices) that are not related to these basic principles have been omitted from the figure to avoid mixing the relevant aspects. The elements of the subject matter disclosed may also be provided as a machine-readable medium for storing machine-executable instructions. A machine-readable medium can include, but is not limited to, a flash memory, a compact disc, a CD-ROM, a DVD R〇M, a RAM, an EPROM, an EEPR®, a magnetic or optical card, a broadcast medium, or other suitable for storing electronic instructions. A type of machine readable medium. For example, the present invention can be downloaded as a computer program that can be accessed from a remote computer via a communication link (eg, a data modem or a network connection) by means of a data signal embodied in a carrier wave or other communication medium ( For example, the server) is transferred to the requesting computer (eg, the client). It should also be understood that the elements of the subject matter disclosed may also be provided as computer program products I36720.doc -154- 200941233^, which may be included in the readable medium of the device, and the instructions may be private. The machine can be used to program a computer (for example, or other electronic devices) to perform a sequence of operations. It is carried out by the combination of hardware and enthalpy into the water. Machine readable medium 2) Soft disk, CD, and CD-ROM = ❹
:應、卿職、磁卡或光卡、傳_體或適合 於儲存電子指令之其他類型之媒體/機器可讀媒體。舉例 而3,所揭示之標的物之要素可作為電腦程式產品來下 載,其中程式可經由通信鍵路(例如,數據機或網路連接) 藉助於體現於載波或其他傳播媒體中之資料信號而自遠端 電腦或電子器件傳送至請求過程。 另外,儘管已結合特定實施例描述所揭示之標的物,但 眾多修改及變更將適當地處於本揭示案之範疇内。因此, 說明書及圖式應視為說明性的而非限制性的意義。 【圖式簡單說明】 圖1說明先前技術視訊遊戲系統之架構。 圖2 a至圖2 b說明根據一實施例之高階系統架構。 圖3說明用於用戶端與伺服器之間的通信的實際的、額 定的及所需的資料速率。 圖4a說明根據一實施例而使用的主機代管服務及用戶 端。 圖4b說明與用戶端與主機代管服務之間的通信相關聯的 例示性延時。 圖4c說明根據一實施例之用戶端器件。 136720.doc -155- 200941233 圖4d說明根據另一實施例之用戶端器件。 圖4e說明圖4c中之用戶端器件的實例方塊圖。 圖4f說明圖4d中之用戶端器件的實例方塊圖。 圖5說明可根據一實施例而使用的視訊壓縮之一實例形 式。 圖6 a說明可在另一實施例中使用的視訊壓縮之一實例形 式。 圖6b說明與傳輸低複雜度、低動作視訊序列相關聯的資 ❹ 料速率中之峰值。 圖6c說明與傳輸高複雜度、高動作視訊序列相關聯的資 料速率中之峰值。 圖7a至圖7b說明在一實施例中使用之實例視訊壓縮技 術。 圖8說明在一實施例中使用之額外實例視訊壓縮技術。 圖9a至圖9c說明在一實施例中使用以用於緩解資料速率 峰值的實例技術。 圖10a至圖1 Ob說明將影像影像塊有效地封裝於封包内的 一實施例。 圖11a至圖lid說明使用前向錯誤校正技術之實施例。 圖12說明使用多核心處理單元來進行壓縮之一實施例。 圖13a至圖13b說明根據各種實施例之主機代管服務之間 的地理定位及通信。 圖14說明與用戶端與主機代管服務之間的通信相關聯的 例示性延時。 136720.doc • 156· 200941233 圖15說明實例主機代管服務伺服器中心架構。 圖16說明包括複數個現場直播之視訊窗的使用者介面之 一實施例的實例螢幕拍攝。 圖17說明在選擇特定視訊窗之後的圖16之使用者介面。 圖1 8說明在將特定視訊窗放大至全螢幕大小之後的圖17 之使用者介面。 圖19說明上覆於多人遊戲之螢幕上的實例合作使用者視 訊資料。: should, clerk, magnetic or optical card, _ body or other type of media/machine readable medium suitable for storing electronic instructions. For example, the elements of the disclosed subject matter can be downloaded as a computer program product, wherein the program can be transmitted via a communication key (eg, a data machine or a network connection) by means of a data signal embodied in a carrier wave or other communication medium. Transferred from the remote computer or electronic device to the request process. In addition, while the disclosed subject matter has been described in connection with the specific embodiments, numerous modifications and variations are Accordingly, the specification and drawings are to be regarded as illustrative rather BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 illustrates the architecture of a prior art video game system. 2a through 2b illustrate a high level system architecture in accordance with an embodiment. Figure 3 illustrates the actual, rated, and required data rate for communication between the client and the server. Figure 4a illustrates a colocation service and a client used in accordance with an embodiment. Figure 4b illustrates an exemplary delay associated with communication between the client and the colocation service. Figure 4c illustrates a client device in accordance with an embodiment. 136720.doc -155- 200941233 Figure 4d illustrates a client device in accordance with another embodiment. Figure 4e illustrates an example block diagram of the client device of Figure 4c. Figure 4f illustrates an example block diagram of the client device of Figure 4d. Figure 5 illustrates an example of video compression that may be used in accordance with an embodiment. Figure 6a illustrates one example of video compression that may be used in another embodiment. Figure 6b illustrates the peak in the rate of the resource associated with transmitting a low complexity, low motion video sequence. Figure 6c illustrates the peak in the data rate associated with transmitting a high complexity, high motion video sequence. Figures 7a through 7b illustrate an example video compression technique used in an embodiment. Figure 8 illustrates an additional example video compression technique used in an embodiment. Figures 9a through 9c illustrate example techniques for use in mitigating data rate peaks in an embodiment. Figures 10a through 1B illustrate an embodiment of efficiently packaging a block of image images within a packet. Figures 11a through 15 illustrate an embodiment using a forward error correction technique. Figure 12 illustrates an embodiment of compression using a multi-core processing unit. Figures 13a-13b illustrate geolocation and communication between colocation services, in accordance with various embodiments. Figure 14 illustrates an exemplary delay associated with communication between the client and the colocation service. 136720.doc • 156· 200941233 Figure 15 illustrates an example host hosting service server central architecture. Figure 16 illustrates an example screen shot of an embodiment of a user interface including a plurality of live video windows. Figure 17 illustrates the user interface of Figure 16 after selection of a particular video window. Figure 18 illustrates the user interface of Figure 17 after a particular video window has been enlarged to full screen size. Figure 19 illustrates example collaborative user video material overlaid on a multiplayer game screen.
圖20說明用於主機代管服務上的一遊戲玩家之實例使用 者頁面。 圖21說明實例3D互動式廣告。 圖22說明用於㈣場直播之表演的表面俘獲產生具有紋 理表面之照片般逼真的影像的實例步驟序列。 圖23說明允許選擇線性媒體內& τ %伴琛『生姝骽円谷之實例使用者介面頁 面。Figure 20 illustrates an example user page for a game player on a colocation service. Figure 21 illustrates an example 3D interactive advertisement. Figure 22 illustrates an example sequence of steps for surface capture for a (four) live broadcast performance to produce a photorealistic image with a textured surface. Figure 23 illustrates an example user interface page that allows selection of & τ % in the linear media.
圖24為說明在現場直播網頁之前消逝的時間量與連接速 之曲始国^ 度之曲線圖 【主要元件符號說明】 100 101 102 103 104 105Figure 24 is a graph showing the amount of time elapsed before the live broadcast of the web page and the starting speed of the connection speed. [Main component symbol description] 100 101 102 103 104 105
CPU/GPU 隨機存取記憶體(RAM) 顯示器件(SDTV/HDTV或電腦監視器) 硬碟機 光學媒體驅動器/光學媒趙/光碟機 網路連接 136720.doc -157- 200941233 〇 ❹ 106 遊戲控制器 205 用戶端器件/用戶端/用戶端平台 206 網際網路 210 主機代管服務/主機代管系統 211 使用者場所 220 遊戲或應用程式軟體開發商 221 輸入器件 222 顯示器件/監視器或電視機 301 標稱最大資料速率 302 可用最大資料速率 303 所需的資料速率 401 主機代管服務控制系統/主機代管服務控制 伺服器 402 伺服器 403 儲存區域網路(SAN) 404 視訊壓縮邏輯/視訊壓縮器 405 獨立冗餘磁碟陣列(RAID) 406 控制信號 406a 控制信號 406b 控制信號 409 路由邏輯 410 網際網路 412 低延時視訊解壓縮邏輯 413 控制信號邏輯 136720.doc -158- 200941233 415 420 421 422 440 441 442 443 Ο 444 451 452CPU/GPU random access memory (RAM) display device (SDTV/HDTV or computer monitor) hard disk drive optical media drive / optical media Zhao / CD player network connection 136720.doc -157- 200941233 〇❹ 106 game control 205 Client Device/Client/Client Platform 206 Internet 210 Hosting Service/Hosting System 211 User Location 220 Game or Application Software Developer 221 Input Device 222 Display Device/Monitor or TV 301 nominal maximum data rate 302 available maximum data rate 303 required data rate 401 colocation service control system / colocation service control server 402 server 403 storage area network (SAN) 404 video compression logic / video compression 405 Independent Redundant Disk Array (RAID) 406 Control Signal 406a Control Signal 406b Control Signal 409 Routing Logic 410 Internet 412 Low Latency Video Decompression Logic 413 Control Signal Logic 136720.doc -158- 200941233 415 420 421 422 440 441 442 443 Ο 444 451 452
453 454 455 456 457 458 462 463 464 465 466 468 用戶端/用戶端器件/用戶端電腦 顯示器件 輸入器件 顯示器件/顯示器 網際網路繞過服務 存在點 WAN介面 防火牆/路由器/NAT(網路位址轉譯)器件 WAN介面 用於發送控制信號之單向傳輸時間 經由使用者場所之來回行程路由/使用者場 所路由 箭頭/來回行程延遲/使用者ISP 通用網際網路延時 单向路由 最大單向延時 箭頭/壓縮 視訊解壓縮 乙太網路插孔/網際網路連接 HDMI(高清晰度多媒體介面)、連接器 顯示能力 用戶端器件/用戶端 遮光眼鏡453 454 455 456 457 458 462 463 464 465 466 468 Client/Client Device/Customer Computer Display Device Input Device Display Device/Monitor Internet Bypass Service Presence WAN Interface Firewall/Router/NAT (Network Address Translation) Device WAN interface is used to send control signals for one-way transmission time. Round trip routing via user location / user location routing arrow / round trip delay / user ISP universal internet delay one-way routing maximum one-way delay arrow /Compressed Video Decompression Ethernet Hub/Internet Connection HDMI (High Definition Multimedia Interface), Connector Display Capability Client Device/User Side Panel Glasses
顯示器件/SDTV(標準清晰度電視)或HDTV 136720.doc -159- 200941233 〇 ❹ 469 (高清晰度電視)/監視器 輸入器件 475 用戶端器件 476 快閃記憶體 477 視訊相機 478 顯示器件 479 藍芽輸入器件/有線USB輸入器件 480 匯流排 481 乙太網路介面 482 WiFi子系統 483 控制CPU/控制處理器 484 藍芽介面 485 USB子系統 486 視訊解壓縮器 487 視訊輸出子系統 488 音訊解壓縮子系統 489 音訊輸出子系統 490 HDMI介面 491 DVI-I 492 S-視訊 493 複合視訊 494 數位介面 495 立體類比介面 497 乙太網路 136720.doc -160· 200941233 ❹Display device / SDTV (standard definition TV) or HDTV 136720.doc -159- 200941233 〇❹ 469 (high definition television) / monitor input device 475 client device 476 flash memory 477 video camera 478 display device 479 blue Bud Input Device / Wired USB Input Device 480 Bus 481 Ethernet Interface 482 WiFi Subsystem 483 Control CPU / Control Processor 484 Bluetooth Interface 485 USB Subsystem 486 Video Decompressor 487 Video Output Subsystem 488 Audio Decompression Subsystem 489 Audio Output Subsystem 490 HDMI Interface 491 DVI-I 492 S-Video 493 Composite Video 494 Digital Interface 495 Stereo Analog Interface 497 Ethernet 136720.doc -160· 200941233 ❹
499 電力 501 未經壓縮之視訊圖框 502 未經壓縮之視訊圖框 503 未經壓縮之視訊圖框 511 經壓縮之圖框 512 經壓縮之圖框 513 經壓縮之圖框 520 壓縮邏輯 559-561 未經壓縮之視訊圖框 611 I圖框 612-613 P圖框 620 壓縮邏輯 621 額定最大資料速率 622 可用最大資料速率/可用資料速率 623 I圖框所需之峰值資料速率/峰值資料速率 624 視訊流資料速率/視訊流資料速率序列 633 I圖框峰值 634 視訊流資料速率序列/視訊流資料速率 635 P圖框峰值 636 P圖框峰值 670 B圖框 671 I圖框 701-760 未經壓縮之圖框 711-770 R圖框 136720.doc .161 · 200941233499 Power 501 Uncompressed Video Frame 502 Uncompressed Video Frame 503 Uncompressed Video Frame 511 Compressed Frame 512 Compressed Frame 513 Compressed Frame 520 Compression Logic 559-561 Uncompressed video frame 611 I frame 612-613 P frame 620 compression logic 621 rated maximum data rate 622 maximum data rate available / available data rate 623 I required peak data rate / peak data rate 624 video Stream data rate / video stream data rate sequence 633 I frame peak 634 video stream data rate sequence / video stream data rate 635 P frame peak 636 P frame peak 670 B frame 671 I frame 701-760 uncompressed Frame 711-770 R frame 136720.doc .161 · 200941233
721-770 未經壓縮之圖框 731-780 R圖框 805 移動人物 811 R圖框 812 R圖框 922 可用最大資料速率 934 視訊流資料速率 941 峰值資料速率/峰值最大資料速率 942 2倍峰值資料速率 943 3倍峰值資料速率 944 4倍峰值資料速率 952 圖框2倍峰值 953 平坦化的2倍峰值 954 圖框4倍峰值 955 平坦化的4倍峰值 961 未經壓縮之圖框1 962 未經壓縮之圖框2 963 未經壓縮之圖框3 964 未經壓縮之圖框4 965 未經壓縮之圖框5 966 未經壓縮之圖框6 967 未經壓縮之圖框7 968 未經壓縮之圖框8 969 未經壓縮之圖框9 136720.doc 162- 200941233721-770 Uncompressed frame 731-780 R frame 805 Mobile character 811 R frame 812 R frame 922 Available maximum data rate 934 Video stream data rate 941 Peak data rate / peak maximum data rate 942 2 times peak data Rate 943 3 times peak data rate 944 4 times peak data rate 952 frame 2 times peak 953 flattened 2 times peak 954 frame 4 times peak 955 flattened 4 times peak 961 uncompressed frame 1 962 without Compressed frame 2 963 Uncompressed frame 3 964 Uncompressed frame 4 965 Uncompressed frame 5 966 Uncompressed frame 6 967 Uncompressed frame 7 968 Uncompressed Box 8 969 Uncompressed frame 9 136720.doc 162- 200941233
970 未經壓縮之圖框10 981 經壓縮之圖框1 982 經壓縮之圖框2 983 經壓縮之圖框3 985 經壓縮之圖框5 986 經壓縮之圖框6 987 經壓縮之圖框10 991 傳輸時間(xmit時間) 992 傳輸時間 993 傳輸時間(2倍峰值) 995 傳輸時間 996 傳輸時間(4倍峰值) 997 傳輸時間 1001-1005 封包 1010 影像塊包裝封裝邏輯 1100 I影像塊 1101 前向錯誤校正碼(FEC) 1103 I影像塊 1104 前向錯誤校正碼(FEC) 1105 前向錯誤校正碼(FEC) 1110 音訊封包 1111 FEC碼 1112 音訊封包 1113 FEC碼 136720.doc -163- 200941233970 uncompressed frame 10 981 compressed frame 1 982 compressed frame 2 983 compressed frame 3 985 compressed frame 5 986 compressed frame 6 987 compressed frame 10 991 Transmission time (xmit time) 992 Transmission time 993 Transmission time (2 times peak value) 995 Transmission time 996 Transmission time (4 times peak value) 997 Transmission time 1001-1005 Packet 1010 Image block package package logic 1100 I image block 1101 Forward error Correction Code (FEC) 1103 I Image Block 1104 Forward Error Correction Code (FEC) 1105 Forward Error Correction Code (FEC) 1110 Audio Packet 1111 FEC Code 1112 Audio Packet 1113 FEC Code 136720.doc -163- 200941233
1120 使用者輸入命令 1121 FEC碼 1122 使用者輸入命令 1123 FEC碼 1200 多核及/或多處理器 1201-1208 核心 1205 4x2配置/未經壓縮之圖框 1300 伺服器中心/主機代管服務 1301 網路 1501 入埠網際網路訊務 1502 入珲路由/入埠路由網路 1511 RAID陣列 1512 RAID陣列 1515 RAID陣列/延遲緩衝器 1521-1525 應用程式/遊戲伺服器 1529 未經壓縮之視訊/音訊 1530 共用視訊壓縮/共用集區/共用硬體壓縮/共 用硬體壓縮器/共用視訊壓縮硬體 1539 經壓縮視訊/音訊輸出 1540 出痒路由/出埠路由網路 1550 延遲緩衝器及/或分群視訊/反饋迴路 1551 路後 1552 路徑 1599 出痒網際網路訊務 136720.doc 2009412331120 User input command 1121 FEC code 1122 User input command 1123 FEC code 1200 Multicore and / or multiprocessor 1201-1208 Core 1205 4x2 configuration / uncompressed frame 1300 Server Center / Hosting Service 1301 Network 1501 Internet access service 1502 Incoming routing/incoming routing network 1511 RAID array 1512 RAID array 1515 RAID array/delay buffer 1521-1525 Application/game server 1529 Uncompressed video/audio 1530 Video Compression/Common Set/Common Hardware Compression/Common Hardware Compressor/Common Video Compression Hardware 1539 Compressed Video/Audio Output 1540 Itch Routing/Output Routing Network 1550 Delay Buffer and/or Group Video/ Feedback loop 1551 after the road 1552 Path 1599 Itching Internet traffic 136720.doc 200941233
1600 「縮略圖」視訊窗 1601 黃色選擇框 1602 遊戲資訊 1700 視訊窗 1800 箭頭 1801 上覆 1900 視訊及音訊 2000 使用者本身之視訊 2001 現場直播之視訊 2002 搭檔 2003 視訊片段/自賞剪輯/3DDVR自賞剪輯 2004 數字 2005 圖示 2400 線 2401 1.5 Mbps連接速度 2402 12 Mbps連接速度 2403 96 Mbps連接速度 HS1-HS6 主機代管服務伺服器中心 136720.doc 165-1600 "thumbnail" video window 1601 yellow selection box 1602 game information 1700 video window 1800 arrow 1801 over 1900 video and audio 2000 user's own video 2001 live video 2002 partner 2003 video clip / self-reward clip / 3DDVR self-reward Clip 2004 Digital 2005 Illustration 2400 Line 2401 1.5 Mbps Connection Speed 2402 12 Mbps Connection Speed 2403 96 Mbps Connection Speed HS1-HS6 Host Managed Service Server Center 136720.doc 165-
Claims (1)
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US99957607A | 2007-12-05 | 2007-12-05 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| TW200941233A true TW200941233A (en) | 2009-10-01 |
Family
ID=40718190
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW097147251A TW200941233A (en) | 2007-12-05 | 2008-12-04 | System and method for intelligently allocating client requests to server centers |
| TW098115435A TW200951728A (en) | 2007-12-05 | 2008-12-04 | Mothod for reporting recorded video preceding system failures |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| TW098115435A TW200951728A (en) | 2007-12-05 | 2008-12-04 | Mothod for reporting recorded video preceding system failures |
Country Status (9)
| Country | Link |
|---|---|
| EP (1) | EP2232380A4 (en) |
| JP (1) | JP2011514565A (en) |
| KR (1) | KR20100113502A (en) |
| CN (1) | CN101918933A (en) |
| AU (1) | AU2008333834A1 (en) |
| CA (1) | CA2707709A1 (en) |
| RU (1) | RU2010127309A (en) |
| TW (2) | TW200941233A (en) |
| WO (1) | WO2009073832A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI421677B (en) * | 2010-12-01 | 2014-01-01 | Inventec Corp | A transaction processing method for a cluster |
| TWI448129B (en) * | 2011-11-09 | 2014-08-01 | D Link Corp | According to the behavior of the network address translator to establish a transmission control protocol connection method |
| US10334019B2 (en) | 2016-03-04 | 2019-06-25 | Synology Incorporated | Method and associated server for ensuring data security under high access efficiency |
Families Citing this family (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8888592B1 (en) | 2009-06-01 | 2014-11-18 | Sony Computer Entertainment America Llc | Voice overlay |
| US8147339B1 (en) | 2007-12-15 | 2012-04-03 | Gaikai Inc. | Systems and methods of serving game video |
| US8968087B1 (en) | 2009-06-01 | 2015-03-03 | Sony Computer Entertainment America Llc | Video game overlay |
| US8613673B2 (en) | 2008-12-15 | 2013-12-24 | Sony Computer Entertainment America Llc | Intelligent game loading |
| US8926435B2 (en) | 2008-12-15 | 2015-01-06 | Sony Computer Entertainment America Llc | Dual-mode program execution |
| US9723319B1 (en) | 2009-06-01 | 2017-08-01 | Sony Interactive Entertainment America Llc | Differentiation for achieving buffered decoding and bufferless decoding |
| WO2011098905A1 (en) * | 2010-02-12 | 2011-08-18 | Comviva Technologies Limited | Method and system for online mobile gaming |
| US8771064B2 (en) | 2010-05-26 | 2014-07-08 | Aristocrat Technologies Australia Pty Limited | Gaming system and a method of gaming |
| US9626696B2 (en) * | 2010-06-17 | 2017-04-18 | Microsoft Technology Licensing, Llc | Techniques to verify location for location based services |
| US8676591B1 (en) | 2010-08-02 | 2014-03-18 | Sony Computer Entertainment America Llc | Audio deceleration |
| KR20130090898A (en) | 2010-09-13 | 2013-08-14 | 소니 컴퓨터 엔터테인먼트 아메리카 엘엘씨 | Dual mode program execution and loading |
| WO2012037165A2 (en) | 2010-09-13 | 2012-03-22 | Gaikai, Inc. | Add-on management |
| WO2012084058A1 (en) * | 2010-12-23 | 2012-06-28 | Telefonaktiebolaget L M Ericsson (Publ) | Media broker server, method, computer program and computer program product for matching a media source and a media receiver |
| WO2012103670A1 (en) * | 2011-01-31 | 2012-08-09 | 海信集团有限公司 | Method, device and system for, based on cloud service, providing and processing multimedia data |
| JP5331192B2 (en) * | 2011-11-07 | 2013-10-30 | 株式会社スクウェア・エニックス・ホールディングス | Drawing server, center server, encoding device, control method, encoding method, program, and recording medium |
| KR20140124018A (en) * | 2011-11-23 | 2014-10-23 | 지오노믹스 글로벌 게임즈 리미티드 | Systems and methods for providing and processing software objects in connection with a map-based game |
| US10913003B2 (en) | 2012-03-13 | 2021-02-09 | Sony Interactive Entertainment LLC | Mini-games accessed through a sharing interface |
| US11406906B2 (en) | 2012-03-13 | 2022-08-09 | Sony Interactive Entertainment LLC | Network connected controller for direct to cloud gaming |
| US9345966B2 (en) | 2012-03-13 | 2016-05-24 | Sony Interactive Entertainment America Llc | Sharing recorded gameplay to a social graph |
| CN113159948A (en) * | 2016-01-24 | 2021-07-23 | 杭州复杂美科技有限公司 | Block chain matching exchange |
| CN108415763B (en) * | 2018-02-11 | 2020-12-11 | 中南大学 | A kind of allocation method of edge computing system |
| US11736553B1 (en) | 2019-09-27 | 2023-08-22 | Amazon Technologies, Inc. | Selecting hosting servers for interactive electronic activities |
| CN113132743B (en) * | 2019-12-30 | 2022-11-04 | 浙江宇视科技有限公司 | Live broadcast storage and playing method and system |
| US12316493B2 (en) | 2020-05-22 | 2025-05-27 | Sony Group Corporation | Information processing apparatus, information processing method, program, and information processing system for determining a data center having an instance that executes an application |
| US11863616B1 (en) * | 2020-10-30 | 2024-01-02 | Amazon Technologies, Inc. | Selecting hosting servers for network services |
| US11134217B1 (en) | 2021-01-11 | 2021-09-28 | Surendra Goel | System that provides video conferencing with accent modification and multiple video overlaying |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| AU2343097A (en) * | 1996-03-21 | 1997-10-10 | Mpath Interactive, Inc. | Network match maker for selecting clients based on attributes of servers and communication links |
| US6755743B1 (en) * | 1999-12-08 | 2004-06-29 | Kabushiki Kaisha Sega Enterprises | Communication game system and processing method thereof |
| JP2001224865A (en) * | 1999-12-08 | 2001-08-21 | Sega Corp | Communication game system and communication game processing method |
| JP3969089B2 (en) * | 2001-12-25 | 2007-08-29 | 株式会社日立製作所 | Hierarchical server system |
| US7270605B2 (en) * | 2003-07-08 | 2007-09-18 | Gt | Peer-to-peer gaming system |
| US7607129B2 (en) * | 2005-04-07 | 2009-10-20 | International Business Machines Corporation | Method and apparatus for using virtual machine technology for managing parallel communicating applications |
| JP4101251B2 (en) * | 2005-05-24 | 2008-06-18 | 富士通株式会社 | Load distribution program, load distribution method, and load distribution apparatus |
| US20070265094A1 (en) * | 2006-05-10 | 2007-11-15 | Norio Tone | System and Method for Streaming Games and Services to Gaming Devices |
-
2008
- 2008-12-04 EP EP08858061A patent/EP2232380A4/en not_active Ceased
- 2008-12-04 CN CN200880119147.5A patent/CN101918933A/en active Pending
- 2008-12-04 TW TW097147251A patent/TW200941233A/en unknown
- 2008-12-04 JP JP2010537093A patent/JP2011514565A/en active Pending
- 2008-12-04 RU RU2010127309/08A patent/RU2010127309A/en unknown
- 2008-12-04 WO PCT/US2008/085609 patent/WO2009073832A1/en not_active Ceased
- 2008-12-04 CA CA2707709A patent/CA2707709A1/en not_active Abandoned
- 2008-12-04 TW TW098115435A patent/TW200951728A/en unknown
- 2008-12-04 KR KR1020107014737A patent/KR20100113502A/en not_active Withdrawn
- 2008-12-04 AU AU2008333834A patent/AU2008333834A1/en not_active Abandoned
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI421677B (en) * | 2010-12-01 | 2014-01-01 | Inventec Corp | A transaction processing method for a cluster |
| TWI448129B (en) * | 2011-11-09 | 2014-08-01 | D Link Corp | According to the behavior of the network address translator to establish a transmission control protocol connection method |
| US10334019B2 (en) | 2016-03-04 | 2019-06-25 | Synology Incorporated | Method and associated server for ensuring data security under high access efficiency |
Also Published As
| Publication number | Publication date |
|---|---|
| KR20100113502A (en) | 2010-10-21 |
| EP2232380A1 (en) | 2010-09-29 |
| CN101918933A (en) | 2010-12-15 |
| RU2010127309A (en) | 2012-01-10 |
| AU2008333834A1 (en) | 2009-06-11 |
| TW200951728A (en) | 2009-12-16 |
| CA2707709A1 (en) | 2009-06-11 |
| WO2009073832A1 (en) | 2009-06-11 |
| JP2011514565A (en) | 2011-05-06 |
| EP2232380A4 (en) | 2011-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI399982B (en) | System for compressing streaming interactive video | |
| TWI459215B (en) | System and method for storing program code and data within an application hosting center | |
| TWI536804B (en) | System and method for compressing video based on detected data rate of a communication channel | |
| TWI528832B (en) | System and method for video compression using feedback including data related to the successful receipt of video content | |
| TWI536805B (en) | System and method for encoding video using a selected tile and tile rotation pattern | |
| TWI558109B (en) | System and method for compressing video frames or portions thereof based on feedback information from a client device | |
| TWI536806B (en) | System and method for multi-stream video compression using multiple encoding formats | |
| TWI475843B (en) | System and method for multi-stream video compression | |
| TWI501589B (en) | System and method for utilizing forward error correction with video compression | |
| TWI530163B (en) | System and method for compressed video based on delay measurement and other feedback, and machine readable medium | |
| TWI554115B (en) | System and method for selecting a video encoding format based on feedback data | |
| TW200941233A (en) | System and method for intelligently allocating client requests to server centers | |
| RU2501180C2 (en) | Video compression system and method for compensating for bandwidth limitations of communication channel | |
| TW200939793A (en) | System and method for protecting certain types of multimedia data transmitted over a communication channel | |
| TW200942305A (en) | Apparatus for streaming databases serving real-time applications used through streaming interactive video | |
| TW201117868A (en) | System and method for accelerated machine switching | |
| TW200952495A (en) | Apparatus for combining aplurality of views of real-time streaming interactive video | |
| TW200935916A (en) | System and method for compressing video by adjusting tile size based on detected intraframe motion or scene complexity | |
| TW201041400A (en) | Temporary decoder apparatus and method | |
| TW200941232A (en) | Video compression system and method for reducing the effects of packet loss over a communication channel | |
| TW200939789A (en) | Method for user session transitioning among streaming interactive video servers | |
| BRPI1107030A2 (en) | System and method for remote hosted video effects | |
| HK1149810B (en) | System and method for compressing video by allocating bits to image tiles based on detected intraframe motion or scene complexity | |
| HK1149870A (en) | Video compression system and method for compensating for bandwidth limitations of a communication channel | |
| HK1149811B (en) | Video compression system and method for reducing the effects of packet loss over a communication channel |