Traditionally call centres were based on circuit-switched systems. But with the advancement of communication technologies, call centres have shifted to packet-switched systems. This packet-switched system aids the cre...
详细信息
ISBN:
(纸本)9781424427079
Traditionally call centres were based on circuit-switched systems. But with the advancement of communication technologies, call centres have shifted to packet-switched systems. This packet-switched system aids the creation of virtual Call Centre Environments. The current dynamic routing algorithms used for circuit-switched systems do not fully support packet-switched virtual call centre environments. We addressed this issue in this paper by developing a new call routing algorithm capable of supporting this type of virtual environments. This was done by performing a comparison study on our hybrid routing algorithm, Enhanced Bandwidth-Delay Based routing Algorithm. Our hybrid routing algorithm was compared with a commonly used call routing algorithm known as Minimum Expected Delay. We used both analytical and simulation methods to achieve our goal of comparison study. Call centre data collected from a real-call centre was utilised to aid our model development, validation and scenario generation. The results from this study concluded that under high traffic arrival rates, systems running EBDRA outperforms MED by possessing a lower probability of delay.
In this paper we present the temporal subspace routing (TSR) technique for peer-to-peer environments that allows transparent exchange of information defined using metadata and queries based on user interests. The syst...
详细信息
ISBN:
(纸本)9781424403561
In this paper we present the temporal subspace routing (TSR) technique for peer-to-peer environments that allows transparent exchange of information defined using metadata and queries based on user interests. The system unifies generic semantic matching, routing, caching, and access control. The technique supports continuous queries that are matched against metadata profiles of remote resources. Both queries and profiles are defined as subspaces of a multi-dimensional content space. Matched objects may be downloaded or synchronized. We present a generic data structure with optimizations for matching in this environment and discuss several use cases where the system may be applied. The mechanism utilizes the covering relation between queries and profiles. This allows automatic taxonomies of downloaded profiles and queries. Our main application is peer-to-peer and ad hoc metadata-based resource and file sharing.
Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum ...
详细信息
ISBN:
(纸本)9781538680889
Efficient routing necessitates the underlying path selection algorithms to find a path that can satisfy certain Quality-of-Service (QoS) requirements of a given flow while maximizing throughput and minimizing maximum link-load. In the case of routing multiple flows at the same time, finding such multiple paths even with just the bandwidth constraint is a well-known NP-hard problem and has been widely studied in the literature as the Unsplittable Flow Problem (UFP). Unfortunately, the existing approximation and heuristic solutions suffer from excessive computation time or low performance in maximizing throughput and minimizing maximum link-load. In this paper, we propose a new effective heuristic solution to find multiple paths that can satisfy bandwidth requirements of a given set of unsplittable flows while providing better throughput and load balancing in Software Defined Networks (SDN). We demonstrate the efficiency of our heuristic using simulations.
AODV (Ad hoc On-Demand Distance Vector) routing protocol provides communication between mobile nodes with minimal control overhead and minimal route acquisition latency. It is well-known as a reactive routing protocol...
详细信息
ISBN:
(纸本)9781424440085
AODV (Ad hoc On-Demand Distance Vector) routing protocol provides communication between mobile nodes with minimal control overhead and minimal route acquisition latency. It is well-known as a reactive routing protocol along with OLSR (Optimized Link State routing). Its goal is to reduce the need for system-wide broadcasts to the furthest extent possible. To control network-wide broadcasts of RREQs, the source node uses an expanding ring search technique, which allows a search of increasingly larger areas of the network if a route to the destination is not found. In this paper, we investigate the effectiveness of this ring search scheme by comparing the number of routing messages during routing discovery procedure.
As the clock frequency rises rapidly. clock skew has acted as a more important role in synchronous circuits. In this paper, we propose a new buffered clock tree routing algorithm to prevent the influence of process va...
详细信息
ISBN:
(纸本)078037889X
As the clock frequency rises rapidly. clock skew has acted as a more important role in synchronous circuits. In this paper, we propose a new buffered clock tree routing algorithm to prevent the influence of process variations and environmental effects to clock skew. Based oil the concept of BSF (branch sensitivity factor), our algorithm manages to reduce the skew sensitivity of clock tree ill topology generation. The worst case skew due to wire width change has been estimated. and proper buffers are inserted avoiding large capacitance load. Experimental results slow that our algorithm call produce a more reliable process-insensitive clock tree, and control clock skews in their permissible range evidently.
We consider the problem of routing with guaranteed delivery in ad-hoc wireless networks using the positions of the mobile hosts. Such networks can be modeled as geometric graphs. FACE routing [4], [9] is a position-ba...
详细信息
ISBN:
(纸本)0769523757
We consider the problem of routing with guaranteed delivery in ad-hoc wireless networks using the positions of the mobile hosts. Such networks can be modeled as geometric graphs. FACE routing [4], [9] is a position-based routing algorithm for planar geometric graphs that guarantees delivery of messages without flooding control packets throughout the network. For general ad hoc networks, FACE routing can use a planar sub-graph of the original graph;many local and distributed algorithms have been proposed to extract such a planar sub-graph. However, these planarization algorithms may fail in some situations, such as when the transmission ranges are not the same, for example, due to the presence of obstacles, which in turn may cause a routing failure. In this paper, we describe a generalization of FACE routing that can guarantee delivery in planar graphs with disjoint crossing edges added. Our algorithm needs O(l) memory, where l is the maximum number of edges in any face in a graph obtained by removing one edge in each pair of crossing edges.
In the present scenario, mobile communication is being widely used in the areas where infrastructure-based telecommunication systems are unavailable or to deploy one is not cost effective. However, often users suffer ...
详细信息
ISBN:
(纸本)9781424438051
In the present scenario, mobile communication is being widely used in the areas where infrastructure-based telecommunication systems are unavailable or to deploy one is not cost effective. However, often users suffer due to the fact that mobile devices have very low computational capability and thus are incapable of executing many applications with higher resource requirements. In a Mobile Ad-hoc Network (MANET) environment, when a node (a mobile device) is unable to accomplish a job, the job may be transferred to other nodes, which can fulfill its requirements in terms of resources. In ad-hoc network-based environments, such nodes should be found on demand, i.e. an algorithm should reach every node and match the requirements of a job with the capability of each node. Movements of the nodes result in change of routes, requiring some mechanism to determine the routes to such node every time a job is submitted. This paper particularly emphasizes on the potentials of using PDAs or laptops of users within an office or in a meeting place. Users can submit their job requirements and then the request will pass through the MANET in order to search for a suitable node that would be able to respond back to the user. This paper proposes a capability aware ad-hoc routing algorithm (CAODV) for using in such scenario. CAODV gathers information regarding the capability of a node during route discovery and uses this information in selecting the node and the best route to that node. A modification of this algorithm to reduce the search for already searched routes is also presented in this paper.
To improve the stability and efficiency of routes, and satisfy the QoS requirements simultaneously, a novel multiple constrained ACO based QoS routing algorithm suitable for tactical MANETs (MC-AQRA) is proposed. MC-A...
详细信息
ISBN:
(纸本)9781424462520
To improve the stability and efficiency of routes, and satisfy the QoS requirements simultaneously, a novel multiple constrained ACO based QoS routing algorithm suitable for tactical MANETs (MC-AQRA) is proposed. MC-AQRA uses location information to estimate the link's lifetime, and integrates link lifetime and node congestion into conventional QoS requirements such as bandwidth and delay, therefore the routes established by MC-AQRA not only satisfy the conventional QoS requirements, but also have the highest stability and the least congestion. Simulation results show that MC-AQRA outperforms AODV and AntHocNet in terms of end-to-end delay, packet delivery ratio and routing overhead.
We introduce a new downward compatible routing protocol called routing Information Protocol with Minimal Topology Information (RIP-MTI) which is based on the simple routing Information Protocol (RIP). We exploit the d...
详细信息
ISBN:
(纸本)9781424442348
We introduce a new downward compatible routing protocol called routing Information Protocol with Minimal Topology Information (RIP-MTI) which is based on the simple routing Information Protocol (RIP). We exploit the distance vector updates more thoroughly than common RIP-protocols, and therefore, need not alter the interactive behavior of the routing Information Protocol. With this approach, we are able to recognize loops and avoid the well known Counting to Infinity problem of distance vector routing. This new protocol can recognize and reject updates which have made their way along loops by evaluating simple metric-based equations.
Rumor routing is a classic routing algorithm based on the random walk of agents. In this paper, a method to improve the performance of this routing algorithm is proposed. Here, we try to improve the latency and energy...
详细信息
ISBN:
(纸本)9781424410064
Rumor routing is a classic routing algorithm based on the random walk of agents. In this paper, a method to improve the performance of this routing algorithm is proposed. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents in straight lines, instead of using purely randoin walk paths. As our results confirm, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. To compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.
暂无评论