Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit （LEO） satellite constellations have attracted great interests because o...Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit （LEO） satellite constellations have attracted great interests because of their short round-trip delays and wide bandwidths. A challenging problem is to develop a simple and efficient packet routing algorithm for the LEO satellite constellation network. This paper presents a SpiderWeb Topological Network （SWTN） and a distributed packet routing algorithm for the LEO satellite constellation network based on the SWTN. The algorithm gives the minimum propagation delay paths with low computational complexity and requires no routing tables, which is practical for on-board processing. The performance of the algorithm is demon- strated through simulations.展开更多
We demonstrate the routing operation of optical packets by an optical packet switch consisting of an optical digital-to-analog conversion-type header processor, a wavelength converter using an electrically-tunable las...We demonstrate the routing operation of optical packets by an optical packet switch consisting of an optical digital-to-analog conversion-type header processor, a wavelength converter using an electrically-tunable laser, and an arrayed-waveguide grating router. A packet transfer by two-bit optical header was achieved for the first time.展开更多
A WDM compatible Edge-to-Edge Self-Routed optical packet switched network that simplifies the optical processing is proposed. The system employs all-optical packet label generation and recognition using coded superstr...A WDM compatible Edge-to-Edge Self-Routed optical packet switched network that simplifies the optical processing is proposed. The system employs all-optical packet label generation and recognition using coded superstructured Fiber Bragg gratings.展开更多
Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previou...Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.展开更多
Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is prop...Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.展开更多
In this paper, we propose a new packet routing strategy that incorporates memory information for reducing congestion in communication networks. First, we study the conventional routing strategy which selects the paths...In this paper, we propose a new packet routing strategy that incorporates memory information for reducing congestion in communication networks. First, we study the conventional routing strategy which selects the paths for transmitting packets to destinations using the distance information and the dynamical information such as the number of accumulating packets at adjacent nodes. Then, we evaluate the effectiveness of this routing strategy for the scale-free networks. From results of numerical simulations, we conclude that this routing strategy is not effective when the density of the packets increases due to the impermeability of the communication network. To avoid this undesirable problem, we incorporate memory information to the routing strategy. By using memory information effectively, packets are spread into the communication networks, achieving a higher performance than conventional routing strategies for various network topologies, such as scale-free networks, small-world networks, and scale-free networks with community展开更多
基金supported by the National Natural Science Foundation of China(Grant No.60532060)the National Key Lab.of Space Microwave Technique Foundation(Grant No.514730201).
文摘Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit （LEO） satellite constellations have attracted great interests because of their short round-trip delays and wide bandwidths. A challenging problem is to develop a simple and efficient packet routing algorithm for the LEO satellite constellation network. This paper presents a SpiderWeb Topological Network （SWTN） and a distributed packet routing algorithm for the LEO satellite constellation network based on the SWTN. The algorithm gives the minimum propagation delay paths with low computational complexity and requires no routing tables, which is practical for on-board processing. The performance of the algorithm is demon- strated through simulations.
文摘We demonstrate the routing operation of optical packets by an optical packet switch consisting of an optical digital-to-analog conversion-type header processor, a wavelength converter using an electrically-tunable laser, and an arrayed-waveguide grating router. A packet transfer by two-bit optical header was achieved for the first time.
文摘A WDM compatible Edge-to-Edge Self-Routed optical packet switched network that simplifies the optical processing is proposed. The system employs all-optical packet label generation and recognition using coded superstructured Fiber Bragg gratings.
文摘Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.
文摘Multi-protocol label switching（MPLS） has the advantage of high efficiency in the second layer, which improves the performance of data packets routing. In this paper, a new structure to implement optical MPLS is proposed. We construct a code family for spectral-amplitude coding（SAC） labels in the optical MPLS networks. SAC labels are suitable for optical packet switching because they can be constructed and recognized quickly at each router. We use the label stacking to provide hierarchical routing to avoid swapping labels at each forwarding node and reduce system complexity. However, the phase-induced intensity noise（PIIN） appears due to the incoherent property of the light source when the stacked labels set makes the correlation decoding with the local node label,which degrades system performance.
文摘In this paper, we propose a new packet routing strategy that incorporates memory information for reducing congestion in communication networks. First, we study the conventional routing strategy which selects the paths for transmitting packets to destinations using the distance information and the dynamical information such as the number of accumulating packets at adjacent nodes. Then, we evaluate the effectiveness of this routing strategy for the scale-free networks. From results of numerical simulations, we conclude that this routing strategy is not effective when the density of the packets increases due to the impermeability of the communication network. To avoid this undesirable problem, we incorporate memory information to the routing strategy. By using memory information effectively, packets are spread into the communication networks, achieving a higher performance than conventional routing strategies for various network topologies, such as scale-free networks, small-world networks, and scale-free networks with community
