WO2018001350A1 - 一种内容植入的方法、装置及系统 - Google Patents

一种内容植入的方法、装置及系统 Download PDF

Info

Publication number
WO2018001350A1
WO2018001350A1 PCT/CN2017/091028 CN2017091028W WO2018001350A1 WO 2018001350 A1 WO2018001350 A1 WO 2018001350A1 CN 2017091028 W CN2017091028 W CN 2017091028W WO 2018001350 A1 WO2018001350 A1 WO 2018001350A1
Authority
WO
WIPO (PCT)
Prior art keywords
message
html
compressed
current
data block
Prior art date
Application number
PCT/CN2017/091028
Other languages
English (en)
French (fr)
Inventor
杨金舟
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018001350A1 publication Critical patent/WO2018001350A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor

Definitions

  • the present application relates to the field of Internet technologies, for example, to a method, apparatus, and system for content embedding.
  • the web content embedding system has been developed in recent years, and is a value-added service system for adding additional content to various terminals including mobile phones, PCs, and PADs.
  • HTTP Hypertext transfer protocol
  • various contents such as marketing content, service content, announcement notice, etc., are automatically popped up, and the content is closely attached to the user. The interference to the user is small and the user is easy to receive.
  • the related web content embedding system can only add additional content for the hypertext markup language HTML uncompressed message.
  • HTML uncompressed message For the webpage compressed by GZIP format, it is often impossible to embed, or the compressed HTML message needs to be decompressed first. The page is recompressed after implantation, resulting in low performance, extended processing, and high construction costs.
  • the present disclosure provides a method, device, and system for content embedding, which solves the problem that the webpage content embedding system cannot directly implement content embedding for an HTML message in a GZIP compressed format.
  • an embodiment of the present disclosure provides a method for content embedding, including:
  • the JS script link message is embedded in the end of the hypertext markup language HTML compressed message.
  • the step of embedding the JS script link message in the tail of the Hypertext Markup Language HTML compressed message includes:
  • the step of searching for the HTML compressed message tail according to the compressed data format, and inserting the JS script link message into the tail of the HTML compressed message includes:
  • the current end data block is constructed according to the JS script link message.
  • it also includes:
  • the step of updating the tail information of the current HTML compressed message includes:
  • the present disclosure also provides an apparatus for content implantation, including:
  • a conversion module configured to convert the content page to be implanted into a client scripting language JS script link message
  • An implant module configured to embed a JS script link message at the end of a hypertext markup language HTML compressed message.
  • the implant module includes:
  • the first processing submodule is configured to search for the HTML compressed message tail according to the compressed data format, and insert the JS script link message into the tail of the HTML compressed message.
  • the first processing submodule includes:
  • a searching unit configured to search for an end data block in the HTML compressed message according to the compressed data format
  • a marking unit configured to mark the original ending data block as a non-ending data block after finding the ending data block
  • a construction unit configured to construct a current end data block based on the JS script link message.
  • it also includes:
  • the update module is configured to update the tail information of the current HTML compressed message.
  • the update module includes:
  • a second processing submodule configured to obtain a current check code according to a check code of the original HTML compressed message and a content of the embedded JS script link message
  • a third processing submodule configured to obtain a current uncompressed length according to an uncompressed length of the original HTML compressed message and a length of the embedded JS script link message;
  • the update submodule is configured to update the tail information of the current HTML compressed message according to the current check code and the current uncompressed length.
  • the present disclosure also provides a content implantation system comprising: the apparatus for content implantation described above.
  • Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions arranged to perform the above method.
  • An embodiment of the present disclosure further provides an electronic device, including:
  • At least one processor At least one processor
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one processor to perform the method described above.
  • the content embedding method can be implemented outside the HTML page message frame by using the JS script, and the GZIP supports the characteristics of multiple independent compressed/uncompressed data blocks, and the content page to be implanted is converted into a client.
  • the end scripting language JS script links the message, and directly inserts the JS script link message into the end of the hypertext markup language HTML compressed message;
  • FIG. 1 is a schematic flowchart 1 of a method for content embedding according to Embodiment 1 of the present disclosure
  • FIG. 2 is a second schematic flowchart of a method for content embedding according to Embodiment 1 of the present disclosure
  • FIG. 3 is a schematic diagram of a system interaction process according to Embodiment 1 of the present disclosure.
  • FIG. 4 is a schematic flowchart of a method for content embedding according to Embodiment 1 of the present disclosure
  • FIG. 5 is a schematic flowchart of a process for processing an uncompressed storage data block offset of a GZIP packet according to Embodiment 1 of the present disclosure
  • FIG. 6 is a schematic flowchart of a GZIP packet fixed coding compressed data block offset processing according to Embodiment 1 of the present disclosure
  • FIG. 7 is a schematic flowchart of a GZIP packet dynamic coding compressed data block offset processing according to Embodiment 1 of the present disclosure
  • FIG. 8 is a schematic structural diagram of an apparatus for content embedding according to Embodiment 2 of the present disclosure.
  • FIG. 9 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
  • the present disclosure provides a plurality of solutions for the problem that the web content embedding system in the related art cannot directly implement the content embedding of the HTML message in the GZIP compression format, as follows:
  • the method for content placement provided by Embodiment 1 of the present disclosure includes:
  • Step 11 Convert the content page to be implanted into a client scripting language JS script link message
  • Step 12 Embed the JS script link message into the end of the hypertext markup language HTML compressed message.
  • the content embedding method provided by the first embodiment of the present disclosure can be effective outside the HTML page message frame by using the JS script, and the GZIP supports the characteristics of multiple independent compressed/uncompressed data blocks.
  • the content page to be implanted is converted into a client-side scripting language JS script link message, and the JS script link message is directly implanted in the end of the hypertext markup language HTML compressed message; there is no need to decompress/recompress the GZIP message. Save a lot of system computing resources, which is beneficial to greatly reduce the cost of implanting the system. It does not need to identify and parse the HTML page frame. It can realize packet-by-packet processing and forwarding of messages, avoiding the need to receive and cache all messages before they can be implanted.
  • Processing can greatly reduce the processing delay; the normative requirement for the HTML code of the page to be implanted is low, which is beneficial to improving the implantation rate of the additional content of the webpage; without changing the original HTML element structure of the HTML, the original webpage is displayed.
  • the impact is small; better solved the problem that the webpage content embedding system in the related art cannot directly implement the content embedding of the HTML message in the GZIP compressed format.
  • the step of embedding the JS script link message in the tail of the hypertext markup language HTML compression message comprises: searching for the tail of the HTML compressed message according to the compressed data format, and embedding the JS script link message in the tail of the HTML compressed message. .
  • the step of searching for the HTML compressed message tail according to the compressed data format and embedding the JS script link message in the tail of the HTML compressed message includes: searching for the end data block in the HTML compressed message according to the compressed data format; and finding the end data After the block, the original end data block is marked as a non-end data block; the current end data block is constructed according to the JS script link message.
  • the method may further include: updating tail information of the current HTML compressed message.
  • the step of updating the tail information of the current HTML compressed message may include: obtaining a current check code according to the check code of the original HTML compressed message and the content of the embedded JS script link message; and compressing the message according to the original HTML The uncompressed length and the length of the embedded JS script link message obtain the current uncompressed length; and the tail information of the current HTML compressed message is updated according to the current check code and the current uncompressed length.
  • Embodiment 1 of the present disclosure The method of content implantation provided by Embodiment 1 of the present disclosure will be described below.
  • the related webpage content embedding system cannot implement the content embedding or the content embedding of the HTML message in the GZIP compression format, but the processing performance is low, the user is prolonged when surfing the Internet, and the construction cost is high.
  • a method for efficiently embedding HTML messages in GZIP format cannot implement the content embedding or the content embedding of the HTML message in the GZIP compression format, but the processing performance is low, the user is prolonged when surfing the Internet, and the construction cost is high.
  • the present disclosure may relate to the following two points when performing content implantation:
  • the first point, using JS (client scripting language, javascript) script can report in HTML page
  • the externally valid feature of the text frame converts the additional content page that needs to be implanted into a JS script link and directly appends it to the end of the HTML page message, avoiding the need to parse and identify the HTML message frame when the content is embedded, in the middle of the HTML message. Insert additional content page link message;
  • the second point is to use GZIP to support the characteristics of multiple independent compressed/uncompressed data blocks.
  • the JS text to be implanted is directly added to the end of the GZIP packet in the form of uncompressed data blocks, so as to avoid the need to decompress the GZIP compressed packets. And some problems caused by recompression;
  • Step 21 Judging the elapsed Internet traffic, if it is an HTML page message in the GZIP format that needs to be content-implanted, proceed to step 22; if it is not an HTML page message in the GZIP format that needs to be content-embedded, Respond to the Internet;
  • Step 22 Find a compressed data block tail according to the GZIP compressed data format.
  • Step 23 Add an independent uncompressed data block at the end of the message according to the GZIP compression format, and the content of the data block is a JS message to be implanted;
  • Step 24 Calculate a new compressed message check code according to the check code of the original compressed message and the content of the additional message;
  • Step 25 Change the length of the HTML message to the length of the new message after the addition, and the processing ends.
  • the disclosure is applicable to a content embedding system deployed between an Internet terminal and the Internet, and processes the Internet message to implement efficient implantation processing of the content page.
  • the interaction process of the disclosed system includes:
  • Step 31 The online terminal initiates an online request, and forwards the request message to the additional content insertion system through the intermediate network.
  • Step 32 The content implantation system forwards the online request to the Internet side through the intermediate network;
  • Step 33 The Internet side response message (online response) returns to the additional content insertion system via the intermediate network;
  • Step 34 The additional content embedding system determines whether it is an HTML message in a GZIP compression format that requires content embedding. If it is not an HTML message in a GZIP compression format that requires content embedding, proceed to step 35, if content embedding is required. The HTML message in the GZIP compressed format proceeds to step 36;
  • Step 35 The additional content embedding system forwards the online response to the online terminal through the intermediate network
  • Step 36 GZIP message additional content implantation processing (using the method of the present disclosure to implement content implantation processing);
  • Step 37 The additional content embedding system sends the response message (online response) after the content is implanted to the internet terminal through the intermediate network through the intermediate network.
  • the Internet terminal parses the HTML page and the JS script appended to the tail, and superimposes the embedded content based on the JS script execution control.
  • step 36 is as shown in FIG. 4, including:
  • Step 41 Start, the GZIP message that needs to be implanted in the message is transferred;
  • Step 42 Check the validity of the GZIP packet header. If it is not legal, proceed to step 43. If it is legal, proceed to step 44.
  • the GZIP header information is checked according to the GZIP compression format definition. If the header information is not checked, the process proceeds to step 43 (direct exit processing); if the header information is checked, the GZIP header field is offset at the same time as the check.
  • Step 43 The abnormal packet is not processed
  • Step 44 The loop starts, and the data block end block flag is read
  • Step 45 Read the data block compression type flag and enter the corresponding processing branch, and proceed to step 46, step 47, step 48 or step 49;
  • the data block information is cyclically read, and is determined according to the compression type identification field of the data block, and respectively enters the corresponding type of offset processing, including non-compressed storage data blocks, fixed-coded compressed data blocks, dynamically encoded compressed data blocks, and the like. Types.
  • Step 46 processing a non-compressed storage block
  • Step 47 The process of fixed coding compressed data block processing
  • Step 48 Dynamically compress the compressed data block processing flow
  • Step 49 The packet that identifies the abnormal packet is forwarded directly without processing
  • Step 410 If it is a non-end data block, continue to offset the search until the end of the data block; return to step 44;
  • the cyclic read offsets each data block until the end of the data block is marked as a GZIP end data block.
  • Step 411 Read the tail information of the GZIP packet.
  • GZIP message tail information which may include the check code and the message uncompressed length information.
  • Step 412 Modify the original end block to be marked as a non-end block flag
  • Step 413 Construct the implanted message as a new data storage tail block
  • Step 414 Update the GZIP packet tail information.
  • the new check code and the uncompressed message length are recalculated according to the original message check code, the uncompressed length of the message, and the additional message information, and a new GZIP message tail is constructed.
  • Step 415 Forward the processed packet.
  • Step 416 The process ends.
  • step 46 uncompressed storage block offset processing logic
  • Step 51 Start;
  • Step 52 Read 2 bytes of data length len
  • Step 53 Read 2 bytes of length complement nlen
  • Nlen XOR or 0xffff is the complement of nlen, which is equal to len, indicating that the data format is legal.
  • step 56 Check the validity of the length and length complement, if it does not enter the step 55; if it is legal, go to step 56.
  • Step 55 The length verification fails, and an error is returned
  • Step 56 The message is offset by len bytes.
  • the message offset processing is performed according to the data block length value.
  • Step 57 The storage block Stored offset processing ends, and returns ok.
  • the data block offset processing ends;
  • step 47 fixed code compressed block offset processing logic
  • Step 61 start;
  • Step 62 Perform code table matching on the packet according to the preset fixed character length LIT encoding table.
  • the code matching is performed according to the preset fixed code table, and the corresponding process is processed for the difference of the code values.
  • Step 64 block end tag, return ok
  • the matched code value is equal to 256, it indicates that the data block offset ends, and the subsequent processing is continued.
  • Step 65 determine whether Code ⁇ 256, if yes, go to step 66; if not meet Code ⁇ 256, go to step 67;
  • Step 66 original character encoding, offset code length bit
  • the matching code value is less than 256, it means that it is the original character code, and the corresponding code length bit is directly offset.
  • Step 67 Length bit coding, after offsetting the code length bit, continue to match according to the preset fixed distance DIST code table.
  • Step 68 After the matching, the Dist-Code length bit is directly offset without decoding the character
  • the matched code is greater than 256, it indicates that it is a length coded bit, first offsets the corresponding code length bit, and then performs code matching according to the preset fixed distance code table, and directly offsets according to the length value corresponding to the code after matching.
  • the length bit does not require decoding of the offset message.
  • Step 69 Determine whether the message is scanned or not, if yes, proceed to step 610, if the scan is not finished, return to step 62;
  • step 62 the loop continues from step 62, and the data is matched and offset processed until the message with the encoded value of 256 (end tag) is exited.
  • Step 610 Abnormal termination, returning error.
  • step 48 dynamic coding compressed block offset processing logic
  • Step 71 start;
  • Step 72 Read dynamic code table data from the data block header to construct a dynamic code table
  • HCLEN+4 Read (HCLEN+4) ⁇ 3 bits and construct a code length sequence CCL code table, decode the shortened integer sequence SQ1 according to the CCL code table and the HLIT value, and construct a dynamic LIT code table; according to the CCL code table and the HDIST value, the decoding is shortened
  • the integer sequence SQ2 constructs a dynamic DIST code table.
  • Step 73 Perform code table matching on the message according to the dynamic LIT coding table.
  • the message is matched according to the dynamic code table constructed in step 72, and the corresponding step processing is performed according to the matched code value.
  • Step 75 block end tag, return ok
  • the code value of the matching code is equal to 256, it means that the data block ends, and the loop processing is exited.
  • Step 76 Determine whether Code ⁇ 256, and if so, proceed to step 77, if the code ⁇ 256 is not satisfied, proceed to step 78;
  • Step 77 Original character encoding, offset Code length bit
  • the code value of the matching code is less than 256, it means that it is the original character code, directly offsets the corresponding code length bit and continues the loop processing.
  • Step 78 Length bit coding, after offsetting the code length bit, continuing to match according to the dynamic DIST code table.
  • Step 79 After the matching, the Dist-Code length bit is directly offset without decoding the character
  • the code value of the matching code is greater than 256, it indicates that it is a length coded bit, first offsets the corresponding code length bit, and then performs packet matching according to the constructed dynamic length bit code table and the dynamic distance code table, and only matches after matching.
  • the corresponding length bit is offset according to the length value corresponding to the encoding, and the data content does not need to be decoded.
  • Step 710 Determine whether the message is scanned or not, if yes, proceed to step 711, if the scan is not finished, return to step 73;
  • Step 711 Abnormal termination, returning error.
  • this scheme adopts the tail-added JS script mode to implement additional content implantation, which has the following advantages compared with the traditional method:
  • the apparatus for content placement provided by Embodiment 2 of the present disclosure includes:
  • the conversion module 81 is configured to convert the content page to be implanted into a client scripting language JS script link message
  • the implant module 82 is configured to embed the JS script link message in the end of the hypertext markup language HTML compressed message.
  • the content-embedded device provided by the second embodiment of the present disclosure can be effective outside the HTML page message frame by using the JS script, and the GZIP supports the characteristics of multiple independent compressed/uncompressed data blocks, and the content page to be implanted is Convert to a client-side scripting language JS script link message, and directly insert the JS script link message into the end of the hypertext markup language HTML compression message; without decompressing/recompressing the GZIP message, it can save a lot of system computing resources.
  • the implanted system It is beneficial to greatly reduce the construction cost of the implanted system; it does not need to identify and parse the HTML page frame, and can realize the packet-by-packet processing and forwarding of the message, avoiding the need to receive and cache all the messages before being implanted, which can greatly reduce the processing time.
  • Delay the normative requirement for the HTML code of the page to be implanted is low, which is beneficial to improve the implantation rate of the additional content of the webpage; does not change the original page element structure of the HTML, has little influence on the original webpage display; better solution
  • the webpage content embedding system cannot directly implement the content embedding of the HTML message in the GZIP compressed format.
  • the implant module includes: a first processing submodule configured to search for an HTML compressed message tail according to the compressed data format, and insert the JS script link message into the tail of the HTML compressed message.
  • the first processing submodule includes: a searching unit configured to search for an end data block in the HTML compressed message according to the compressed data format; and a marking unit configured to mark the original ending data block as after the end data block is found A non-end data block; a construction unit configured to construct a current end data block according to a JS script link message.
  • the apparatus may further include: an update module configured to update tail information of the current HTML compressed message.
  • the update module may include: a second processing submodule configured to obtain a current check code according to a check code of the original HTML compressed message and a content of the embedded JS script link message; the third processing submodule is configured Configuring to obtain a current uncompressed length according to the uncompressed length of the original HTML compressed message and the length of the embedded JS script link message; the update submodule configured to be based on the current check code and the current uncompressed length Update the tail information of the current HTML compressed message.
  • an embodiment of the present disclosure further provides a content embedding system, including: the device for content embedding described above.
  • modules/sub-modules may be implemented in software for execution by various types of processors.
  • an identified executable code module can comprise one or more physical or logical blocks of computer instructions, which can be constructed, for example, as an object, procedure, or function. Nonetheless, the executable code of the identified modules need not be physically located together, but may include different instructions stored in different bits that, when logically combined, constitute a module and implement the functionality of the module. .
  • Embodiments of the present disclosure also provide a computer readable storage medium storing computer executable instructions arranged to perform the method of any of the above embodiments.
  • the computer readable storage medium may be a transitory computer readable storage medium or may be non-transitory State computer readable storage medium.
  • the embodiment of the present disclosure further provides a schematic structural diagram of an electronic device.
  • the electronic device includes:
  • At least one processor 90 which is exemplified by a processor 90 in FIG. 9; and a memory 91, may further include a communication interface 92 and a bus 93.
  • the processor 90, the communication interface 92, and the memory 91 can complete communication with each other through the bus 93.
  • Communication interface 92 can be used for information transfer.
  • Processor 90 can invoke logic instructions in memory 91 to perform the methods of the above-described embodiments.
  • logic instructions in the memory 91 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the memory 91 is a computer readable storage medium and can be used to store a software program, a computer executable program, a program instruction/module corresponding to the method in the embodiment of the present disclosure.
  • the processor 90 executes the function application and the data processing by executing software programs, instructions, and modules stored in the memory 91, that is, implementing the content embedding method in the above method embodiments.
  • the memory 91 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to usage of the terminal device, and the like. Further, the memory 91 may include a high speed random access memory, and may also include a nonvolatile memory.
  • the technical solution of the embodiments of the present disclosure may be embodied in the form of a software product stored in a storage medium, including one or more instructions for causing a computer device (which may be a personal computer, a server, or a network) The device or the like) performs all or part of the steps of the method described in the embodiments of the present disclosure.
  • the foregoing storage medium may be a non-transitory storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like. a medium that can store program code, or it can be temporary State storage medium.
  • the executable code module can be a single instruction or a plurality of instructions, and can even be distributed across multiple different code segments, distributed among different programs, and distributed across multiple memory devices.
  • operational data may be identified within the modules and may be implemented in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed at different locations (including on different storage devices), and may at least partially exist as an electronic signal on a system or network.
  • the module can be implemented by software, considering the level of the related hardware process, the module can be implemented in software, and the technician can construct the corresponding hardware circuit to realize the corresponding function without considering the cost.
  • the hardware circuits include conventional Very Large Scale Integration (VLSI) circuits or gate arrays and related semiconductors such as logic chips, transistors, or other discrete components.
  • VLSI Very Large Scale Integration
  • the modules can also be implemented with programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, and the like.
  • the method, device and system for content embedding provided by the present application do not need to decompress/recompress GZIP messages, which can save a large amount of system computing resources, and is beneficial to greatly reduce the construction cost of the implanted system; no need to identify and parse HTML pages.
  • the framework can realize the packet-by-packet processing and forwarding of the message, avoiding the need to receive and cache all the messages before the implantation process can be performed, which can greatly reduce the processing delay; the normative requirement for the HTML code of the page to be implanted is low.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

本申请提供了一种内容植入的方法、装置及系统，其中，内容植入的方法包括：将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。

Description

一种内容植入的方法、装置及系统 技术领域
本申请涉及互联网技术领域，例如涉及一种内容植入的方法、装置及系统。
背景技术
随着互联网业务和技术的蓬勃发展，电信运营商逐渐沦为单纯的传输管道，如何将哑管道变为智能管道，并充分利用运营商把控的互联网入口能力，开展互联网业务，与传统互联网企业共享OTT(Over The Top，通过互联网向用户提供各种应用服务)市场，运营商已经做了很多这方面的探索。网页内容植入系统是近几年发展起来的，针对包含手机、PC、和PAD等各类终端进行附加内容植入的增值业务系统。用户通过终端进行超文本传输协议HTTP访问的过程中，在终端上进行正常网页访问的同时，植入各种内容，如营销内容、服务内容、公告通知等等，自动弹出，内容紧贴用户，对用户的干扰小，用户易于接收。
相关的网页内容植入系统均只能针对超文本标记语言HTML非压缩报文进行附加内容植入，对于GZIP格式压缩的网页，往往无法植入，或者是需要先对压缩的HTML报文解压，页面植入后进行再次压缩，导致设备性能低、处理时延长、建设成本高。
发明内容
本公开提供一种内容植入的方法、装置及系统，解决相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题。
为了解决上述技术问题，本公开实施例提供一种内容植入的方法，包括：
将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
可选的，所述将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部的步骤包括：
根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入 HTML压缩报文尾部。
可选的，所述根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部的步骤包括：
根据压缩数据格式查找HTML压缩报文中的结束数据块；
在找到结束数据块后，将原结束数据块标记为非结束数据块；
根据JS脚本链接报文构造当前结束数据块。
可选的，还包括：
更新当前HTML压缩报文的尾部信息。
可选的，所述更新当前HTML压缩报文的尾部信息的步骤包括：
根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；
根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；
根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
本公开还提供了一种内容植入的装置，包括：
转换模块，被配置为将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
植入模块，被配置为将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
可选的，所述植入模块包括：
第一处理子模块，被配置为根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部。
可选的，所述第一处理子模块包括：
查找单元，被配置为根据压缩数据格式查找HTML压缩报文中的结束数据块；
标记单元，被配置为在找到结束数据块后，将原结束数据块标记为非结束数据块；
构造单元，被配置为根据JS脚本链接报文构造当前结束数据块。
可选的，还包括：
更新模块，被配置为更新当前HTML压缩报文的尾部信息。
可选的，所述更新模块包括：
第二处理子模块，被配置为根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；
第三处理子模块，被配置为根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；
更新子模块，被配置为根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
本公开还提供了一种内容植入系统，包括：上述的内容植入的装置。
本公开实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述方法。
本公开实施例还提供了一种电子设备，包括：
至少一个处理器；以及
与所述至少一个处理器通信连接的存储器；其中，
所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器执行上述的方法。
本公开的上述技术方案的有益效果如下：
上述方案中，所述内容植入的方法通过利用JS脚本能够在HTML页面报文框架外部生效，以及GZIP支持多个独立压缩/非压缩数据块的特性，将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文，将JS脚本链接报文直接植入超文本标记语言HTML压缩报文尾部；
无需对GZIP报文进行解压/重压缩，可节省大量的系统计算资源，有利于大幅降低植入系统建设成本；不需要识别和解析HTML页面框架，可实现报文的逐包处理转发，避免要收全和缓存全部报文才可进行植入处理，可大幅减少处理时延；对要植入的页面HTML代码的规范性要求较低，有利于提升网页附加内容的植入率；不改变HTML原有页面元素结构，对原有网页展示的影响小； 较好的解决了相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题。
附图概述
图1为本公开实施例一的内容植入的方法流程示意图一；
图2为本公开实施例一的内容植入的方法流程示意图二；
图3为本公开实施例一的系统交互流程示意图；
图4为本公开实施例一的内容植入的方法流程示意图；
图5为本公开实施例一的GZIP报文非压缩存储数据块偏移处理流程示意图；
图6为本公开实施例一的GZIP报文固定编码压缩数据块偏移处理流程示意图；
图7为本公开实施例一的GZIP报文动态编码压缩数据块偏移处理流程示意图；
图8为本公开实施例二的内容植入的装置结构示意图；以及
图9为本公开实施例的电子设备的结构示意图。
具体实施方式
为使本公开要解决的技术问题、技术方案和优点更加清楚，下面将结合附图及实施例进行详细描述。
本公开针对相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题，提供了多种解决方案，如下：
实施例一
如图1所示，本公开实施例一提供的内容植入的方法包括：
步骤11：将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
步骤12：将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
可压缩后植入，也可不压缩植入，在此不作限定。
本公开实施例一提供的所述内容植入的方法通过利用JS脚本能够在HTML页面报文框架外部生效，以及GZIP支持多个独立压缩/非压缩数据块的特性， 将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文，将JS脚本链接报文直接植入超文本标记语言HTML压缩报文尾部；无需对GZIP报文进行解压/重压缩，可节省大量的系统计算资源，有利于大幅降低植入系统建设成本；不需要识别和解析HTML页面框架，可实现报文的逐包处理转发，避免要收全和缓存全部报文才可进行植入处理，可大幅减少处理时延；对要植入的页面HTML代码的规范性要求较低，有利于提升网页附加内容的植入率；不改变HTML原有页面元素结构，对原有网页展示的影响小；较好的解决了相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题。
其中，所述将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部的步骤包括：根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部。
所述根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部的步骤包括：根据压缩数据格式查找HTML压缩报文中的结束数据块；在找到结束数据块后，将原结束数据块标记为非结束数据块；根据JS脚本链接报文构造当前结束数据块。
为了保证正常的解析使用，所述方法还可以包括：更新当前HTML压缩报文的尾部信息。
所述更新当前HTML压缩报文的尾部信息的步骤可以包括：根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
下面对本公开实施例一提供的内容植入的方法进行说明。
本方案概括来说，针对相关网页内容植入系统无法对GZIP压缩格式的HTML报文实现内容植入或者能够进行内容植入但是处理性能低、导致用户上网时延长、建设成本高等问题，提出一种正对GZIP格式的HTML报文进行高效植入的方法。
在进行内容植入的时候，本公开可以涉及以下两点：
第一点，利用JS(客户端脚本语言，javascript)脚本能够在HTML页面报 文框架外部生效的特性，将需要植入的附加内容页面转换为JS脚本链接直接追加到HTML页面报文尾部，避免了在内容植入时需要解析和识别HTML报文框架，在HTML报文中间插入附加内容页面链接报文；
第二点，利用GZIP支持多个独立压缩/非压缩数据块的特性，对于需要植入的JS文本直接以非压缩数据块的方式追加到GZIP报文尾部，避免需要对GZIP压缩报文解压缩和再压缩而导致的一些问题；
如图2所示，可以包括如下步骤：
步骤21：对于经过的上网流量进行判断，如果是需要进行内容植入的GZIP格式的HTML页面报文，则进入步骤22；如果不是需要进行内容植入的GZIP格式的HTML页面报文，则直接进行上网响应；
步骤22：根据GZIP压缩数据格式查找压缩数据块尾；
步骤23：按照GZIP压缩格式在报文尾再添加一个独立的非压缩数据块，数据块内容为要植入的JS报文；
步骤24：根据原始压缩报文的校验码和追加报文内容计算新的压缩报文校验码；
步骤25：更改HTML报文长度为追加后新的报文长度，处理结束。
对本公开实施例一提供的内容植入方法进行整体详细的说明。
本公开适用于部署在上网终端和互联网之间的内容植入系统，对上网报文进行处理，实现内容页面的高效植入处理；如图3所示，本公开系统交互流程包括：
步骤31：上网终端发起上网请求，通过中间网络将请求报文转发给附加内容植入系统；
步骤32：内容植入系统通过中间网络将上网请求转发互联网侧；
步骤33：互联网侧的响应报文(上网响应)经过中间网络回到附加内容植入系统；
步骤34：附加内容植入系统判断是否为需要内容植入的GZIP压缩格式的HTML报文，若不是需要内容植入的GZIP压缩格式的HTML报文，则进入步骤35，若是需要内容植入的GZIP压缩格式的HTML报文，则进入步骤36；
步骤35：附加内容植入系统通过中间网络将上网响应转发给上网终端；
步骤36：GZIP报文附加内容植入处理(应用本公开的方法实现内容植入处理)；
步骤37：附加内容植入系统通过中间网络将内容植入后的响应报文(上网响应)通过中间网络发送给上网终端。
上网终端解析HTML页面和尾部追加的JS脚本，通过JS脚本执行控制原网页基础上叠加显示植入内容。
其中，步骤36的实现如图4所示，包括：
步骤41：开始，需要报文植入的GZIP报文转入；
步骤42：GZIP报文头合法性检查，若不合法，则进入步骤43，若合法，则进入步骤44；
也就是按照GZIP压缩格式定义进行GZIP头信息检查，如果头信息检查不通过进入步骤43(直接退出处理)；如果头信息检查通过，则在检查的同时，对GZIP头字段进行偏移。
步骤43：异常报文包不处理；
步骤44：循环开始，读取数据块结束块标记；
步骤45：读取数据块压缩类型标记并进入相应处理分支，进入步骤46、步骤47、步骤48或步骤49；
也就是，循环读取数据块信息，根据数据块的压缩类型标识字段判断，分别进入相应类型的偏移处理过程，包括非压缩存储数据块、固定编码压缩数据块、动态编码压缩数据块等几种类型。
步骤46：非压缩存储数据块处理流程；
步骤47：固定编码压缩数据块处理流程；
步骤48：动态编码压缩数据块处理流程；
步骤49：识别异常的报文包直接转发不处理；
步骤410：如果是非结束数据块，则继续偏移查找直到结束数据块；返回步骤44；
也就是，循环读取偏移各个数据块，直到该数据块结束标记为GZIP结束数据块为止。
步骤411：读取GZIP报文尾部信息；
读取和临时保存GZIP报文尾信息，可以包括校验码和报文非压缩长度信息。
步骤412：修改原结束块标记为非结束块标记；
将原结尾数据块的结束标记修改为非结束标记。
步骤413：将植入报文构造为新的数据存储尾块；
根据要植入的JS脚本构造一个新的GZIP非压缩存储数据块并将数据块报文追加到原结束数据块的尾部。
步骤414：更新GZIP报文尾信息；
根据原报文校验码、报文非压缩长度和追加报文信息重新计算新的校验码和非压缩报文长度，并构造新的GZIP报文尾。
步骤415：转发处理后的报文；
步骤416：处理结束。
其中，步骤46的实现(非压缩存储数据块偏移处理逻辑)如图5所示，包括：
步骤51：开始；
步骤52：读取2字节数据长度len；
读取和偏移2字节的数据块长度信息；
步骤53：读取2字节长度补码nlen；
读取和偏移2字节的数据块长度补码信息；
步骤54：判断是否len＝＝nlen|0xffff(1en是否等于nlen的补码)，若不满足len＝＝nlen|0xffff，则进入步骤55，若len＝＝nlen|0xffff，则进入步骤56；
nlen异或0xffff就是nlen的补码，等于len表示数据格式合法。
检查长度和长度补码的合法性，如果不合法进入步骤55；如果合法，则进入步骤56。
步骤55：长度校验失败，返回错误(error)；
退出处理。
步骤56：报文偏移len字节。
根据数据块长度值进行报文偏移处理。
步骤57：存储块Stored偏移处理结束，返回ok。
本数据块偏移处理结束；
其中，步骤47的实现(固定编码压缩数据块偏移处理逻辑)如图6所示，包括：
步骤61：开始；
步骤62：根据预置固定字符长度LIT编码表对报文进行码表匹配；
根据预置固定码表进行编码匹配，并针对编码值的不同进行相应流程处理。
步骤63：判断是否编码Code＝＝256，若是，则进入步骤64，若不满足编码Code＝＝256，则进入步骤65；
步骤64：块结束标记，返回ok；
也就是，如果匹配的码值等于256，表示本数据块偏移结束，继续后续处理。
步骤65：判断是否Code＜256，若是，进入步骤66；若不满足Code＜256，进入步骤67；
步骤66：原始字符编码，偏移Code长度位；
如果匹配的码值小于256，则表示是原始字符编码，则直接偏移相应的编码长度位。
步骤67：长度位编码，偏移Code长度位后，继续根据预置固定距离DIST编码表匹配。
步骤68：匹配后，无需解码字符直接偏移Dist-Code长度位；
也就是，如果匹配的编码大于256，则表示是长度编码位，首先偏移对应的编码长度位，然后按照预置固定距离码表进行编码匹配，匹配后根据编码对应的长度值直接偏移相应的长度位，不需要对偏移的报文进行解码处理。
步骤69：判断报文是否扫描结束，若是，进入步骤610，若未扫描结束，返回步骤62；
也就是，若报文没有扫描结束，则继续从步骤62开始循环，进行数据的编码匹配和偏移处理，直到遇到编码值为256的报文(结束标记)退出循环。
步骤610：非正常结束，返回error。
其中，步骤48的实现(动态编码压缩数据块偏移处理逻辑)如图7所示，包括：
步骤71：开始；
步骤72：从数据块头部读取动态码表数据构造动态码表；
读取5位HLIT值(字符长度编码表中码长序列个数)，读取5位HDIST值(距离编码表中码长序列个数)，读取4位HCLEN值(霍夫曼Huffman编码表3中码长序列个数)；
读取(HCLEN+4)×3位并构造码长序列CCL码表，根据CCL码表和HLIT值，解码缩短的整数序列SQ1并构造动态LIT码表；根据CCL码表和HDIST值，解码缩短的整数序列SQ2构造动态DIST码表。
步骤73：根据动态LIT编码表对报文进行码表匹配。
根据步骤72构造的动态码表进行报文的匹配，并根据匹配的码值进行相应步骤处理.
步骤74：判断是否Code＝＝256，若是，进入步骤75，若不满足Code＝＝256，进入步骤76；
步骤75：块结束标记，返回ok；
也就是，如果匹配编码的码值等于256，表示本数据块结束，退出本循环处理。
步骤76：判断是否Code＜256，若是，进入步骤77，若不满足Code＜256，进入步骤78；
步骤77：原始字符编码，偏移Code长度位；
也就是，如果匹配编码的码值小于256，则表示是原始字符编码，直接偏移相应的编码长度位并继续循环处理。
步骤78：长度位编码，偏移Code长度位后，继续根据动态DIST编码表匹配。
步骤79：匹配后，无需解码字符直接偏移Dist-Code长度位；
也就是，如果匹配编码的码值大于256，则表示是长度编码位，首先偏移相应的编码长度位，然后按照构造的动态长度位码表和动态距离码表进行报文匹配，匹配后只根据编码对应的长度值偏移相应的长度位即可，不需要对数据内容进行解码处理。
步骤710：判断报文是否扫描结束，若是，进入步骤711，若未扫描结束，返回步骤73；
也就是，若报文没有扫描结束，继续从步骤73开始循环，进行报文编码匹 配偏移处理，直到遇到码值为256的报文(结束标记)退出循环。
步骤711：非正常结束，返回error。
由上可知，本方案采用尾部追加JS脚本模式实现附加内容植入，相比传统方式存在以下优势：
1、无需对GZIP报文进行解压/重压缩，可节省大量的系统计算资源，有利于大幅降低植入系统建设成本；
2、不需要识别和解析HTML页面框架，可实现报文的逐包处理转发，避免要收全和缓存全部报文才可进行植入处理，可大幅减少处理时延；
3、对要植入的页面HTML代码的规范性要求较低，有利于提升网页附加内容的植入率；
4、不改变HTML原有页面元素结构，对原有网页展示的影响小。
实施例二
如图8所示，本公开实施例二提供的内容植入的装置包括：
转换模块81，被配置为将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
植入模块82，被配置为将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
本公开实施例二提供的所述内容植入的装置通过利用JS脚本能够在HTML页面报文框架外部生效，以及GZIP支持多个独立压缩/非压缩数据块的特性，将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文，将JS脚本链接报文直接植入超文本标记语言HTML压缩报文尾部；无需对GZIP报文进行解压/重压缩，可节省大量的系统计算资源，有利于大幅降低植入系统建设成本；不需要识别和解析HTML页面框架，可实现报文的逐包处理转发，避免要收全和缓存全部报文才可进行植入处理，可大幅减少处理时延；对要植入的页面HTML代码的规范性要求较低，有利于提升网页附加内容的植入率；不改变HTML原有页面元素结构，对原有网页展示的影响小；较好的解决了相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题。
其中，所述植入模块包括：第一处理子模块，被配置为根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部。
所述第一处理子模块包括：查找单元，被配置为根据压缩数据格式查找HTML压缩报文中的结束数据块；标记单元，被配置为在找到结束数据块后，将原结束数据块标记为非结束数据块；构造单元，被配置为根据JS脚本链接报文构造当前结束数据块。
为了保证正常的解析使用，所述装置还可以包括：更新模块，被配置为更新当前HTML压缩报文的尾部信息。
所述更新模块可以包括：第二处理子模块，被配置为根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；第三处理子模块，被配置为根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；更新子模块，被配置为根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
其中，上述内容植入的方法的所述实现实施例均适用于该内容植入的装置的实施例中，也能达到相同的技术效果。
为了解决上述技术问题，本公开实施例还提供了一种内容植入系统，包括：上述的内容植入的装置。
其中，上述内容植入的装置的所述实现实施例均适用于该内容植入系统的实施例中，也能达到相同的技术效果。
需要说明的是，此说明书中所描述的许多功能部件都被称为模块/子模块，以便更加特别地强调其实现方式的独立性。
本公开实施例中，模块/子模块可以用软件实现，以便由各种类型的处理器执行。举例来说，一个标识的可执行代码模块可以包括计算机指令的一个或多个物理或者逻辑块，举例来说，其可以被构建为对象、过程或函数。尽管如此，所标识模块的可执行代码无需物理地位于一起，而是可以包括存储在不同位里上的不同的指令，当这些指令逻辑上结合在一起时，其构成模块并且实现该模块的功能。
本公开实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述任一实施例中的方法。
所述计算机可读存储介质可以是暂态计算机可读存储介质，也可以是非暂 态计算机可读存储介质。
本公开实施例还提供了一种电子设备的结构示意图。参见图9，该电子设备包括：
至少一个处理器(processor)90，图9中以一个处理器90为例；和存储器(memory)91，还可以包括通信接口(Communications Interface)92和总线93。其中，处理器90、通信接口92、存储器91可以通过总线93完成相互间的通信。通信接口92可以用于信息传输。处理器90可以调用存储器91中的逻辑指令，以执行上述实施例的方法。
此外，上述的存储器91中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。
存储器91作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序，如本公开实施例中的方法对应的程序指令/模块。处理器90通过运行存储在存储器91中的软件程序、指令以及模块，从而执行功能应用以及数据处理，即实现上述方法实施例中的内容植入方法。
存储器91可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端设备的使用所创建的数据等。此外，存储器91可以包括高速随机存取存储器，还可以包括非易失性存储器。
本公开实施例的技术方案可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括一个或多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开实施例所述方法的全部或部分步骤。而前述的存储介质可以是非暂态存储介质，包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等多种可以存储程序代码的介质，也可以是暂 态存储介质。
实际上，可执行代码模块可以是单条指令或者是许多条指令，并且甚至可以分布在多个不同的代码段上，分布在不同程序当中，以及跨越多个存储器设备分布。同样地，操作数据可以在模块内被识别，并且可以依照任何适当的形式实现并且被组织在任何适当类型的数据结构内。所述操作数据可以作为单个数据集被收集，或者可以分布在不同位置上(包括在不同存储设备上)，并且至少部分地可以仅作为电子信号存在于系统或网络上。
在模块可以利用软件实现时，考虑到相关硬件工艺的水平，所以可以以软件实现的模块，在不考虑成本的情况下，本领域技术人员都可以搭建对应的硬件电路来实现对应的功能，所述硬件电路包括常规的超大规模集成(VLSI)电路或者门阵列以及诸如逻辑芯片、晶体管之类的相关半导体或者是其它分立的元件。模块还可以用可编程硬件设备，诸如现场可编程门阵列、可编程阵列逻辑、可编程逻辑设备等实现。
以上所述的是本公开的实施方式，应当指出对于本技术领域的普通人员来说，在不脱离本公开实施例的范围的前提下，还可以作出若干改进和润饰，这些改进和润饰也应视为本公开的保护范围。
工业实用性
本申请提供的内容植入的方法、装置及系统，无需对GZIP报文进行解压/重压缩，可节省大量的系统计算资源，有利于大幅降低植入系统建设成本；不需要识别和解析HTML页面框架，可实现报文的逐包处理转发，避免要收全和缓存全部报文才可进行植入处理，可大幅减少处理时延；对要植入的页面HTML代码的规范性要求较低，有利于提升网页附加内容的植入率；不改变HTML原有页面元素结构，对原有网页展示的影响小；较好的解决了相关技术中网页内容植入系统无法直接对GZIP压缩格式的HTML报文实现内容植入的问题。

Claims (12)

  1. 一种内容植入的方法，包括：
    将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
    将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
  2. 如权利要求1所述的方法，其中，所述将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部的步骤包括：
    根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部。
  3. 如权利要求2所述的方法，其中，所述根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部的步骤包括：
    根据压缩数据格式查找HTML压缩报文中的结束数据块；
    在找到结束数据块后，将原结束数据块标记为非结束数据块；
    根据JS脚本链接报文构造当前结束数据块。
  4. 如权利要求1所述的方法，还包括：
    更新当前HTML压缩报文的尾部信息。
  5. 如权利要求4所述的方法，其中，所述更新当前HTML压缩报文的尾部信息的步骤包括：
    根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；
    根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；
    根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
  6. 一种内容植入的装置，包括：
    转换模块，被配置为将欲植入的内容页面转换为客户端脚本语言JS脚本链接报文；
    植入模块，被配置为将JS脚本链接报文植入超文本标记语言HTML压缩报文尾部。
  7. 如权利要求6所述的装置，其中，所述植入模块包括：
    第一处理子模块，被配置为根据压缩数据格式查找HTML压缩报文尾部，并将JS脚本链接报文植入HTML压缩报文尾部。
  8. 如权利要求7所述的装置，其中，所述第一处理子模块包括：
    查找单元，被配置为根据压缩数据格式查找HTML压缩报文中的结束数据块；
    标记单元，被配置为在找到结束数据块后，将原结束数据块标记为非结束数据块；
    构造单元，被配置为根据JS脚本链接报文构造当前结束数据块。
  9. 如权利要求6所述的装置，还包括：
    更新模块，被配置为更新当前HTML压缩报文的尾部信息。
  10. 如权利要求9所述的装置，其中，所述更新模块包括：
    第二处理子模块，被配置为根据原HTML压缩报文的校验码和植入的JS脚本链接报文的内容获得当前校验码；
    第三处理子模块，被配置为根据原HTML压缩报文的非压缩长度和植入的JS脚本链接报文的长度获得当前非压缩长度；
    更新子模块，被配置为根据所述当前校验码和所述当前非压缩长度更新当前HTML压缩报文的尾部信息。
  11. 一种内容植入系统，包括：如权利要求6至10任一项所述的内容植入的装置。
  12. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行权利要求1-5中任一项的方法。
PCT/CN2017/091028 2016-06-30 2017-06-30 一种内容植入的方法、装置及系统 WO2018001350A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610506032.8 2016-06-30
CN201610506032.8A CN107566317A (zh) 2016-06-30 2016-06-30 一种内容植入的方法、装置及系统

Publications (1)

Publication Number Publication Date
WO2018001350A1 true WO2018001350A1 (zh) 2018-01-04

Family

ID=60786506

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/091028 WO2018001350A1 (zh) 2016-06-30 2017-06-30 一种内容植入的方法、装置及系统

Country Status (2)

Country Link
CN (1) CN107566317A (zh)
WO (1) WO2018001350A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101788911A (zh) * 2010-03-04 2010-07-28 北京惠信博思技术有限公司 一种基于浏览器开发数字电视应用的方法
US20140281918A1 (en) * 2013-03-15 2014-09-18 Yottaa Inc. Systems and methods for configuration-based optimization by an intermediary
CN105488175A (zh) * 2015-12-01 2016-04-13 福建天晴数码有限公司 一种提高页面内容显示速度的方法及系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101788911A (zh) * 2010-03-04 2010-07-28 北京惠信博思技术有限公司 一种基于浏览器开发数字电视应用的方法
US20140281918A1 (en) * 2013-03-15 2014-09-18 Yottaa Inc. Systems and methods for configuration-based optimization by an intermediary
CN105488175A (zh) * 2015-12-01 2016-04-13 福建天晴数码有限公司 一种提高页面内容显示速度的方法及系统

Also Published As

Publication number Publication date
CN107566317A (zh) 2018-01-09

Similar Documents

Publication Publication Date Title
US9338258B2 (en) Methods and network devices for communicating data packets
US8819287B2 (en) System and method for compressing URL request parameters
CN109831409B (zh) 数据传输方法、装置、计算机可读存储介质及电子设备
CN101610268B (zh) 一种关键字过滤的实现方法和设备
US20090198761A1 (en) Message encoding/decoding using templated parameters
US20150032804A1 (en) Method and server device for exchanging information items with a plurality of client entities
CN111262876B (zh) 基于区块链的数据处理方法、装置、设备以及存储介质
US10817460B2 (en) RDMA data sending and receiving methods, electronic device, and readable storage medium
CN105052040A (zh) 多流压缩与解压的方法与系统
CN114362885B (zh) 物联网数据传输方法、通信系统、设备和介质
EP2790378B1 (en) A method, apparatus and computer program for adding content to a data container
CN114157607A (zh) 媒体流传输方法和系统
CN106851733A (zh) 一种针对移动网络应用的自适应http消息压缩方法
TW201312963A (zh) 提供線性消除碼之方法與裝置
CN112995199A (zh) 数据编解码方法、装置、传输系统、终端设备及存储介质
WO2018001350A1 (zh) 一种内容植入的方法、装置及系统
CN110149631B (zh) 一种适用于云音箱建立连接的方法及系统
CN113691484A (zh) 用于协议适配的装置和方法
CN113986820A (zh) 一种lz4格式文件转换为gzip格式文件的方法
TWI645698B (zh) 資料發送裝置、資料接收裝置及其方法
CN113204683A (zh) 信息重构方法和装置、存储介质及电子设备
CN112749353A (zh) 网页图标的处理方法和装置
CN110858923B (zh) 分段媒体文件生成方法、装置及存储介质
CN113825166B (zh) 一种基站测试方法、装置、电子设备及存储介质
US7999705B2 (en) Unicode-compatible base-N range coding

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17819347

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17819347

Country of ref document: EP

Kind code of ref document: A1