Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic enviro...

Most telecommunication systems are dynamic in nature. The state of the network changes constantly as new transmissions appear and depart. In order to capture the behavior of such systems and to realistically evaluate their performance , it is essential to use dynamic models in the analysis. In this thesis, we model and analyze networks carrying elastic data traffic at flow level using stochasti...

Software-defined networking (SDN) provides programmable control and centralized management in data centers, making it a popular architecture. The large scale of networks has required to propose the geographical distribution logically plane achieve scalability reliability. For solving load imbalance among multiple controllers associated with statically configured plane, switch migration mechanis...

This paper describes an empirical investigation into the nature of challenge within the context of flow or effortless attention. An important condition of the flow state is that the challenges of the task are commensurate with the person’s level of skill. However when considering movement interaction those challenges could be composite in the sense that they could comprise physical as well as i...

This paper presents Flow-Aware Routing Protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balanc...

In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving...

Computation tasks used in digital design flow for test quality evaluation can require a lot of processor and memory resources. To speed up execution and to overcome memory restrictions, a collaborative computing approach was proposed in this paper. Web-based system architecture allows seamlessly aggregate many remote computers for one application. Efficient collaboration requires credit based p...

The aim of information lifecycle management is to develop a cost‐effective strategy for maintaining information assets, balancing the cost of maintaining information against business value. This paper contributes to development of theoretical information value based on a classification scheme that does not consider operational factors (e.g., storage, access). It concentra...

In this work, we introduce a furnace-balancing scheme that generates an optimal furnace-side feed distribution that has the potential to improve the thermal efficiency of a reformer. The furnace-balancing scheme is composed of four major components: data generation, model identification, a model-based furnace-balancing optimizer and a termination checker. Initially, a computational fluid dynami...

Wireless mesh networks (WMNs) face several challenges such as architectural design and network protocol design issues. The capacity of WMNs is very limited, such as the result in an available singlechannel bandwidth system compared to a multi-channel system. Two problems affect the capacity of mesh networks; i.e. load balancing and interference. To support the mesh network infrastructure, it is...