To accommodate an increasing amount of traffic efficiently, elastic optical networks (EON) that can use optical spectrum resources flexibly have been studied. We implement multi-path routing in case we cannot allocate the spectrum with single-path routing. However, multi-path routing requires more guard bands to avoid interference between two adjacent optical paths when compared with single-path routing in EON. A multi-path routing algorithm with traffic grooming technology has been proposed. The researchers assumed that a uniform modulation level was adopted, and so they did not consider the impact of path length on the resources needed. In this paper, we propose a multi-path routing method with traffic grooming considering path lengths. Our proposed method establishes an optical multi-path considering path length, fiber utilization, and the use of traffic grooming. Simulations show we can decrease the call-blocking probability by approximately 24.8% in NSFNET. We also demonstrate the effectiveness of traffic grooming and the improvement in the utilization ratio of optical spectrum resources.

A new mobility management architecture is proposed to optimize end-to-end routes for mobile nodes (MNs) and mobile routers (MRs) within a nested mobile network environment. By applying local network mobility management mechanisms based on Hierarchical Mobile IPv6 (HMIPv6) to a mobile network, the proposed approach can optimize the route to the mobile network effectively. Combining the proposed route optimization methods and HMIPv6 functionality can enable it to provide more effective route optimization, reducing the burden of location registration for handovers. A route optimization method for local fixed nodes in a mobile network has also been developed by adding proxy mobile node and correspondent node functions to the MRs. Numerical evaluations on mean route length and traffic routed through network nodes demonstrate the effectiveness and applicability of the proposed methods especially in large-scale networks.

In this paper, we comparatively evaluate two photonic packet switch architectures with WDM-FDL buffers for synchronized variable length packets. The first one is an output buffer type switch, which stores packets in the FDL buffer attached to each output port. Another is a shared buffer type switch, which stores packets in the shared FDL buffer. The performance of a switch is greatly influenced by its architecture and a packet scheduling algorithm. We compare the performances of these two packet switches by applying different packet scheduling algorithms. Through simulation experiments, we show that each architecture has a parameter region for achieving better performance. For the shared buffer type switch, we found that void space introduces unacceptable performance degradation when the traffic load is high. Accordingly, we propose a void space reduction method. Our simulation results show that our proposed method enables to the shared buffer type switch to outperform the output buffer type switch even under high traffic load conditions.

In emergency situations, telecommunication networks become congested due to large numbers of call requests. Also, some infrastructure breaks down, so undamaged communication resources must be utilized more efficiently. Therefore, several lines in telephone exchanges are generally reserved for emergency calls whose users communicate crucial information. The number of lines reserved for emergency calls is determined by a threshold, on a trunk reservation control method. To accept both required emergency calls and more general calls, the traffic intensity of arriving emergency calls should be estimated in advance, and a threshold should be configured so that the number of reserved lines becomes lower than the estimation. Moreover, we propose that the holding time for general calls should be positively limited. By guaranteeing the holding time sufficient for communicating essential information, holding time limitation reduces long-period calls so more general calls are accepted. In this paper, we propose a new CAC method to utilize undamaged communication resources more efficiently during emergencies. Our proposed method accepts more general calls by collaboratively relaxing the threshold of trunk reservation and limiting holding time of general calls. This method is targeted at not only the telephone exchange but also various systems on networks, e.g. base stations of the wireless network or SIP servers. With our method, the threshold is configured in consideration of the ratio of traffic intensities estimated in advance. We modeled the telephone exchange as a queueing loss system and calculated call-blocking rates of both emergency and general calls by using computer simulation. The comparison with the conventional holding time limitation method showed that our proposed method accepts the required number of emergency calls by appropriately relaxing the threshold, while suppressing the increase in call-blocking of general calls.

Admission control is becoming an essential technique for IP networks to provide full-fledged multimedia streaming services. Although signaling-based schemes are utilized to achieve this, these are difficult to deploy and can hardly achieve strict admission control taking the properties of packet arrival into consideration. In this paper, we propose a novel admission control strategy called the Tentative Accommodating and Congestion Confirming Strategy (TACCS). The main idea is to accommodate incoming flows tentatively and confirm congestion after a certain period. Since tentative accommodating enables us to generate the same situation as where incoming flows have been accommodated, TACCS makes it possible to control admission considering the properties of packet arrival after they have been accommodated, without collecting resource information in advance. From the results of mathematical analysis, we confirmed that TACCS enabled a domain to control admission without a centralized management agent and we provided guidelines for configuring parameters of TACCS.

In this paper, we propose path accommodation methods for unidirectional rings based on an optical compression time-division multiplexing (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames, in order to allocate all paths among nodes. Three path accommodation algorithms for the all-optical access are next proposed to achieve the lower bound as closely as possible. Path splitting is next considered to improve the traffic accommodation. Finally, we analyze the packet delay time for given numbers of slots/frames, which are decided by our proposed algorithms. Numerical examples are also shown to examine the effectiveness of our proposed algorithms including path accommodation and path splitting methods.

Optical Code Division Multiplexing (OCDM) is a multiplexing technology for constructing future all-optical networks. Compared with other multiplexing technologies, it can be easily controlled and can establish lightpaths of smaller granularity. However, previous research has revealed that OCDM networks are vulnerable to cycle attacks. Cycle attacks are caused by multi-access interference (MAI), which is crosstalk noise on the same wavelength in OCDM networks. If cycle attacks occur, they disrupt all network services immediately. Previous research has proposed a logical topology design that is free of cycle attacks. However, this design assumes that path assignment is centrally controlled. It also does not consider the delay between each node and the centralized controller. In this paper, we propose novel logical topology designs that are free of cycle attacks and methods of establishing paths. The basic concepts underlying our methods are to autonomously construct a cycle-attack-free logical topology and to establish lightpaths by using a distributed controller. Our methods can construct a logical network and establish lightpaths more easily than the previous method can. In addition, they have network scalability because of their distributed control. Simulation results show that our methods have lower loss probabilities than the previous method and better mean hop counts than the centralized control approach.

AF service class in Diffserv by realizes minimum bandwidth guarantee with the use of differentiated drop precedence property marked on each packet. In the context of a multiple domains environment, however, QoS of individual flow is not always preserved due to the re-marking behavior forced at the domain boundaries. Focusing on this point, this paper proposes new packet re-marking schemes that can improve the per-flow QoS of AF service traversing multiple domains. The basic concept of the schemes distinguishes packets re-marked to out-of-profile at the domain boundaries from those already marked as out-of-profile at the time of entering the network, and allows the re-marked packet to recover back to in-of-profile, thus regaining its rightful QoS within the networks. The performance of the proposed schemes is evaluated through simulation. The results on UDP flows show the effectiveness of the proposed schemes for reducing packet losses on the flow through multiple domains and preserving fairness between flows. Simulations on TCP flows show that the proposed schemes improve the throughput of the flows through multiple domains. The proposed scheme is especially effective on the transfer time of short TCP flows such as Web traffic, whose throughput is affected more seriously by a single packet loss due to its flow control mechanisms.

In this paper, we term multimedia streaming application traffic "stream flows" and the other usual application traffic "non-stream flows." Many problems occur when both flows are aggregated on a shared link because the different TCP and UDP behaviors cause negative interactions. One way to solve these problems is to isolate stream and non-stream flows to different classes. However, it is difficult to determine the bandwidth allocation for each class and dynamic bandwidth allocation schemes are hard to implement on large scale networks. We therefore propose a dynamic class assignment method that maintains the QoS and that has a higher scalability than dynamic bandwidth allocation schemes. It is workable on Diffserv AF PHB. The outline is as follows. We classify non-stream flows into four classes and dynamically assign stream flows to the classes, taking the conditions and characteristics of the classes into consideration. On assigning classes to stream flows, we map them to a higher drop precedence than non-stream flows not to degrade the QoS of them, based on the assumption that occasional packets being dropped do not create serious problems for them. In this paper, we first discuss our classification of non-stream flows, and present the characteristics of non-stream flows in each class. We then discuss our drop precedence mapping. After this, we propose an algorithm for our method of dynamic class assignment and provide some simulation results where it could provide constant qualities with stream and non-stream flows, adapting to changing traffic.