XMILE:An XML-based approach for programmable networks

In this paper we describe an XML-based platform for dynamic active node policy updates. XML supports the definitionof specific policy languages, their extension to satisfy new needs and the management of deployed policies on differentactive nodes. We show an example of the management of router packet forwarding policies where the XML policiesthat drive the packet routing are updated at run-time on the active nodes depending on the network status. The platformdecouples policy management, which is handled through XML interpretation, from packet forwarding that, forperformance reasons has to be implemented in more efficient languages

Promile: A management architecture for programmable modular routers

September 200

Short-Term Hyperglycemic Dysregulation in Patients With Type 1 Diabetes Does Not Change Myocardial Triglyceride Content or Myocardial Function

OBJECTIVE—To evaluate the effects of hyperglycemia due to partial insulin deprivation on myocardial triglyceride (TG) content and myocardial function in patients with type 1 diabetes

Characterization of the fundamental properties of wireless CSMA multi-hop networks

A wireless multi-hop network consists of a group of decentralized and self-organized wireless devices that collaborate to complete their tasks in a distributed way. Data packets are forwarded collaboratively hop-by-hop from source nodes to their respective destination nodes with other nodes acting as intermediate relays. Existing and future applications in wireless multi-hop networks will greatly benefit from better understanding of the fundamental properties of such networks. In this thesis we explore two fundamental properties of distributed wireless CSMA multi-hop networks, connectivity and capacity. A network is connected if and only if there is at least one (multi-hop) path between any pair of nodes. We investigate the critical transmission power for asymptotic connectivity in large wireless CSMA multi-hop networks under the SINR model. The critical transmission power is the minimum transmission power each node needs to transmit to guarantee that the resulting network is connected aas. Both upper bound and lower bound of the critical transmission power are obtained analytically. The two bounds are tight and differ by a constant factor only. Next we shift focus to the capacity property. First, we develop a distributed routing algorithm where each node makes routing decisions based on local information only. This is compatible with the distributed nature of large wireless CSMA multi-hop networks. Second, we show that by carefully choosing controllable parameters of the CSMA protocols, together with the routing algorithm, a distributed CSMA network can achieve the order-optimal throughput scaling law. Scaling laws are only up to order and most network design choices have a significant effect on the constants preceding the order while not affecting the scaling law. Therefore we further to analyze the pre-constant by giving an upper and a lower bound of throughput. The tightness of the bounds is validated using simulations

Effect of schottky barrier alteration on the low-frequency noise of InP based HEMTs

For the first time the effect of increasing the Schottky barrier's Al content of InP-based InAlAs-InGaAs HEMTs from 48 to 60% on the low-frequency (LF) drain and gate current noise is investigated. It is shown that the LF gate current noise SIG(f) for the 60% case decreases by almost three decades, while the LF drain current noise S IDS(f) stays at the same level. From small coherence values, it can be concluded that drain and gate noise sources can be treated separately which facilitates the LF noise modeling of these HEMT