基于LZSS的SIP压缩算法改进研究

3GPP在R5版本中首次提出了IP多媒体子系统（IMS）的概念,SIP协议被选择为呼叫会话控制协议。由于SIP是基于文本的协议,在会话过程中需要重传大量的数据,导致在会话建立过程中时延的增加。文中在分析现有的SIP信令压缩算法的基础上,提出了一种带有预处理的LZSS与算术编码相结合的改进算法。首先对消息进行预编码,然后进行LZSS压缩,压缩完后与算术编码相结合,这种改进后的算法减少了信令传输延迟。文中运用典型的SIP会话环境进行仿真实验,其结果验证了改进算法能够有效地提高性能,缩短消息长度和减小传输时延。     

IMS中SIP会话建立时延的研究

为了在3G核心网中支持多媒体会话,3GPP在R5中引入了IP多媒体子系统(IMS),并选择SIP作为IMS中的呼叫/会话的控制信令.IMS可以提供多媒体业务和语音业务,对QoS提出了更高的要求.主要讨论IMS QoS的一个重要参数-SIP会话建立时延.分析了SIP会话建立时延模型和相关因素并从3方面提出了优化措施,SIP的传输协议选择,信令重传机制的改进以及对SIP信令的压缩,最后进行了性能仿真.     

基于SigComp的会话初始化协议压缩算法

独立媒体服务(IMS)是第三代合作伙伴计划(3GPP)在版本5中提出的支持IP多媒体业务的子系统,而基于文本的SIP消息过大成为其在IMS无线环境应用下的瓶颈,因此采用会话初始化协议（SIP）来建立和维护多媒体会话。在SigComp框架下,将改进后的LZSS算法与算术编码相结合对SIP信令进行压缩。实验表明新的算法有较高的压缩率,对改善IMS的SIP会话建立延时有一定的参考价值。     

一种新的基于IMS的SIP重传机制

目前,IP多媒体子系统（IMS）中基于会话初始化协议（SIP）的会话建立时间受到无线信道约束带宽、帧错误率（FER）值的影响,交换的消息数量、消息长度以及重传机制对于会话建立的时延有很大的影响,延长了会话建立的时间。将基于SIP的会话建立与无线信道的性能结合,提出一种新的SIP自适应重传机制。实验结果表明,该重传机制缩短了会话建立的时间,对IMS端到端的服务质量（QoS）性能有明显的改善。     

改进的无损压缩算法在软电话中的研究与应用

PC-Phone业务已经成为目前业界关注的焦点，该文研究了以SIP为会话初始协议的一个支持视频和音频的多媒体可视软件电话（SoftPone）设计与实现，并在此基础上提出了一种改进的LZW无损压缩算法实现对SoftPhone中SIP文本消息的无损压缩，达到了降低传输延迟、缩短会话建立时间的目的。     

SIP协议消息压缩算法的研究与探讨

SigComp（Signaling Compression）框架结构下，参考IETF提出的静态短语字典扩充了初始字典，并根据SIP消息曹尊枣，紫改进了的LZW（Lempel-Ziv Welch）算法与简化算术编码相结合，实现对SIP消息的压缩，以达到降低传输延迟、缩短会话建立时问的目的。     

IMS中基于LZSS的SIP信令压缩算法研究

3GPP在R5核心网引入了IMS结构，并选择会话初始协议（SIP）作为呼叫/会话的控制信令。但在无线环境下消息过长成为SIP在IMS中的应用瓶颈。在SigComp框架下，对各种压缩算法进行了比较，并根据SIP消息特点选择LZSS算法作为SIP信令压缩的基本算法。为了进一步提高SIP信令的压缩比，提出了LZSS＋Huffman的压缩算法及其实现流程，并对算法的压缩效果进行了仿真分析。     

一种IMS网络中的SIP洪泛攻击检测方法

IMS（IP Multimedia Subsystem,IP多媒体子系统）是3G系统中核心网的重要部分,它由SIP协议提供的会话发起能力建立起端到端的会话,并获得所需要的服务质量。针对IMS网络中存在的SIP洪泛攻击,本文在详细分析SIP洪泛攻击原理和实现过程的基础上,提出了一种基于累积和算法的SIP洪泛攻击检测方法。该方法首先通过对接收到的SIP数据包中的INVITE消息的数量进行统计,然后将统计结果输入到累积和算法,以检测是否发生SIP消息洪泛攻击,最后通过设置的阙值来判决检测结果。实验结果表明,本文提出的方法能够有效地检测到IMS网络中的SIP洪泛攻击。     

改进的无损压缩算法在软电话中的研究与应用

PC-Phone业务已经成为目前业界关注的焦点，该文研究了以SIP为会话初始协议的一个支持视频和音频的多媒体可视软件电话(Soft Pone)设计与实现，并在此基础上提出了一种改进的LZW无损压缩算法实现对Soft Phone中SIP文本消息的无损压缩，达到了降低传输延迟、缩短会话建立时间的目的。     

IMS网络应用SIP协议的时延改进策略研究

介绍了IMS网络系统与SIP协议在IMS网络中的应用,在设定的网络仿真环境前提下,设计并且建立了IMS网络会话的仿真模型以及会话流程.通过采用OPNET网络仿真软件仿真指出IMS网络应用SIP协议呼叫时延的产生原因,通过设计引入"前提"的概念来改进时延,并且利用OPNET网络仿真工具通过仿真比较验证了该方案的有效性和正确性.     

P2PSIP系统子网间会话建立延迟的研究

为了解决由于网络节点的大量增加引起的分层P2PSIP系统中子网间用户会话建立的高延迟问题,提出了利用上层覆盖网采用单跳HDT算法的解决方案。对现有的P2PSIP网络进行了研究,把会话建立时用户定位的延迟分为在子网内部和上层覆盖网中两个部分。利用单跳DHT算法来减少子网间用户定位时消息在上层覆盖网中路由的跳数,从而可以降低平均延迟时间。通过对该方案的可行性分析和延迟的比较,表明了该方案是可行的。     

A Cross-Layer Analysis of Session Setup Delay in IP Multimedia Subsystem (IMS) With EV-DO Wireless Transmission

This paper analyzes the session setup delay in the IP multimedia subsystem (IMS) with the CDMA2000 evolution data only rev. A (EV-DO rev. A) standard for wireless transmission. Session setup delay is particularly critical for interactive multimedia applications, such as gaming, push-to-X and voice over IP (VoIP), as it directly translates in user perception of service quality. Keeping signaling delay low, however, is a challenge in IMS due to the text-based nature of the session initiation protocol (SIP) for signaling, and, more significantly, due to the lossy and capacity constrained wireless links. To address this challenge, we analyze the session setup delay end-to-end, by taking into account key system properties across all layers, ranging from radio links to IMS signaling architecture. We present a model for cross-layer performance analysis and simulation, which includes the statistical properties of the EV-DO (rev. A) wireless channel, and also takes into consideration the properties of transport protocols (TCP, UDP) and SIP signaling (message size and compression). By means of analysis and simulations, we study the setup delay performance of a generic, multi-operator IMS communication scenario between two mobile users. We describe how session setup delay can be estimated and reduced in realistic IMS settings and we propose architecture alternatives to the basic IMS scenario. The results derived from this study show that the proposed methods can incrementally lead to a lower setup delay and less sensitivity to the radio transmission quality and frame error rate compared to the base IMS scenario     

远程教育环境中会话发起机制的研究

在基于多播的紧密控制的多媒体会议系统中，会话的发起经常采用发送会话公告信息的方法，但是在这样的会话发起框架中仍然存在一些问题，由于会话公告协议限制全局会话的公告报文带宽上限为4Mb／S，再加上多播信息的不可靠传送，客户端的会话目录工具经常需要等待10—20分钟才能得到特定会话的公告信息。讨论了远程教育环境中的会议发起机制以及与之紧密相关的会话目录服务，并在此基础上对上述的启动延迟问题进行了分析，提出了使用会话目录代理的方法未解决该问题。     

Dual home agent (DHA)-based location management scheme in integrated cellular–WLAN networks

For seamless integration of cellular and wireless local area network (WLAN) systems, we introduce a dual home agent (DHA)-based location management. The DHA maintains the location information both in the cellular and WLAN systems, and therefore unnecessary registration cost can be significantly reduced. In addition, a heuristic, which first looks for the called mobile node (MN) in the cellular system, is proposed to reduce the session setup latency. We analyze the registration cost, session setup delay, and registration delay. Numerical results demonstrate that Mobile IP with the DHA can reduce the registration cost significantly and allows a session setup delay that is comparable to that of the basic Mobile IP.     

基于离散序列报文的协议格式特征自动提取算法

针对缺少会话信息的离散序列报文,提出一种基于离散序列报文的协议格式（SPMbFSC）特征自动提取算法。SPMbFSC在对离散序列报文进行聚类的基础上,通过改进的频繁模式挖掘算法提取出协议关键字,进一步对协议关键字进行选择,筛选出协议格式特征。仿真结果表明,SPMbFSC在以单个报文为颗粒度的识别中对FTP、HTTP等六种协议的识别率均能达到95%以上,在以会话为颗粒度的识别中识别率可达90%。同等实验条件下性能优于自适应特征（AdapSig）提取方法。实验结果表明SPMbFSC不依赖会话数据的完整性,更符合实际应用中由于接收条件限制导致会话信息不完整的情形。     

Next generation session management for 3D teleimmersive interactive environments

In the recent past we have seen a boom of distributed interactive multimedia environments which use multiple correlated media sensors, multi-view displays, and advanced haptic-audio-visual user interfaces for teleimmersive gaming, business meetings and other collaborative activities. However, when we investigate the emerging teleimmersive environments closer, we realize that their overall session management, including end-to-end session setup, establishment and run-time management are not appropriate for the new demands that these environments present. These environments are cyber-physical rooms that demand (a) large scale of multi-sensory devices across geographically-distributed locations and (b) interaction with each other in synchronous and real-time manner. To deal with the new teleimmersive demands, we present a new session management design with (a) session initiation protocol(s) that understand media correlations, (b) view-based multi-stream topology establishment among multiple parties, (c) efficient, light-weight and distributed session monitoring with querying and debugging capabilities, (d) flexible view-based session adaptation with efficient topology adjustments, and (e) light-weighted and consistent session tear-down protocols. The presented design of the next generation session management protocols, services, algorithms and data structures is based on our extensive experiences with building 3D teleimmersive interactive systems, experimenting with high impact teleimmersive applications and deploying such environments at various venues.     

制造系统的递阶滚动优化调度模型

研究的对象是只有一台不可靠（failure-prone)机器的非完全柔性制造系统，该系统能生产多种产品，但在同一时刻只能生产一种产品，并且当机器由生产一种产品向生产另一种产品切换时，需要考虑setup时间及其成本，待决策变量是setup序列及产品生产率，本文基于非完全柔性制造系统的特点，引入递阶层控的思想，采用新的递阶结构框架和阈值控制策略，对问题进行分解，建立了考虑setup时间及成本的递阶流率控制最优化调度模型，并给出了递阶的滚动优化算法，仿真结果表明，这种调度策略更易于工程实现。     

Integrating Priority with Share in the Priority-Based Weighted Fair Queuing Scheduler for Real-Time Networks

The Weighted Fair Queuing (WFQ) scheduler has been closely studied due to its desirable properties of bandwidth guarantee and bounded delay. However, the queuing delay bound of a communication session is tightly coupled with the session's allocated service share. To receive a low queuing delay, a session must reserve a high share. In this paper, we study a new fair queuing algorithm called Priority-based Weighted Fair Queuing (PWFQ). PWFQ combines a session's allocated share to achieve the bandwidth guarantee and the session's priority to adjust the delay bound inside a sliding window. The new algorithm decouples the delay from the service share so that a session with a low share but a high priority may still receive a small delay. We analyze the worst-case delay bound of PWFQ and propose a simple algorithm to assign session priorities.     

A single machine carryover sequence-dependent group scheduling in PCB manufacturing

This paper considers the problem of minimizing the makespan on a single machine with carryover sequence-dependent setup times. A similar problem with multi-machine flow shop usually arises in the assembly of printed circuit boards (PCBs). This research investigates the possibility of processing all components of PCBs using just one machine. By doing so the operational costs of having multi-machines can be reduced, and as a result, finding an optimal solution might be more plausible. The objective is to minimize the maximum completion time of all board groups, commonly known as makespan. The operational constraints are such that all board types within a board group must be completely kitted, as it is traditionally performed by kitting staff, before that board group begins its assembly operation. We introduce the external setup (kitting) time and require that it be performed solely by the machine operator during the run time of the current board group, and thereby completely eliminating the need for kitting staff. The carryover sequence-dependent setup time, namely the internal (machine) setup time, is realized when a new board group is ready for assembly operation and is dependent on all of the previously scheduled board groups and their sequences. To the best of our knowledge, this is the first time the external and internal setup times are integrated in PCB group scheduling research. We develop a branch-and-bound algorithm and a lower-bounding structure. The lower bound consists of two approaches, which enable the algorithm to simultaneously reduce performing unnecessary exploration. In order to test the efficiency of the algorithm, several problem instances with different board groups have been used. The algorithm developed requires a significantly large computation time to optimally solve very large problems. Thus to speak for the efficiency in terms of solving comparable large industry-size problems, we evaluate the deviation of the algorithm from the lower bound which turns out to be very small, with an average of only 6%, in all of the problem instances considered.