KEYWORDS: Data acquisition, Data modeling, Point spread functions, Data processing, Industry, Binary data, Analytical research, Process modeling, Associative arrays, Target acquisition
With the continuous advancement of digitization across various industries, the demand for data has significantly increased, making data production a critical component in different industry production chains. Throughout different stages of digitalization, there exists a considerable variance in the degree of automation in data acquisition. Human-assisted data acquisition (HADA) processes, such as complex image recognition, extraction of unstructured textual data, and recording of data in traditional production scenarios, often incur higher acquisition costs. The understanding of data acquisition costs holds great significance in making optimal resource allocation decisions to acquire high quality data for subsequent applications during industry digitalization processes. This paper, based on Cost of Quality (CoQ) and Performance Shaping Factor (PSF) theories, proposes a universal cost analysis framework model for general human-assisted data acquisition processes. We contend that there exists a trade-off relationship between data quality and labor cost in human-assisted data acquisition processes. Furthermore, we take dietary data acquisition as an example and conduct a quantitative analysis of the trade-off relationship between data quality and labor cost using the proposed framework.
Optical circuit-switched networks can offer end-to-end dedicated connection with high-capacity bandwidth for largescale
applications, but end-systems' performance in these applications often becomes the bottleneck of bulk data transfer
in ultra-high-speed network. We propose a bandwidth scheduler based on the end-systems' effective transfer rate and
study its performance through experiment.
Reliable service delivery becomes more significant due to increased dependency on electronic services all over society
and the growing importance of reliable service delivery. As the capability of PON increasing, both residential and
business customers may be included in a PON. Meanwhile, OPEX have been proven to be a very important factor of the
total cost for a telecommunication operator. Thus, in this paper, we present the partial protection PON architecture and
compare the operational expenditures (OPEX) of fully duplicated protection and partly duplicated protection for ONUs
with different distributed fiber length, reliability requirement and penalty cost per hour. At last, we propose a
differentiated protection method to minimize OPEX.
A very important issue in executing a scientific workflow in optical grid is how to map the workflow tasks onto multiple
distributed resources. In this paper, we propose a new cost-based workflow scheduling algorithm (MCBS) which tries to
minimize the cost of the workflow execution while meeting the deadline defined by users. The simulation results prove
the efficiency of the MCBS algorithm.
An enhanced dynamic wavelength and bandwidth allocation (DWBA) algorithm in hybrid WDM/TDM PON is proposed
and experimentally demonstrated. In addition to the fairness of bandwidth allocation, this algorithm also considers the
varying propagation delays between ONUs and OLT. The simulation based on MATLAB indicates that the improved
algorithm has a better performance compared with some other algorithms.
Since the underlying demand for network capacity can be satisfied only by extremely increasing transmission bit rate,
processing speed, and switching capacity, it definitely will lead to increased power consumption of network nodes.
Energy crisis is global crisis nowadays and it has brought up many problems. Power consumption is becoming a crucial
issue in designing high-performance network devices. This paper studies the power consumption model of a kind of
Optical Packet Switching (OPS) node based on Semiconductor Optical Amplifiers (SOA). Our results show that by
dynamically adjusting the bias current of SOAs, the power consumption on an OPS node can be reduced considerably,
especially when the traffic distribution across multiple ports is not balanced and inter-nodal distances vary. The total
electrical power consumption can be cut off significantly. We also show the power consumption can be further reduced
by jointly optimizing the thermoelectric cooler current.
A cost-effective and service-differentiated provisioning strategy is very desirable to service providers so that they can
offer users satisfactory services, while optimizing network resource allocation. Providing differentiated protection
services to connections for surviving link failure has been extensively studied in recent years. However, the
differentiated protection services for workflow-based applications, which consist of many interdependent tasks, have
scarcely been studied. This paper investigates the problem of providing differentiated services for workflow-based
applications in optical grid. In this paper, we develop three differentiated protection services provisioning strategies
which can provide security level guarantee and network-resource optimization for workflow-based applications. The
simulation demonstrates that these heuristic algorithms provide protection cost-effectively while satisfying the
applications' failure probability requirements.
This paper studies the problem of the implementation of distributed computing applications in local area networks. We
propose a novel Dynamical Wavelength Scheduled Wavelength Division Multiplexing Passive Optical Network (WDMPON)
architecture, in which the number of the available upstream wavelength channels is greatly less than that of optical
network units (ONU). And we experimentally demonstrate the feasibility of the proposed WDM-PON, which enables
dynamically scheduling upstream data in the time division multiplexing (TDM) and WDM scheme from ONU to
optical line terminal (OLT). The Time-Wavelength Co-Allocation (TWCA) Problem is defined in the proposed WDMPON
architecture to aggregate large files for distributed computing applications and three scheduling algorithms are
presented to solve this problem. The significant improvement compared with the conventional TDM-over-WDM PON is
illustrated through simulations.
Optical Grid has been thought as a promising technology to support large-scale data-intensive distributed applications. For such a system with so many heterogeneous resources involved, faults seem to be inevitable. A fault in Optical Grid may lead to the failure of the application. Therefore, fault-tolerant policies are necessary to improve the performance of Optical Grid and satisfy the SLA requirements of the applications. In this paper, we propose several fault-tolerant policies for Optical Grid. The performances of different polices are compared by simulation.
These days while the traditional Internet cannot meet the requirement of data-intensive communications in large scale escience
grid applications, Optical network which is also referred to as Lambda Grid provide a simple means of achieving
guaranteed high bandwidth, guaranteed latency and deterministic connection. Lots of e-science applications like e-VLBI
and GTL require aggregating several hundred GB data files from distributed databases to super-computers frequently at
real time. Thus minimizing the aggregation time can improve the overall system performance. We consider the problem
of aggregating large data files from distributed databases to distributed computational resources on lambda grid. We
modify the model of Time-Path Scheduling Problem (TPSP) which has been proposed and propose a new N-destination
TPSP (NDTPSP) model. We present the proof of NDTPSP's NP-completeness. We also propose a list scheduling
algorithm and a modified list scheduling algorithm for our problem. The performance of different algorithms will be
compared and analyzed by simulations.
Optical grids can integrate geographically distributed resources more efficiently to support applications because of characteristics of optical networks. The essential aspect of optical grid applications is scheduling. By scheduling, multiple optical grid applications from different users can be executed on one optical grid. This means multiple users can use one optical grid simultaneously. In this paper, we propose three new algorithms for the scheduling of multiple optical grid applications onto one optical grid, and one algorithm among these three can make the scheduling order dynamic. In these algorithms, communication contention has been incorporated into scheduling, and arrival time of multiple optical grid applications is assumed to abide by Poisson distribution to simulate multiple users. Our objects of scheduling are not only to make scheduling span short, but also to achieve low unfairness. Impacts of different algorithms are comparatively investigated by simulations.
In today's distributed computing systems, a large amount files contain huge data need to be transferred to their
destination as soon as possible or else the quality of these systems will be seriously affected, and these transfer requests
arrived dynamically. We propose some effective heuristic algorithm to this problem with the purposes of minimizing the
maximal file transmitting time, and we can get some primal results from the algorithm. However, as we known, the
problem of routing and scheduling for the dynamic arriving files in the optical network has a large number of constrains
and the exact solution is computationally expensive, so it is hard to get the optimal result about this problem and we can
not know whether the heuristic results is good or how closed it closed to its optimal result. In order to get some more
detail results, we apply the approach called Lagrangian relaxation combined with subgradient-based method and utility
the heuristic result to compute the lower bound of the optimal solution, and we consider the optimal target of minimizing
the maximal file transmitting complete time for it's an important aspect with the file transmitting problem.
We mainly use Lagrangian relaxation (LR) to research the dynamical lager file transmitting problem. Firstly, in order to
apply the LR method we formulation our dynamic file routing scheduling and distributing problem in WDM optical
network into mathematic model with some corresponding constraints. Secondly, change the formulation with some
added variables to let it more suitable for LR and then introduce the Lagrangian multipliers into the model to obtain the
Lagrangian function. With this function we can divided it into some small independent problems that could let it be
solved more easily and at last we utilize the result received from the heuristic algorithm to solve the Lagrangian
multiplier problem with subgradient-based method in order to getting the sharpest possible lower bound.
With the comparison of our simulation results, we can prove that the Subgradient algorithm based on LR can get better
results of the file transmitting time than the heuristic algorithm, and with the theorem of Lagrangian Bounding Principle
we can know that value of LR method is a lower bound on the optimal value.
Optical grid, the integrated computing environment based on optical network, is expected to be an efficient
infrastructure to support advanced data-intensive grid applications. In optical grid, the faults of both computational and
network resources are inevitable due to the large scale and high complexity of the system. With the optical network
based distributed computing systems extensive applied in the processing of data, the requirement of the application
failure probability have been an important indicator of the quality of application and an important aspect the operators
consider. This paper will present a task-based analysis method of the application failure probability in optical grid. Then
the failure probability of the entire application can be quantified, and the performance of reducing application failure
probability in different backup strategies can be compared, so that the different requirements of different clients can be
satisfied according to the application failure probability respectively. In optical grid, when the application based DAG
(directed acyclic graph) is executed in different backup strategies, the application failure probability and the application
complete time is different. This paper will propose new multi-objective differentiated services algorithm (MDSA). New
application scheduling algorithm can guarantee the requirement of the failure probability and improve the network
resource utilization, realize a compromise between the network operator and the application submission. Then
differentiated services can be achieved in optical grid.
In this paper we proposed a Max-Flow Oriented Algorithm (MFOA) to achieve the shortest finish time in Time-Path
Scheduling Problem (TPSP). The signification of our algorithm is that it combines both benefits of the Max-Flow
algorithm and heuristic algorithms, so we can achieve a better result with lower time cost. Another feature of our
algorithm is that all the data on the same node in the network can be considered as a single merged data, so the time cost
is mainly depended on the network topology and the task numbers will not affect the time cost much. This feature makes
our algorithm suitable for large scale applications. In this paper we figured out the relationship of Max-Flow routing and
our objective: shortest finish time, and how the Max-Flow theoretic helps to achieve it. We also build the mathematical
model of our MFOA with Max-Flow Oriented Scheduling (MFOS) rerouting strategy. To investigate the performance of
our algorithm, we compare it with existing optimization algorithm and algorithms with 4 other heuristic rerouting
strategies. Based on the results of simulations on different topologies, our algorithm is best in most of the situations.
Besides the method used in this paper also helps to develop more efficient algorithms.
This paper introduces a novel notion of multi-granularity and multi-connectivity circuit
switched network. Based on this notion, four routing schemes - Fixed Routing (FR), Maximum
Remain (MR), Secured Maximum Remain (SMR) and Premium/Punishment Modification (PPM)
are proposed. Numerical simulation results about the performance of these four schemes are also
presented in this paper.
Because SONET/SDH technology which includes contiguous concatenation and virtual concatenation is used in
GMPLS-Controlled Multi-services Transport Platform (MSTP) Network, it is more complex when we consider the label
assignment when setting up a Label Switch Path (LSP). It is very imperative to use a method which could use the
limited labels effectively. In this paper, we study the structure of the label space and different label algorithm to allocate
SONET/SDH labels, which include virtual concatenation labels and contiguous concatenation labels in GMPLS-Controlled
MSTP Network. We proposed a minimum Contiguous Labels Algorithm (min-CLA) to solve the problem of
using the limited label space on each interface at the most degree. Different from the previous schemes worked on
Route Wavelength Assignment (RWA) in the Wavelength-Division-Multiplex (WDM) networks, our scheme finds out
the primary and easy method based on SONET/SDH label which has virtual concatenation labels and contiguous
concatenation labels used for different kinds of needs. Because of taking the multiple services requirements into
account, the proposed algorithm finds out more efficient feasible solution requiring less network resources and even find
a feasible solution which will enable some label assignment failed in other label assignment algorithm and we will
compare our scheme and the Fist Fit Scheme.
Network traffic grows in an unpredictable way, which forces network operators to over-provision their backbone
network in order to meet the increasing demands. In the consideration of new users, applications and unexpected failures,
the utilization is typically below 30% [1]. There are two methods aimed to solve this problem. The first one is to adjust
link capacity with the variation of traffic. However in optical network, rapid signaling scheme and large buffer is
required. The second method is to use the statistical multiplexing function of IP routers connected point-to-point by
optical links to counteract the effect brought by traffic's variation [2]. But the routing mechanism would be much more
complex, and introduce more overheads into backbone network. To exert the potential of network and reduce its
overhead, the use of Valiant Load-balancing for backbone network has been proposed in order to enhance the utilization
of the network and to simplify the routing process. Raising the network utilization and improving throughput would
inevitably influence the end-to-end delay. However, the study on delays of Load-balancing is lack. In the work presented
in this paper, we study the delay performance in Valiant Load-balancing network, and isolate the queuing delay for
modeling and detail analysis. We design the architecture of a switch with the ability of load-balancing for our simulation
and experiment, and analyze the relationship between switch architecture and delay performance.
Many distributed computing applications need transfer large files between distributed locations as fast as possible. A
dynamic routing algorithm for optical network is designed to modify existing transfers and spare network resources for
new request to satisfy both old and new transfers' requirements. In data intensive application on circuit-switch optical
network, light-path resources are scarce and there should be concurrent file transfers competing for the same fibers. In
static routing optical network, if new coming file transfer cannot acquire light-path with enough bandwidth, it could only
wait for the releasing of current used resources. Due to the waiting, the delay time will be large. So we use our dynamic
routing algorithm to schedule and modify existing light-paths, to spare a light-path with enough bandwidth for new
coming file. Our optimized target is to make every file finish transferring in less time, so we propose two objectives
defined in the paper: one is to make maximal delay time of all tasks less and the other is to make average delay time less.
The algorithm proposed has two mainly steps: 1) Routing process; 2) Dynamic routing process. In routing step, when
task of file arrives we firstly get k random paths, then use Least Congestion Algorithm (LCA) (or Shortest Path
Algorithm (SPA)) to get the primary path P1 of maximal residual bandwidth (RB) from k paths and the alternate path P2
of the second maximal RB. If the bandwidth of P1 is enough for this task, transfer the file in P1 path. If not, we go to the
dynamic routing process. In the second process, get all the links of P1 then we change the existing light paths of tasks in
the P1 path one by one to their alternative paths until we can get enough bandwidth of P1. In the dynamic routing
process, we design two different queuing strategies. The first strategy is First Arrive First Modified (FAFM) strategy,
namely we schedule the first arrival task firstly. The other is Larger Bandwidth First Modified (LBFM) and the file with
larger bandwidth is scheduled firstly.
By comparison of simulation results, we can prove that our two kinds of dynamic routing algorithms can get better
results for both decreasing maximal delay time and average delay time than LCA and SPA routing algorithms. In the two
queuing strategies, LBFM can get better results than FAFM strategy. The receivers in the destinations can get better
results by using our dynamic routing algorithm.
With the increasing number of internet users, more and more real-time services are added into the network, such as IPTV,
online-video, Voice over IP, etc. As we know, throughput is a highly important performance criterion for scheduling
algorithms of networks. Besides throughput, these growing real-time services are very sensitive to delay variance termed
as jitter. Therefore, high performance scheduling algorithm should achieve good performance in terms of throughput,
delay, jitter and fairness together. Scheduling algorithm with deadline-awareness employed in packet switching plays a
key role in QoS guarantees.
Although traditional hard-deadline can provide guarantee on in-node delay-deadline criteria, the end-to-end
delay-deadline criteria cannot be guaranteed due to the characteristic of hard-deadline, while the delay-deadline
guaranteed throughput is low. Thus, soft-deadline scheduling algorithm has been proposed. In this paper, we investigate
and compare the classical hard-deadline and soft-deadline switching algorithm. A new scheme "Bonus System" is
proposed in order to realize the idea of soft-deadline switching algorithm. Bonus System based on soft-deadline is
compared with classical Early-Deadline First scheme based on hard-deadline, which shows that Bonus System has better
performance in End-to-End deadline guarantee.
This paper describes the Task Scheduling problem over Ethernet Virtual Connections which provides multiple-granularity
and the problem of scheduling tasks over two user network interfaces is considered. Three approximate
models, 2SP, 2LSP and BWS are proposed with algorithms respectively. Numerical simulation results and comparisons
are also presented.
In the IPTV systems, multicasting will play a crucial role in the delivery of high-quality video services,
which can significantly improve bandwidth efficiency. However, the scalability and the signal quality
of current IPTV can barely compete with the existing broadcast digital TV systems since it is difficult
to implement large-scale multicasting with end-to-end guaranteed quality of service (QoS) in
packet-switched IP network. China 3TNet project aimed to build a high performance broadband trial
network to support large-scale concurrent streaming media and interactive multimedia services. The
innovative idea of 3TNet is that an automatic switched optical networks (ASON) with the capability of
dynamic point-to-multipoint (P2MP) connections replaces the conventional IP multicasting network in
the transport core, while the edge remains an IP multicasting network. In this paper, we will introduce
the network architecture and discuss challenges in such IP over Optical multicasting for video delivery.
Optical grid is expected to be an efficient infrastructure to support advanced data-intensive grid applications. In
optical grid, the faults of both computational and network resources are inevitable due to the large scale and high
complexity of the system. Even though many researches have been published on fault-tolerance policy for either grid
system or optical network, but few works have been done to consider fault-tolerance when faults may happen in grid
system and optical networks. In this paper, we address to the fault-tolerance problem in optical grid system and
propose a rescheduling policy to handle both computational resources and network resources faults. Simulation
results prove that our policy achieves better performance.
Facing the evolvement of the Optical Grid technology, dynamic task scheduling can largely improve the efficiency of
the Grid environment under the real circumstances. We propose a Serve On Time (SOT) algorithm - based on the idea
of combining all the dynamic multi tasks so that all the tasks will obtain the rights to be served as soon as possible. We
then introduce the basic First Come First Serve (FCFS) algorithm. A simulation will show the advantage of SOT.
In switch scheduling, jitter becomes an important performance criterion for increasing real-time applications. Low Jitter
Decomposition (LJS) was proposed in the frame-based scheduling switches [9]. However, we notice that in LJS, the
bandwidth requirement of schedule tables is greater than the actual amount of traffic. The redundant bandwidth
requirement not only wastes the resource of switch, but also introduces an extra jitter.
In this paper, we propose two algorithms to reduce the extra jitter caused by redundancy: Integer Average Redundancy
Control (IARC) and Dichotomy Sequence Redundancy Control (DSRC). We demonstrate that the jitter bound of the two
algorithms is lower than that of the scheme without redundancy control. Simulation experiments show that DSRC and
IARC can reduce nearly 50% jitter of the scheme without redundancy control at medium switch load. We also show that
DSRC has a low complexity (O(1) for each input-output pair) which is important for high-speed switches.
As bandwidth-intensive and time-sensitive streams applications such as high-definition television (HDTV) get popular, there rises a demand of supporting multicast communication directly at optical layer on next-generation optical networks. The multicast-capable optical cross-connect (MC-OXCs) is the necessary device to implement multicasting at optical layer. The functional building blocks for MC-OXC are light splitters (space splitters) or multi-wavelength converters (frequency splitters). The space splitter has no wavelength conversion capability, whereas the frequency splitter has limited fanout, decreased optical signal-to-noise ratio and also is expensive. We therefore proposed a tradeoff architecture called joint multicasting capable optical cross-connect (jMC-OXC) integrating both space splitters and multi-wavelength converters. In this paper, we investigate the network performance and the physical transmission performance on the jMC-OXC architecture by dynamic simulation and experimental demonstration. Three simulation schemes are designed and the results show that the network performance of the jMC-OXCs with limited multi-wavelength converters can obtain a close performance to that with full multi-wavelength converters. A prototype of jMC-OXC is examined and its bit error rate (BER) performance is tested after passing the multi-wavelength converters.
A good dynamic routing scheme is very important to improve the provisioning efficiency of wavelength-routed optical networks. The existing dynamic routing algorithms are usually based on first-come-first-serve (FCFS) scheme to process the lightpath requests one by one. However, multiple lightpath requests may arrive simultaneously and burstly in data-intensive applications, and can not be treated efficiently by using the FCFS scheme. We will propose a new online dynamic routing scheme to process the lightpath requests in batch instead of one by one, which is termed batch-come-batch-serve (BCBS) scheme. A mathematic model and several adaptive routing algorithms are proposed and investigated comparatively. The simulation results suggest that the proposed scheme achieves better network blocking performances.
Existing multicast models have taken traffic concentration, source-end delay, delay jitter into consideration, while some
dynamic application like digital TV delivery poses a new challenge. Users can join/leave multicast group dynamically
and arbitrarily. When users have left the multicast group, multicast protocols will delete the corresponding delivery edge
in the multicast tree. This leads to great control overhead in delivery network. This overhead comes from several aspects,
like forwarding tree maintain, update, membership management. Even if the multicast tree is pre-calculated and cannot
delete edge in runtime, the users' leaving action can lead to resource utilization problem, especially when the delivery
network's bandwidth is expensive. In this paper we designed an algorithm to find the optimized multicast tree to ensure
stability of network under dynamic user behavior. With this algorithm, we can smooth out effect of users' random
behavior, thus increase performance of the delivery network.
The multicast capability of a multicast-capable optical add/drop multiplexer (MC-OADM) is analyzed and the dynamic network performance on the WDM ring employing such MC-OADMs is investigated. The MC-OADM multicast scheme can provide more multicast services while consume less resources in comparison with that of the normal OADM ring without multicast capability.
Because any link failure on the multicast session may disrupt the signal transmission to several downstream nodes, it is imperative to effectively protect the multicast sessions against link failure. In this paper, we study schemes for establishing primary and backup multicast trees for multicast sessions in a optical mesh network against link failure, e.g., fiber or conduit cut, with taking the different leaf availability requirement and availability guarantee into account. We propose an Mixed Integer Linear Program (MILP) approach to solve the problem of provisioning survivable multicast sessions with differentiated leaf availability guaranteed. Different from the previous schemes, our scheme finds out the complete (the tree spans the root and all the leaf nodes) primary and complete or incomplete (the tree spans the root and part of the leaf nodes) backup trees for multicast sessions guarantees the availability requirement. Because of taking the different leaf availability requirements into ccount, the proposed algorithm finds out more efficient feasible solution requiring less network resources, and even find a feasible solution where the previous algorithms fail.
Some grid applications need a reliable, real-time and large bandwidth network as infrastructure for mass data exchange between local and remote resources. Deploying grid applications on the optical network has a great significance. In this article, we propose the network architecture that integrates optical network with grid computing resources. Based on the network architecture, we present a model of service interface for grid over ASON.
Optical Grid that provides a way to integrate the geographical distributed resources for large-scale grid applications. This
paper mainly focuses on the task scheduling issue in Optical Grid and proposes two task scheduling algorithms to minimize
the total time or scheduling length required for a given task. A simulated optical grid has been addressed to demonstrate
the effectiveness of the scheduling approach. The performance tests and analysis of the two algorithms are investigated
to show the effect of the routing policy on the scheduling length. A more flexible policy is able to further improve
scheduling length.
We propose a more practical resource model for optical grid applications by extending the classic list scheduling algorithm to achieve communication contention aware scheduling of optical grid applications. An effective adaptive routing scheme is also proposed to improve the performance of the extended list scheduling. The impacts of different routing schemes on the extended list scheduling are comparatively investigated by simulations.
We analyze the multicast capability of a multicast-capable optical add/drop multiplexer (MC-OADM) and investigate the dynamic network performance of the MC-OADM ring in comparison with that of the normal OADM ring without multicast capability. The simulation results show that the multicast scheme using MC-OADMs provides more multicast services and occupies fewer resources.
Multicast applications have attracted more and more attention due to more efficient bandwidth usage and the increasing popularity of the point-multipoint multimedia applications. Optical multicasting outperforms the electronic multicasting in some aspects. Service level agreement (SLA) and quality of service (QoS) are important to service providers and users. Service providers always first maximize revenue to accept as many as connection requests as possible and then to minimize the capacity of all accepted connection. In this paper, the problem of cost-effective optical multicasting connection provisioning to satisfy the connections' availability requirements on a given physical topology is formally stated. We propose a mixed integer linear program (MILP) based approach for static multicast traffic. The feature of our algorithm lies on without considering any protection schemes, and when the system adapts dedicated protection or the sharing protection, the problem is more complicated.
The emerging broadband real-time streams applications require the supporting networks to provide multicasting communication at optical layer. The multicasting capable optical cross-connect (MC-OXCs) is the necessary device to implement multicasting at optical layer. The functional building blocks for MC-OXC are light splitters, which can be space splitters or multiwavelength converters (frequency splitters). The space splitter has no wavelength conversion ability, while the frequency splitter has limited fanout, decreased optical signal-to-noise ratio and also is expensive. We proposed a tradeoff architecture called joint multicasting capable optical cross-connect (jMC-OXC) integrating both space splitters and frequency splitters in our previous work. This paper further studies the network performance in terms of member blocking ratio for the jMC-OXC architecture. Three simulation schemes are designed and the results show that the network performance of the jMC-OXCs with limited frequency splitters can obtain a close performance to that with full frequency splitters.
Automatic Switched Optical Networks, or ASON, is regarded as one promising networking technology for future optical networks. From network operators' perspective, it is well agreed that ASON should provide the following features: fast provisioning, easier network operation, higher network reliability, scalability, simpler planning and design, and multi-vendor inter-operability. Fast provisioning enables ASON to meet the requirements of more dynamic applications such as bandwidth on demand and content distribution. Protection and restoration is crucial because of the extremely high data-rate the network will carry. Mesh type network and fast provisioning capability leave more space for a more reliable and flexible network.
Unlike traditional transport networks that are constructed purely for point-to-point connectivity, ASON deployed in regional or metro-area networks needs to provide high connectivity to its clients. And, as a result, the planning and designing problem becomes very complex due to the large number of devices, the variety of interface types and network protocols. It is also important that the network will be able to inter-connect devices from different vendors and provide support to different client signals such as SONET/SDH, Ethernet, IP, ATM and Frame Relay.
Multicast protection strategies have been widely explored in current literature. However, the leaf availability requirements are not taken into account. In this paper, we investigated approaches and algorithms for establishing a multicast session with differentiated leaf availability requirements in WDM mesh network while protecting it against single link failure. An effcient and cost-effective heuristic is presented to solve the problem and is compared with two other schemes, one with no protection (Scheme I) and the other with dedicated protection (Scheme II). We also formulated a possible improvement of the proposed algorithm. Simulation results based
on 14 node NSFNET topology and comparisons among these schemes are also discussed. The performance of an algorithm is measured in terms of Average Cost and Average Satisfaction Ratio. The improved algorithm shows much better performance than the other ones, thus achieving the goal of effectively establishing protected multicast sessions with differentiated destination availability requirements. Finally, through numerical simulation results, we find that some links are critical to the performance of the network. Increasing the availability and capacity of these links will greatly enhance the network performance. This result is helpful to network planning
and design.
This article presents an FPGA-based Dynamic Multicasting emulator for Wide-Area Transport Networks. We setup overlay prototype network environment based on the emulator and compare the performance of pure IP multicasting and Layer 2 multicasting.
This paper provides an overview of prototyping research activities of automatically switched optical networks and transport networks (ASONs/ASTNs) in China. In recent years, China has recognized the importance and benefits of the emerging ASON/ASTN techniques. During the period of 2001 and 2002, the national 863 Program of China started the preliminary ASON research projects with the main objectives to build preliminary ASON testbeds, develop control plane protocols and test their performance in the testbeds. During the period of 2003 and 2004, the 863 program started ASTN prototyping equipment projects for more practical applications. Totally 12 ASTN equipments are being developed by three groups led by Chinese venders: ZTE with Beijing University of Posts and Telecommunications (BUPT), Wuhan Research Institute of Posts and Telecommunication (WRI) with Shanghai Jiao Tong University (SJTU), and Huawei Inc. Meanwhile, as the ASTN is maturing, some of the China’s carries are participating in the OIF’s World Interoperability Demonstration, carrying out ASTN test, or deploying ASTN backbone networks. Finally, several ASTN backbone networks being tested or deployed now will be operated by the carries in 2005. The 863 Program will carry out an ASTN field trail in Yangtse River Delta, and finally deploy the 3TNET. 3TNET stands for Tbps transmission, Tbps switching, and Tbps routing, as well as a network integrating the above techniques. A task force under the “863” program is responsible for ASTN equipment specifications and interoperation agreements, technical coordination among all the participants, schedule of the whole project during the project undergoing, and organization of internetworking of all the equipments in the laboratories and field trials.
This paper presents a multicasting extension to OIF User Network Interface (UNI) standard, which allows dynamically setup/teardown/graft/prune a transport network multicasting tree. Transport network multicasting tree means a point-to-multipoint connection that originates from an ingress Transport Network Element (TNE) port and end at multiple egress TNE ports across the transport network for transporting user services. A global multicasting tree ID is defined to identify the transport network multicasting tree. Without addition of any new abstract messages, we just add some new attributes to existing UNI abstract messages to implement the signaling actions needed to support optical multicasting. Experimental results show the performance of our proposal under different strategy.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.