The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper describes a design flow for the circuit-level optimization of a technology. The concurrent exploration of device characteristics and library design choices leads to a more application-optimal technology. We illustrate the design flow by: 1) analyzing the impact of buffer cell design, and 2) by optimizing a 130 nm technology for low operational power.
IEEE P1900.4 is an emerging standard for optimized radio resource utilization where cognitive radio technologies are used for efficient spectrum utilization. In this paper, we design and implement a cognitive wireless network system based on open documents of IEEE P1900.4, and evaluate its performance using UDP streaming and HTTP download. Our experiments show interesting results that total network...
The goal of the paper is to present a decomposed approach to optimization of inter-domain routing in IP networks. A problem of maximizing the total amount of traffic carried in an inter-domain network is formulated as a linear programme. Using Lagrangean relaxation the problem is decomposed with respect to individual domains. A resolution method based on subgradient optimization combined with recovering...
Wireless Mesh Networks are a scalable and cost-effective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (RWP) which solves a joint routing and scheduling problem to satisfy a given demand subjected to the multi-access interferences. We propose a multiobjective approach that deals with two objectives. The first one is to balance the load...
In this paper, we introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
This paper describes a new path computation model in Multi-protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. It introduces a path computation element (PCE), which is functionally separate from label switching routers (LSRs). The Path Computation Element (PCE) is an entity that is capable of computing a network path or route based on a network graph, and applying computational...
We present a novel detailed placement technique that accounts for systematic through-pitch variations to reduce leakage. Leakage depends nearly exponentially on linewidth (gate length), and even small variations in linewidth introduce large variability in leakage. A substantial fraction of linewidth variation is systematic with respect to the device layout context. Detailed placement changes context...
We consider the problem of approximating an integer program by first solving its relaxation linear program and "rounding" the resulting solution. For several packing problems, we prove probabilistically that there exists an integer solution close to the optimum of the relaxation solution. We then develop a methodology for converting such a probabilistic existence proof to a deterministic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.