The social structure changed previously from an Agrarian Society to an Industrial Society. Theworld is forming an Information Society and seeking more prosperity now. New ubiquitouscomputing networks
The social structure changed previously from an Agrarian Society to an Industrial Society. Theworld is forming an Information Society and seeking more prosperity now. New ubiquitouscomputing networks
Voting technology has seen various changes over the time, starting from traditional ballot voting system to the latest e-voting system. But technology couldn't affect the popularity of ballot voting system though ...
详细信息
ISBN:
(纸本)9780387287539
Voting technology has seen various changes over the time, starting from traditional ballot voting system to the latest e-voting system. But technology couldn't affect the popularity of ballot voting system though it doesn't provide desirable blend of accessibility and efficiency. We believe that an architecture that combines the efficiency of current day technology and the ease of ballot voting system will revolutionize voting. We propose a novel architecture for voting system that uses multiple channels (ATM, Internet, cellular phone, telephone and ballot) and multiple databases to show that it is ideal in achieving accessibility, efficiency, feasibility and flexibility. We show through simulations that the proposed multi channel voting system is suitable for several countries. We compare the cost of this voting system with the traditional one in different scenarios with the help of a new metric.
Large bandwidth, guaranteed quality of service (QoS), and ease of deployment, coupled with great advancements in semiconductor technologies for wireless devices make third generation (3G) wireless networks a very attr...
详细信息
Large bandwidth, guaranteed quality of service (QoS), and ease of deployment, coupled with great advancements in semiconductor technologies for wireless devices make third generation (3G) wireless networks a very attractive solution for mobile users to access the Internet. 3G wireless networks will support interactive multimedia services, so QoS support is crucial. In this paper, we briefly survey 3G network architecture and specifications for supporting QoS, using UMTS as a specific example. We also identify the problems of end-to-end QoS provisioning in the context of UMTS interworking with other public networks that form the Internet. To address these problems, we present potential solutions based on existing Internet QoS provisioning schemes.
computer security has become a critical issue with the rapid development of business and other transaction systems over the internet. Recently applying artificial intelligence, machine learning and data mining techniq...
详细信息
One of the main requirements in packet ring networks is to provide fairness in bandwidth allocation among the ring nodes. Each node must receive a fair share of the ring bandwidth and should not starve for an extended...
详细信息
One of the main requirements in packet ring networks is to provide fairness in bandwidth allocation among the ring nodes. Each node must receive a fair share of the ring bandwidth and should not starve for an extended period of time. Due to the particular architecture of the packet rings, fairness models such as max-min fairness and proportional fairness are not suitable for these networks. Ring ingress aggregated with spatial reuse (RIAS) is a proposed model for packet rings. However, it lacks generality and intuition. In this paper, a new fairness model for ring networks called ring ingress aggregated max-min (RIAMM) fairness, is proposed. This model is invariant of the source behavior. We have analyzed conditions as well as feasibility criteria for this model. Considering resilient packet ring (RPR) as a particular case, we have studied the effect of source behaviors and fairness algorithms. Three main source behaviors, namely, MF (maximally feasible), FEP (feasible equal partitioning), and SC (single choke) are studied. We show that the FEP source behavior can result in a throughput loss of up to 17%, when traffic disparity exists. It is also shown that fairness algorithms with a slow convergence can result in permanent unfairness during a congestion period.
The real-time video communications over the Internet can be affected by packet loss problem because the current Internet does not guarantee quality of service (QoS). Video applications are necessary to apply some mech...
详细信息
The real-time video communications over the Internet can be affected by packet loss problem because the current Internet does not guarantee quality of service (QoS). Video applications are necessary to apply some mechanisms to minimize the effect of packet loss. In this paper, we propose a new algorithm in adaptive quality control for real-time MPEG-4 video communications. The proposed algorithm changes the value of an encoder parameter, key frame interval, based on network congestion in order to control the quality of the received video not to be unacceptable. And the experimental result shows that the proposed algorithm can adapt the value of key frame interval appropriately and it can control the quality of the received video in both spatial and temporal quality.
One of the prime designs for the next generation IP routers is the IP-lookup mechanism. The IP lookup has become a major performance bottleneck for the routers. In this paper, we propose a complete hardware architectu...
详细信息
ISBN:
(纸本)0780388348
One of the prime designs for the next generation IP routers is the IP-lookup mechanism. The IP lookup has become a major performance bottleneck for the routers. In this paper, we propose a complete hardware architecture which includes searching, updating, inserting, and deleting functions. A simple hash hardware design is used to reduce the lookup time, and a CAM is also used to solve the collision problems effectively. The ASIC includes search unit, memory controller, 1M-byte cache and 3.18 Kbytes CAM for a 32000 entries routing table. The searching, updating and deleting functions only need 1 cycle and it is 96.88% to chance to hit the correct next hop in the first cycle.
Resilient packet ring (RPR) is being devised as part of IEEE 802.17 standard, where fairness in bandwidth allocation among ring nodes, efficiency in resource utilization, and a low computational complexity are the mai...
详细信息
Resilient packet ring (RPR) is being devised as part of IEEE 802.17 standard, where fairness in bandwidth allocation among ring nodes, efficiency in resource utilization, and a low computational complexity are the main requirements. Although recent efforts have improved the performance of the RPR fairness algorithms to have acceptable steady-state behavior, we demonstrate that current algorithms suffer from extreme unfairness and throughput loss in some dynamic traffic scenarios. In this paper, we address the bandwidth management in RPR. First, we propose a general fairness model for packet rings. Then, a new algorithm for bandwidth management in RPR called virtual queuing (VQ) is introduced. We study the fairness properties of VQ algorithm both analytically and with simulation results. Compared to the RPR standard fairness algorithms that suffer from a throughput loss of up to 28% in some cases, the throughput loss with VQ is less than 2%. Comparing to another algorithm, called distributed virtual-time scheduling in rings (DVSR), VQ has a lower computational complexity and a better performance in a dynamic traffic environment. We show that the average throttled rate of the head node in a congestion span can be up to 80% for DVSR With VQ, it is less than 4% in all cases.
This paper proposes a new micro-mobility scheme using core node. This node manages routing information for a mobile host and not to generate unnecessary messages at each base station and wired node. This scheme can pr...
详细信息
This paper proposes a new micro-mobility scheme using core node. This node manages routing information for a mobile host and not to generate unnecessary messages at each base station and wired node. This scheme can prevent control traffics from all networks and reduce packet loss and handover latency because these messages can be sent to only the core node. We have conducted distribution of traffic as messages which created at old BS and then disappeared at core node for maintenance of routing table. We have evaluated the performance of our micro-mobility scheme through a series of simulations using the network simulator 2 (ns-2)
暂无评论