A Divergent Path of Industrial Upgrading: Emergence and Evolution of the Mobile Handset Industry in China

Starting from almost null in the late 1990s, China's mobile phone handset industry has grown to account for more than 40 percent of the current world production. While export growth has been overwhelmingly led by multi-national corporations (MNCs), increasingly fierce competition in the domestic market ignited by the advent of local handset makers has induced unique industrial evolution: (1) outgrowth of independent design houses specialized in handset development and (2) emergence of IC fabless ventures that design core ICs for handsets. In the background of this evolutionary industrial growth there are factors such as, the scale and increasing diversity of China's domestic market that advantages local firms vis-a-vis MNCs; modularization of handset and semiconductor technologies; policy interventions that supports local startups. The emergence and evolution of China's handset industry is likely to have international implications as the growth of the global demand for low-cost and multi-function mobile phone handsets is expected to accelerate. Thus, our case suggests that the conventional view of latecomer industrialization and upgrading that emphasizes the key role of international production networks organized by MNCs needs to be modified in order to accommodate China's rise into perspective.

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.