12649565
Optical nonlinear effects on the performance of IP traffic over GMPLS-based DWDM networks
With the introduction of Generalized multiprotocol label switching in the common control plane for optical crossconnects and electrical switching devices, the integration of IP and dense wavelength division multiplexing can be efficiently achieved. When IP traffic flows are directly mapped to optical channels without SDH inter-layer, the bursty nature of IP traffic may have significant effect on the performance of the optical channel. On the other hand, the nonlinear effects of the optical channel may also have significant effect on the performance at IP level. This paper focuses on the effect of fiber nonlinearities on the performance of IP traffic. Numerical results including IP packet error probability and high-order distribution functions of IP packet error are presented in terms of IP traffic load, input light signal power and the frequency space between the optical wavelengths. It is demonstrated that when IP traffic load is light in such systems, the effect of either four-wave mixing (FWM) or stimulated Raman scattering (SRS) is much less serious than the worst-case assumption, and the limitation on allowable power of input light is also relaxed. The obtained numerical results demonstrated that FWM and SRS are both sensitive to power level of input light and frequency spacing, but each in a unique way. Effort must be taken in system design to avoid improving the performance of one effect at the expense of deteriorating the other.
469745
An opportunistic video scheduling algorithm over shared wireless downlink
This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.
46136838
IPv6 traffic with multi-class QoS in VPN
Abstract This paper focuses on the modeling and performance analysis for IPv6 traffic with multi-class QoS in virtual private networks (VPNs). The multi-class QoS is implemented on differentiated service basis using priority scheme of 4 bits defined in the packet header of IPv6. A VPN-enabled IP router is modeled as a tandem queuing system in which each output link consists of two parallel priority output queues. The high-priority queue is used to carry the delay sensitive traffic while the low-priority queue is used to carry the delay insensitive traffic. On the other hand, multiple thresholds are implemented in each queue, respectively, for packet loss priority control. The performance analysis is done using fluid flow techniques. The numerical results obtained from the analysis show that the differentiated service based on the priority schemes defined in IPv6 is able to effectively satisfy the multi-class QoS requirement for supporting multimedia services in VPN. The performance trade-off between the delay sensitive traffic and delay insensitive traffic in terms of traffic throughput, packet loss probability and end-to-end delay in VPN networks is presented.
205935860
An ATM cross-connecting node using optical CDMA
An asynchronous transfer mode (ATM) cross-connecting node is proposed based on direct sequence optical code division multiple access (DS-OCDMA). No buffering is necessary to facilitate switching because code conversion is instead emulating the switching function. The switch is also capable of limited dynamic bandwidth allocation. It is free from timing jitters and switching delay is significantly reduced. The switch provides a new approach to asynchronous cross-connection in the ATM core network, locally or over a wider area. The performance with the new proposed switch is evaluated using prime and modified prime OCDMA codes.
35154579
Incorporating priority scheme in IPv6 over ATM networks
An effective approach to support multiple QoS classes in IPv6 running over ATM networks is implemented by mapping the priority field of IPv6 into the ATM format. Such a scheme might not be necessary for simple congestion control in a network of equal capacity links, however, it might be important for multicasting to destinations reachable through a very diverse capacity network. When network congestion occurs, the cell loss requirements for different services can be satisfied by selectively discarding low priority cells. As the multi-priority scheme used in IPv6 is a ''differentiated service'' mechanism to enhance the QoS by best effort, its performance is certainly affected by the background traffic when these multi-priority traffic are multiplexed at the ATM level. This paper focuses on the performance with multi-priority scheme under different traffic conditions to determine the loss characteristics. The expected results are how QoS is affected and how priority can be given for more important traffic in the case of congested network.
34513226
Incorporating priority scheme in IPv6 over ATM networks
An effective method to support multiple QoS classes in IPv6 over ATM networks is implemented by mapping of the priority field in IPv6 to the ATM cell. Such a scheme might not be necessary for simple congestion control in a network of equal capacity links; however, it might be important for multicasting to destinations reachable through a very diverse capacity network. When network congestion occurs, the cell loss requirements for different services can be satisfied by selectively discarding low priority cells. The results obtained show how the QoS can be affected by this field and how priority can be given for more important traffic in times of network congestion.
14328389
Alternative scalable algorithms for lattice-based feature location
Considering the scalability of using formal concept analysis to locate features in source code, we present a set of alternative straightforward algorithms to achieve the same objectives. A preliminary experiment indicates that the alternative algorithms are more scalable to deal with the large numbers of data to some extent.
18609835
Extraction and visualization of architectural structure based on cross references among object files
Reverse engineering of legacy systems is a knowledge-intensive process to reconstruct the understanding of a system. A semi-automatic process that can extract architecture level structure from legacy systems is introduced in This work. Exact facts related to cross-references among ELF objects are extracted from files automatically, and then partitioned into hierarchical groups by close cooperation between domain experts and an assistant tool DEREF. By resolving the cross references among these groups, the architectural structure is reconstructed and then visualized using auto-layout techniques. A case study on three embedded operating system demonstrates that this process can be used to obtain a comprehensive understanding about legacy systems even without any a priori knowledge about its design.
14677925
Universal IP multicast delivery
A ubiquitous and efficient multicast data delivery service is essential to the success of large-scale group communication applications. The original IP multicast design is to enhance network routers with multicast capability [S. Deering, D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems 8(2) (1990) 85-110]. This approach can achieve great transmission efficiency and performance but also poses a critical dependency on universal deployment. A different approach, overlay multicast, moves multicast functionality to end hosts, thereby removing the dependency on router deployment, albeit at the cost of noticeable performance penalty compared to IP multicast. In this paper we present the Universal Multicast (UM) framework, along with a set of mechanisms and protocols, to provide ubiquitous multicast delivery service on the Internet. Our design can fully utilize native IP multicast wherever it is available, and automatically build unicast tunnels to connect IP Multicast "islands" to form an overall multicast overlay. The UM design consists of three major components: an overlay multicast protocol (HMTP) for inter-island routing, an intra-island multicast management protocol (HGMP) to glue overlay multicast and native IP multicast together, and a daemon program to implement the functionality at hosts. In addition to performance evaluation through simulations, we have also implemented parts of the UM framework. Our prototype implementation has been used to broadcast several workshops and the ACM SIGCOMM 2004 conference live on the Internet. We present some statistics collected during the live broadcast and describe mechanisms we adopted to support end hosts behind Network Address Translation (NAT) gateways and firewalls.
5444394
A First Look at Peer-to-Peer Worms: Threats and Defenses
Peer-to-peer (P2P) worms exploit common vulnerabilities in member hosts of a P2P network and spread topologically in the P2P network, a potentially more effective strategy than random scanning for locating victims. This paper describes the danger posed by P2P worms and initiates the study of possible mitigation mechanisms. In particular, the paper explores the feasibility of a self-defense infrastructure inside a P2P network, outlines the challenges, evaluates how well this defense mechanism contains P2P worms, and reveals correlations between containment and the overlay topology of a P2P network. Our experiments suggest a number of design directions to improve the resilience of P2P networks to worm attacks.
9292941
Chaff: engineering an efficient SAT solver
Boolean satisfiability is probably the most studied of the combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to this problem for problem instances encountered in a range of applications in electronic design automation (EDA), as well as in artificial intelligence (AI). This study has culminated in the development of several SAT packages, both proprietary and in the public domain (e.g. GRASP, SATO) which find significant use in both research and industry. Most existing complete solvers are variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development of a new complete solver, Chaff which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy. Chaff has been able to obtain one to two orders of magnitude performance improvement on difficult SAT benchmarks in comparison with other solvers (DP or otherwise), including GRASP and SATO.