It is known that the study of the qualitative properties of a matrix A (which depend only on the sign pattern of A) can be turned into the study of the graph theoretical properties of the signed digraph S(A). The unde...It is known that the study of the qualitative properties of a matrix A (which depend only on the sign pattern of A) can be turned into the study of the graph theoretical properties of the signed digraph S(A). The underlying digraph of the signed digraph of a strong sign nonsingular matrix (abbreviated S NS matrix) with a negative main diagonal is called an S NS digraph. In the study of S NS digraphs, the minimal forbidden configuration (or MFC for short) plays an important role. Three (classes of) MFS's were constructed by Thomassen, Brualdi and Shader, and Shao. In this paper, we show that a digraph D is an S2NS digraph if and only if its 'cycle linear system' is solvable. This simplifies a parallel result obtained by Shao and Hu. As an application of the result, a graph theoretical characterization for a digraph to be an S NS digraph is given. At the end of the paper, we construct infinitely many new MFCs to show that for each even number k(k>0), there are basic MFCs with fc terminal components (here, with no loss of generality, we assume that the number of the initial components of a digraph is no less than that of its terminal components throughout the following).展开更多
技术的发展推动着传统网络向智能网络转变,智能网络中类型繁多的流量业务所产生的巨大、多样的数据流量易导致网络拥塞等问题,这给网络拥塞控制体系提出了更高的要求。主动队列管理机制是拥塞控制体系中不可或缺的一环,随机早期检测(ran...技术的发展推动着传统网络向智能网络转变,智能网络中类型繁多的流量业务所产生的巨大、多样的数据流量易导致网络拥塞等问题,这给网络拥塞控制体系提出了更高的要求。主动队列管理机制是拥塞控制体系中不可或缺的一环,随机早期检测(random early detection,RED)算法及其改进算法都是主动队列管理机制中缓解网络拥塞的常见方法,但都存在无法适应网络动态变化所带来的队列长度不稳定的问题。针对该问题,提出一种新型主动队列管理算法SP-ARED(square power-ARED),SP-ARED算法通过优化丢弃概率函数以及引入新的阈值上限,来更好地缓解网络拥塞。NS2的仿真结果表明,在复杂、动态的网络环境下,除时延以外,SP-ARED算法在平均队列长度稳定性、吞吐量、丢包率和时延抖动方面的表现都有了提高。展开更多
基金Supported by the Doctoral Fund of the Xiamen University (No.Y01007).
文摘It is known that the study of the qualitative properties of a matrix A (which depend only on the sign pattern of A) can be turned into the study of the graph theoretical properties of the signed digraph S(A). The underlying digraph of the signed digraph of a strong sign nonsingular matrix (abbreviated S NS matrix) with a negative main diagonal is called an S NS digraph. In the study of S NS digraphs, the minimal forbidden configuration (or MFC for short) plays an important role. Three (classes of) MFS's were constructed by Thomassen, Brualdi and Shader, and Shao. In this paper, we show that a digraph D is an S2NS digraph if and only if its 'cycle linear system' is solvable. This simplifies a parallel result obtained by Shao and Hu. As an application of the result, a graph theoretical characterization for a digraph to be an S NS digraph is given. At the end of the paper, we construct infinitely many new MFCs to show that for each even number k(k>0), there are basic MFCs with fc terminal components (here, with no loss of generality, we assume that the number of the initial components of a digraph is no less than that of its terminal components throughout the following).
文摘技术的发展推动着传统网络向智能网络转变,智能网络中类型繁多的流量业务所产生的巨大、多样的数据流量易导致网络拥塞等问题,这给网络拥塞控制体系提出了更高的要求。主动队列管理机制是拥塞控制体系中不可或缺的一环,随机早期检测(random early detection,RED)算法及其改进算法都是主动队列管理机制中缓解网络拥塞的常见方法,但都存在无法适应网络动态变化所带来的队列长度不稳定的问题。针对该问题,提出一种新型主动队列管理算法SP-ARED(square power-ARED),SP-ARED算法通过优化丢弃概率函数以及引入新的阈值上限,来更好地缓解网络拥塞。NS2的仿真结果表明,在复杂、动态的网络环境下,除时延以外,SP-ARED算法在平均队列长度稳定性、吞吐量、丢包率和时延抖动方面的表现都有了提高。