共查询到19条相似文献，搜索用时 750 毫秒
1.
本文介绍了光突发技术的基本概念，并详细描述了光突发交换技术中的JET协议和基于偏置时间的QoS方案如何在WDM层中避免网络拥塞和提供QoS支持。 相似文献
2.
目前的三种光交换技术中,OBS（光突发交换）因具有适中的交换粒度,较高的带宽利用率和其他很多优点,成为下一代全光网络的模式之一。OBS网络最关键的是其信道调度算法,它对网络性能的影响很大。这里主要介绍了OBS网络的信道调度算法——FF算法,并提出了基于FF算法的新的算法思想。 相似文献
3.
文章对光分组交换网络存在的主要问题和关键技术进行了简单的介绍,重点介绍了光交换网络中的光缓存技术,以及目前实现光缓存常用的方法。 相似文献
4.
光突发交换(Optical Burst Switching,OBS)结合了光电路交换和分组交换的优点。OBS被认为是在未来光互连网中最具有可实现性的一种交换技术。OBS采用单向资源预留机制,通过在电域上对资源的优化配置实现数据的透明传输。目前OBS网络中对单向资源协议的研究主要集中在基于RFD协议的JET协议和基于TAG协议的JIT协议。本文讨论分析了OBS网络中目前运用的JET、JIT两种资源预留协议的基本理论,并对这两种资源预留协议进行研究,分别指出它们应用机理和应用环境。 相似文献
5.
6.
交换技术在通信技术的发展过程中扮演了重要角色，本文介绍了交换技术的演进过程，并对演进过程中的各种交换技术进行了介绍。对比较有发展前途的软交换和光交换进行了阐述，最后对交换技术的发展方向进行了探讨。 相似文献
7.
文章研究了GMPLS智能交换光网络的网络结构、GMPLS标记的格式及主要协议。重点探讨了GMPLS网络中的标记交换技术,分析了当前被广泛采用的波长做标记进行交换的网络管理技术及存在的问题。 相似文献
8.
分析了MPLmS网络的基本原理,为了能在标签的分配中更好地体现QoS,通过引入多协议标签交换(MPLS)流量工程控制技术与光交叉连接相结合的一种新型光互联技术——多协议波长标签交换(MPLmS),重点对标签的分配策略进行分析和设计,提出了一种新的基于WFQ轮转调度算法。 相似文献
9.
通信网和互联网都是由传输和交换两部分组成,目前传输已经完成了由电到光的革命性的转变,但交换仍然是电的交换。根据分布式网络的设计理念,本文提出了新型的分布式波分、纤分复用光路交换的信息流量极大的下一代网络结构。它将从结构上解决网络的安全问题。 相似文献
10.
尽管已有大量研究关注领导—成员交换对员工创造力的影响,但对于两者作用机制的研究却还处于探索阶段。通过204对直接领导与员工的配对问卷调查,实证研究领导—成员交换对员工创造力的影响机制,尤其是内部动机的中介作用与工作多样性的调节作用。通过结构方程和回归分析,证实了领导—成员交换、内部动机与员工创造力显著正相关,内部动机在领导—成员交换与员工创造力两者间起完全中介作用,而工作多样性在领导—成员交换与内部动机之间起缓冲调节作用。 相似文献
11.
在光学系统中,SOI(绝缘体上的半导体)上制备集成的MMI(多模干涉)型光耦合器已成为一种愈来愈引人注目的无源器件.由于Si和SiO2 之间具有大的折射率差,在SOI波导中可以采用SiO2 薄膜( <1.0 μm)作限制层,这与超大规模集成电路工艺相兼容.描述了采用SOI技术制备集成的MMI型光耦合器和光开关的设计和制造结果.业已证实,2× 2MMI MZI(多模干涉 麦赫 曾德干涉)型热光开关的开关时间小于 2 0 μs. 相似文献
12.
文章以桂林供电局城域光传输网和平站优化改造工程中出现的故障及解决方案为例,结合SDH传输系统故障定位及排除的常用方法,重点阐释了SDH光传输网新建网元过程中应注意的几个重要问题。 相似文献
13.
This paper presents the design, analysis, and implementation of a beam-stabilized optical switch using a voice-coil motor actuator. A closed-loop control system using a proportional-integral-derivative (PID) controller is developed to stabilize the beam at the desired angle to maximize the optical power detected by a photodiode. Experimental results show a good performance with 17 ms switching speed and a maximum overshoot of only 3%. 相似文献
14.
Hossein Shokouhi-Nejad Amir Rikhtehgar Ghiasi Mohammad Ali Badamchizadeh 《Journal of The Franklin Institute》2017,354(12):4801-4825
This paper concerns the simultaneous fault detection and control (SFDC) problem for a class of nonlinear stochastic switched systems with time-varying state delay and parameter uncertainties. The switching signal of detector/controller unit (DCU) is assumed to be with switching delay, which results in the asynchronous switching between the subsystems and DCU. By constructing a switching strategy depending on the state and switching delays, new sufficient conditions expressed by a set of linear matrix inequalities (LMIs) is derived to design DCU gains. This problem is formulated as an H∞ optimization problem and both mean square exponential stability and fault detection of augmented system are considered. A numerical example is finally exploited to verify the effectiveness and potential of the achieved scheme. 相似文献
15.
This paper investigates the problem of fault detection (FD) for discrete-time switched systems. Under a dwell time constraint, a switching rule that depends on the measured output is constructed for the system. Time-varying residual generators are designed such that the switched system is asymptotically stable and also with the detection performance under this switching rule. The advantages of the proposed technique are threefold: 1) It has the advantages of both slow switching and fast switching. 2) It can extend the classic design of time-invariant residual generator. 3) It can guarantee the switched system still has the desired fault detection performance even if all subsystems are without it. This feature reduces the performance requirements for each subsystem. A numerical example illustrates the effectiveness of the proposed method. 相似文献
16.
《Journal of The Franklin Institute》2023,360(9):6275-6295
As for the multi-agent systems (MASs) with time-varying switching subject to deception attacks, the leader-following consensus problem is studied in this article. The one-sided Lipschitz (OSL) condition is utilized for the nonlinear functions, which makes the results more general and relaxed than those obtained by Lipschitz condition. The nonidentical double event-triggering mechanisms (ETMs) are adopted for only a fraction of agents, and each agent transmits the data according to its own necessity. Semi-Markov process modeling with time-varying switching probability is adopted for switching topology and deception attacks occurring in transmission channel are considered. By using the cumulative distribution function (CDF) and the linear matrix inequality (LMI) technology, sufficient conditions for MASs to achieve consensus in mean square are obtained. An effective algorithm is presented to obtain the event-based control gains. The merits of the proposed control scheme are demonstrated via a simulation example. 相似文献
17.
《Journal of The Franklin Institute》2022,359(4):1457-1485
This paper investigates the problem of event-triggered adaptive neural network (NN) control for multi-input multi-output (MIMO) switched nonlinear systems with output and state constraints and non-input-to-state practically stable (ISpS) unmodeled dynamics. A nonlinear mapping is firstly utilized to deal with output and state constraints. Also, by developing a new switching signal with persistent dwell-time (PDT) and a switching dependent dynamic signal, the difficulty caused by some non-ISpS unmodeled dynamics is overcome. Then, a type of switching event-triggering mechanisms (ETMs) and event-triggered adaptive NN controllers of subsystems are designed, which handle the issue of asynchronous switching without requiring any known restriction on maximum asynchronous time. A piecewise constant introduced into this ETM effectively ensures a strict positive lower bound of inter-event times. Zeno behavior is thus ruled out. Finally, by proposing a novel class of switching signals with reset PDT, it is ensured that all output and state constrains are never violated and all signals of the switched closed-loop system are semi-global uniform ultimate boundedness (SGUUB). A two inverted pendulum system and a numerical example are provided for illustrating the applicability and validity of the proposed method. 相似文献
18.
This paper is concerned with the problem of state feedback stabilization of a class of discrete-time switched singular systems with time-varying state delay under asynchronous switching. The asynchronous switching considered here means that the switching instants of the candidate controllers lag behind those of the subsystems. The concept of mismatched control rate is introduced. By using the multiple Lyapunov function approach and the average dwell time technique, a sufficient condition for the existence of a class of stabilizing switching laws is first derived to guarantee the closed-loop system to be regular, causal and exponentially stable in the presence of asynchronous switching. The stabilizing switching laws are characterized by a upper bound on the mismatched control rate and a lower bound on the average dwell time. Then, the corresponding solvability condition for a set of mode-dependent state feedback controllers is established by using the linear matrix inequality (LMI) technique. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed method. 相似文献
19.
Kabekode V.S. Bhat 《Journal of The Franklin Institute》1982,313(5):299-312
In this paper we pursue the graph theoretic approach to the switching function minimization problem which is still important in view of today's technological innovations such as programmable logic arrays. We use switching functions graphs (SFG) for studying the structure of switching functions and the minimization problem. The graph theoretic interpretation of the classical minimization problem leads to an alternative and powerful approach to logic design that is suitable for computer implementations. The approach is particularly useful in the analysis and design of suboptimum algorithms for minimization of arbitrarily complex switching functions arising in practice for which exact algorithms are known to be computationally intractable. A few graph theoretic algorithms leading to minimization of switching functions are presented and examples indicating the power of our approach, and algorithms are worked out. Further work needed in the area is indicated. 相似文献